/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:25,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:25,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:25,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:25,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:25,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:25,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:25,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:25,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:25,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:25,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:25,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:25,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:25,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:25,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:25,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:25,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:25,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:25,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:25,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:25,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:25,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:25,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:25,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:25,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:25,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:25,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:25,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:25,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:25,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:25,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:25,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:25,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:25,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:25,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:25,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:25,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:25,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:25,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:25,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:25,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:25,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 06:05:25,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:25,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:25,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:25,699 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:25,700 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:25,700 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:25,700 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:25,700 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:25,700 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:25,700 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:25,701 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:25,706 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:25,706 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:25,706 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:25,707 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:25,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:25,708 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:25,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:25,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:25,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:25,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:25,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:25,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:25,709 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:25,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:25,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:25,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:25,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:25,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:25,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:25,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:25,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:25,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:25,714 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:25,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:25,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:25,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:25,715 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:25,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:26,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:26,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:26,017 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:26,017 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:26,018 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-11-24 06:05:26,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80d62fe3/62500398f04845aeaa8f978f87e33551/FLAGf33e77c68 [2019-11-24 06:05:26,554 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:26,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-11-24 06:05:26,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80d62fe3/62500398f04845aeaa8f978f87e33551/FLAGf33e77c68 [2019-11-24 06:05:26,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80d62fe3/62500398f04845aeaa8f978f87e33551 [2019-11-24 06:05:26,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:05:26,956 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:05:26,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:26,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:05:26,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:05:26,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:26" (1/1) ... [2019-11-24 06:05:26,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59675079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:26, skipping insertion in model container [2019-11-24 06:05:26,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:26" (1/1) ... [2019-11-24 06:05:26,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:05:27,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:05:27,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:27,263 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:05:27,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:27,431 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:05:27,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27 WrapperNode [2019-11-24 06:05:27,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:27,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:27,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:05:27,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:05:27,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:27,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:05:27,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:05:27,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:05:27,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:05:27,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:05:27,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:05:27,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:05:27,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (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-11-24 06:05:27,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:05:27,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:05:29,786 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:05:29,787 INFO L284 CfgBuilder]: Removed 130 assume(true) statements. [2019-11-24 06:05:29,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:29 BoogieIcfgContainer [2019-11-24 06:05:29,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:05:29,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:05:29,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:05:29,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:05:29,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:05:26" (1/3) ... [2019-11-24 06:05:29,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e730ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:29, skipping insertion in model container [2019-11-24 06:05:29,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27" (2/3) ... [2019-11-24 06:05:29,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e730ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:29, skipping insertion in model container [2019-11-24 06:05:29,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:29" (3/3) ... [2019-11-24 06:05:29,798 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2019-11-24 06:05:29,808 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:05:29,820 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:05:29,832 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:05:29,895 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:05:29,895 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:05:29,895 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:05:29,895 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:05:29,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:05:29,896 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:05:29,896 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:05:29,896 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:05:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-24 06:05:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 06:05:29,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,921 INFO L410 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] [2019-11-24 06:05:29,921 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1096111314, now seen corresponding path program 1 times [2019-11-24 06:05:29,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918795187] [2019-11-24 06:05:29,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:30,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918795187] [2019-11-24 06:05:30,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:30,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:30,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502782988] [2019-11-24 06:05:30,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:30,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:30,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:30,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:30,113 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-11-24 06:05:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:30,262 INFO L93 Difference]: Finished difference Result 406 states and 623 transitions. [2019-11-24 06:05:30,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:30,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 06:05:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:30,289 INFO L225 Difference]: With dead ends: 406 [2019-11-24 06:05:30,290 INFO L226 Difference]: Without dead ends: 259 [2019-11-24 06:05:30,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:05:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-24 06:05:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2019-11-24 06:05:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-24 06:05:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 364 transitions. [2019-11-24 06:05:30,383 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 364 transitions. Word has length 22 [2019-11-24 06:05:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:30,384 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 364 transitions. [2019-11-24 06:05:30,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 364 transitions. [2019-11-24 06:05:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:30,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:30,387 INFO L410 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] [2019-11-24 06:05:30,387 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -495224614, now seen corresponding path program 1 times [2019-11-24 06:05:30,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:30,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360670075] [2019-11-24 06:05:30,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 06:05:30,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360670075] [2019-11-24 06:05:30,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:30,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:30,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118231710] [2019-11-24 06:05:30,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:30,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:30,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:30,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:30,466 INFO L87 Difference]: Start difference. First operand 245 states and 364 transitions. Second operand 3 states. [2019-11-24 06:05:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:30,548 INFO L93 Difference]: Finished difference Result 669 states and 993 transitions. [2019-11-24 06:05:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:30,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 06:05:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:30,552 INFO L225 Difference]: With dead ends: 669 [2019-11-24 06:05:30,552 INFO L226 Difference]: Without dead ends: 433 [2019-11-24 06:05:30,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:05:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-24 06:05:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 429. [2019-11-24 06:05:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-24 06:05:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 626 transitions. [2019-11-24 06:05:30,598 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 626 transitions. Word has length 43 [2019-11-24 06:05:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:30,598 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 626 transitions. [2019-11-24 06:05:30,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 626 transitions. [2019-11-24 06:05:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:30,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:30,606 INFO L410 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] [2019-11-24 06:05:30,606 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:30,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2034926073, now seen corresponding path program 1 times [2019-11-24 06:05:30,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:30,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813661466] [2019-11-24 06:05:30,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 06:05:30,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813661466] [2019-11-24 06:05:30,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:30,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:30,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372537356] [2019-11-24 06:05:30,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:30,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:30,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:30,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:30,724 INFO L87 Difference]: Start difference. First operand 429 states and 626 transitions. Second operand 3 states. [2019-11-24 06:05:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:30,802 INFO L93 Difference]: Finished difference Result 1183 states and 1726 transitions. [2019-11-24 06:05:30,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:30,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 06:05:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:30,810 INFO L225 Difference]: With dead ends: 1183 [2019-11-24 06:05:30,811 INFO L226 Difference]: Without dead ends: 766 [2019-11-24 06:05:30,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:05:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-11-24 06:05:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 760. [2019-11-24 06:05:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-11-24 06:05:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1089 transitions. [2019-11-24 06:05:30,861 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1089 transitions. Word has length 43 [2019-11-24 06:05:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:30,862 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1089 transitions. [2019-11-24 06:05:30,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1089 transitions. [2019-11-24 06:05:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:30,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:30,867 INFO L410 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] [2019-11-24 06:05:30,867 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:30,868 INFO L82 PathProgramCache]: Analyzing trace with hash -545992807, now seen corresponding path program 1 times [2019-11-24 06:05:30,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:30,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807270533] [2019-11-24 06:05:30,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:30,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807270533] [2019-11-24 06:05:30,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:30,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:30,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659583069] [2019-11-24 06:05:30,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:30,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:30,993 INFO L87 Difference]: Start difference. First operand 760 states and 1089 transitions. Second operand 3 states. [2019-11-24 06:05:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:31,079 INFO L93 Difference]: Finished difference Result 2188 states and 3119 transitions. [2019-11-24 06:05:31,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:31,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 06:05:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:31,088 INFO L225 Difference]: With dead ends: 2188 [2019-11-24 06:05:31,088 INFO L226 Difference]: Without dead ends: 1433 [2019-11-24 06:05:31,090 INFO L630 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-11-24 06:05:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-11-24 06:05:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1351. [2019-11-24 06:05:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2019-11-24 06:05:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1902 transitions. [2019-11-24 06:05:31,140 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1902 transitions. Word has length 43 [2019-11-24 06:05:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:31,141 INFO L462 AbstractCegarLoop]: Abstraction has 1351 states and 1902 transitions. [2019-11-24 06:05:31,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1902 transitions. [2019-11-24 06:05:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:31,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:31,144 INFO L410 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] [2019-11-24 06:05:31,144 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash 115340984, now seen corresponding path program 1 times [2019-11-24 06:05:31,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:31,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866349068] [2019-11-24 06:05:31,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:31,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866349068] [2019-11-24 06:05:31,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:31,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:31,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958148885] [2019-11-24 06:05:31,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:31,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:31,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:31,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:31,237 INFO L87 Difference]: Start difference. First operand 1351 states and 1902 transitions. Second operand 4 states. [2019-11-24 06:05:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:31,400 INFO L93 Difference]: Finished difference Result 3329 states and 4811 transitions. [2019-11-24 06:05:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:31,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-24 06:05:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:31,412 INFO L225 Difference]: With dead ends: 3329 [2019-11-24 06:05:31,412 INFO L226 Difference]: Without dead ends: 1991 [2019-11-24 06:05:31,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-24 06:05:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1615. [2019-11-24 06:05:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-24 06:05:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2350 transitions. [2019-11-24 06:05:31,487 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2350 transitions. Word has length 43 [2019-11-24 06:05:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:31,488 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2350 transitions. [2019-11-24 06:05:31,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2350 transitions. [2019-11-24 06:05:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 06:05:31,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:31,492 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:31,493 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:31,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash 527776824, now seen corresponding path program 1 times [2019-11-24 06:05:31,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:31,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819621512] [2019-11-24 06:05:31,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:31,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819621512] [2019-11-24 06:05:31,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:31,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:31,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205904538] [2019-11-24 06:05:31,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:31,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:31,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:31,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:31,550 INFO L87 Difference]: Start difference. First operand 1615 states and 2350 transitions. Second operand 3 states. [2019-11-24 06:05:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:31,638 INFO L93 Difference]: Finished difference Result 2605 states and 3787 transitions. [2019-11-24 06:05:31,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:31,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-24 06:05:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:31,647 INFO L225 Difference]: With dead ends: 2605 [2019-11-24 06:05:31,647 INFO L226 Difference]: Without dead ends: 1715 [2019-11-24 06:05:31,649 INFO L630 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-11-24 06:05:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-24 06:05:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1615. [2019-11-24 06:05:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-24 06:05:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2298 transitions. [2019-11-24 06:05:31,707 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2298 transitions. Word has length 62 [2019-11-24 06:05:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:31,708 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2298 transitions. [2019-11-24 06:05:31,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2298 transitions. [2019-11-24 06:05:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 06:05:31,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:31,712 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:31,712 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2118171801, now seen corresponding path program 1 times [2019-11-24 06:05:31,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:31,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165998317] [2019-11-24 06:05:31,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:31,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165998317] [2019-11-24 06:05:31,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:31,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:31,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374770799] [2019-11-24 06:05:31,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:31,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:31,805 INFO L87 Difference]: Start difference. First operand 1615 states and 2298 transitions. Second operand 4 states. [2019-11-24 06:05:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:31,921 INFO L93 Difference]: Finished difference Result 2537 states and 3607 transitions. [2019-11-24 06:05:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:31,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-24 06:05:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:31,930 INFO L225 Difference]: With dead ends: 2537 [2019-11-24 06:05:31,930 INFO L226 Difference]: Without dead ends: 1663 [2019-11-24 06:05:31,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-11-24 06:05:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1615. [2019-11-24 06:05:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-24 06:05:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2266 transitions. [2019-11-24 06:05:31,998 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2266 transitions. Word has length 62 [2019-11-24 06:05:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:31,998 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2266 transitions. [2019-11-24 06:05:31,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2266 transitions. [2019-11-24 06:05:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 06:05:32,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:32,003 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:32,003 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:32,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1903494512, now seen corresponding path program 1 times [2019-11-24 06:05:32,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:32,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359912525] [2019-11-24 06:05:32,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:32,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359912525] [2019-11-24 06:05:32,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983362798] [2019-11-24 06:05:32,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:32,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:32,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:32,260 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:32,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:32,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:32,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:32,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:32,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870989602] [2019-11-24 06:05:32,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:32,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:32,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:32,285 INFO L87 Difference]: Start difference. First operand 1615 states and 2266 transitions. Second operand 3 states. [2019-11-24 06:05:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:32,451 INFO L93 Difference]: Finished difference Result 3919 states and 5518 transitions. [2019-11-24 06:05:32,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:32,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-24 06:05:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:32,464 INFO L225 Difference]: With dead ends: 3919 [2019-11-24 06:05:32,464 INFO L226 Difference]: Without dead ends: 2317 [2019-11-24 06:05:32,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-11-24 06:05:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2315. [2019-11-24 06:05:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2019-11-24 06:05:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3232 transitions. [2019-11-24 06:05:32,605 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3232 transitions. Word has length 63 [2019-11-24 06:05:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:32,606 INFO L462 AbstractCegarLoop]: Abstraction has 2315 states and 3232 transitions. [2019-11-24 06:05:32,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3232 transitions. [2019-11-24 06:05:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 06:05:32,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:32,613 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:32,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:32,827 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:32,828 INFO L82 PathProgramCache]: Analyzing trace with hash -338448342, now seen corresponding path program 1 times [2019-11-24 06:05:32,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:32,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254113238] [2019-11-24 06:05:32,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:33,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254113238] [2019-11-24 06:05:33,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:33,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:05:33,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458570924] [2019-11-24 06:05:33,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:33,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:33,025 INFO L87 Difference]: Start difference. First operand 2315 states and 3232 transitions. Second operand 6 states. [2019-11-24 06:05:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:33,295 INFO L93 Difference]: Finished difference Result 4380 states and 6126 transitions. [2019-11-24 06:05:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 06:05:33,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-24 06:05:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:33,311 INFO L225 Difference]: With dead ends: 4380 [2019-11-24 06:05:33,311 INFO L226 Difference]: Without dead ends: 3120 [2019-11-24 06:05:33,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:05:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-11-24 06:05:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2641. [2019-11-24 06:05:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2641 states. [2019-11-24 06:05:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3748 transitions. [2019-11-24 06:05:33,441 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3748 transitions. Word has length 64 [2019-11-24 06:05:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:33,442 INFO L462 AbstractCegarLoop]: Abstraction has 2641 states and 3748 transitions. [2019-11-24 06:05:33,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3748 transitions. [2019-11-24 06:05:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 06:05:33,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:33,449 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:33,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:33,450 INFO L82 PathProgramCache]: Analyzing trace with hash -654493223, now seen corresponding path program 1 times [2019-11-24 06:05:33,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:33,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218232357] [2019-11-24 06:05:33,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:33,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218232357] [2019-11-24 06:05:33,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598861561] [2019-11-24 06:05:33,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:33,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:33,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:33,682 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:33,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:33,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:33,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:33,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:33,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401661887] [2019-11-24 06:05:33,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:33,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:33,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:33,704 INFO L87 Difference]: Start difference. First operand 2641 states and 3748 transitions. Second operand 3 states. [2019-11-24 06:05:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:33,900 INFO L93 Difference]: Finished difference Result 6390 states and 9078 transitions. [2019-11-24 06:05:33,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:33,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-24 06:05:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:33,918 INFO L225 Difference]: With dead ends: 6390 [2019-11-24 06:05:33,918 INFO L226 Difference]: Without dead ends: 3762 [2019-11-24 06:05:33,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3762 states. [2019-11-24 06:05:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3762 to 3760. [2019-11-24 06:05:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3760 states. [2019-11-24 06:05:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 5270 transitions. [2019-11-24 06:05:34,079 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 5270 transitions. Word has length 65 [2019-11-24 06:05:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:34,079 INFO L462 AbstractCegarLoop]: Abstraction has 3760 states and 5270 transitions. [2019-11-24 06:05:34,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 5270 transitions. [2019-11-24 06:05:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 06:05:34,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:34,087 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:34,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:34,291 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2023230088, now seen corresponding path program 1 times [2019-11-24 06:05:34,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:34,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61566631] [2019-11-24 06:05:34,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:34,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61566631] [2019-11-24 06:05:34,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681828341] [2019-11-24 06:05:34,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:34,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-24 06:05:34,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:34,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:34,503 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:34,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:34,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [5] total 10 [2019-11-24 06:05:34,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593766758] [2019-11-24 06:05:34,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 06:05:34,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:34,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 06:05:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-24 06:05:34,531 INFO L87 Difference]: Start difference. First operand 3760 states and 5270 transitions. Second operand 8 states. [2019-11-24 06:05:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:35,553 INFO L93 Difference]: Finished difference Result 14103 states and 19908 transitions. [2019-11-24 06:05:35,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 06:05:35,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-11-24 06:05:35,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:35,632 INFO L225 Difference]: With dead ends: 14103 [2019-11-24 06:05:35,632 INFO L226 Difference]: Without dead ends: 10356 [2019-11-24 06:05:35,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-11-24 06:05:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10356 states. [2019-11-24 06:05:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10356 to 6285. [2019-11-24 06:05:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6285 states. [2019-11-24 06:05:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 8751 transitions. [2019-11-24 06:05:36,078 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 8751 transitions. Word has length 66 [2019-11-24 06:05:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:36,078 INFO L462 AbstractCegarLoop]: Abstraction has 6285 states and 8751 transitions. [2019-11-24 06:05:36,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 06:05:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 8751 transitions. [2019-11-24 06:05:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 06:05:36,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:36,101 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:36,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:36,305 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash 545826369, now seen corresponding path program 1 times [2019-11-24 06:05:36,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:36,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330084655] [2019-11-24 06:05:36,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:36,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330084655] [2019-11-24 06:05:36,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:36,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 06:05:36,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58461134] [2019-11-24 06:05:36,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 06:05:36,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:36,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 06:05:36,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:05:36,423 INFO L87 Difference]: Start difference. First operand 6285 states and 8751 transitions. Second operand 7 states. [2019-11-24 06:05:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:36,975 INFO L93 Difference]: Finished difference Result 9470 states and 13123 transitions. [2019-11-24 06:05:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 06:05:36,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-24 06:05:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:36,988 INFO L225 Difference]: With dead ends: 9470 [2019-11-24 06:05:36,989 INFO L226 Difference]: Without dead ends: 6700 [2019-11-24 06:05:36,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-24 06:05:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6700 states. [2019-11-24 06:05:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6700 to 6360. [2019-11-24 06:05:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6360 states. [2019-11-24 06:05:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6360 states to 6360 states and 8847 transitions. [2019-11-24 06:05:37,259 INFO L78 Accepts]: Start accepts. Automaton has 6360 states and 8847 transitions. Word has length 67 [2019-11-24 06:05:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:37,259 INFO L462 AbstractCegarLoop]: Abstraction has 6360 states and 8847 transitions. [2019-11-24 06:05:37,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 06:05:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 6360 states and 8847 transitions. [2019-11-24 06:05:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 06:05:37,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:37,270 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:37,271 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:37,271 INFO L82 PathProgramCache]: Analyzing trace with hash -707739700, now seen corresponding path program 1 times [2019-11-24 06:05:37,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:37,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902695283] [2019-11-24 06:05:37,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:37,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902695283] [2019-11-24 06:05:37,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:37,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:37,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221896613] [2019-11-24 06:05:37,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:37,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:37,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:37,316 INFO L87 Difference]: Start difference. First operand 6360 states and 8847 transitions. Second operand 3 states. [2019-11-24 06:05:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:37,647 INFO L93 Difference]: Finished difference Result 10817 states and 15103 transitions. [2019-11-24 06:05:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:37,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-24 06:05:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:37,660 INFO L225 Difference]: With dead ends: 10817 [2019-11-24 06:05:37,660 INFO L226 Difference]: Without dead ends: 6386 [2019-11-24 06:05:37,666 INFO L630 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-11-24 06:05:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6386 states. [2019-11-24 06:05:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6386 to 6262. [2019-11-24 06:05:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6262 states. [2019-11-24 06:05:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 8442 transitions. [2019-11-24 06:05:37,927 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 8442 transitions. Word has length 69 [2019-11-24 06:05:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:37,927 INFO L462 AbstractCegarLoop]: Abstraction has 6262 states and 8442 transitions. [2019-11-24 06:05:37,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 8442 transitions. [2019-11-24 06:05:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 06:05:37,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:37,939 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:37,939 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash 362683979, now seen corresponding path program 1 times [2019-11-24 06:05:37,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:37,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066415281] [2019-11-24 06:05:37,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:38,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066415281] [2019-11-24 06:05:38,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:38,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:38,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699560093] [2019-11-24 06:05:38,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:38,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:38,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:38,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:38,005 INFO L87 Difference]: Start difference. First operand 6262 states and 8442 transitions. Second operand 4 states. [2019-11-24 06:05:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:38,268 INFO L93 Difference]: Finished difference Result 10732 states and 14513 transitions. [2019-11-24 06:05:38,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:38,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-24 06:05:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:38,289 INFO L225 Difference]: With dead ends: 10732 [2019-11-24 06:05:38,289 INFO L226 Difference]: Without dead ends: 6330 [2019-11-24 06:05:38,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6330 states. [2019-11-24 06:05:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6330 to 6262. [2019-11-24 06:05:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6262 states. [2019-11-24 06:05:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 8309 transitions. [2019-11-24 06:05:38,662 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 8309 transitions. Word has length 69 [2019-11-24 06:05:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:38,662 INFO L462 AbstractCegarLoop]: Abstraction has 6262 states and 8309 transitions. [2019-11-24 06:05:38,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 8309 transitions. [2019-11-24 06:05:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 06:05:38,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:38,677 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:38,677 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1503035690, now seen corresponding path program 1 times [2019-11-24 06:05:38,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:38,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076254388] [2019-11-24 06:05:38,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:38,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076254388] [2019-11-24 06:05:38,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:38,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:38,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203569044] [2019-11-24 06:05:38,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:38,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:38,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:38,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:38,722 INFO L87 Difference]: Start difference. First operand 6262 states and 8309 transitions. Second operand 3 states. [2019-11-24 06:05:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:38,984 INFO L93 Difference]: Finished difference Result 10687 states and 14193 transitions. [2019-11-24 06:05:38,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:38,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-24 06:05:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:38,998 INFO L225 Difference]: With dead ends: 10687 [2019-11-24 06:05:38,998 INFO L226 Difference]: Without dead ends: 6285 [2019-11-24 06:05:39,005 INFO L630 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-11-24 06:05:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2019-11-24 06:05:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 6176. [2019-11-24 06:05:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6176 states. [2019-11-24 06:05:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6176 states to 6176 states and 7928 transitions. [2019-11-24 06:05:39,721 INFO L78 Accepts]: Start accepts. Automaton has 6176 states and 7928 transitions. Word has length 69 [2019-11-24 06:05:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:39,721 INFO L462 AbstractCegarLoop]: Abstraction has 6176 states and 7928 transitions. [2019-11-24 06:05:39,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 6176 states and 7928 transitions. [2019-11-24 06:05:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 06:05:39,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:39,732 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:39,732 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1181558282, now seen corresponding path program 1 times [2019-11-24 06:05:39,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:39,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500323261] [2019-11-24 06:05:39,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:39,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500323261] [2019-11-24 06:05:39,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:39,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:39,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46826017] [2019-11-24 06:05:39,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:39,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:39,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:39,784 INFO L87 Difference]: Start difference. First operand 6176 states and 7928 transitions. Second operand 4 states. [2019-11-24 06:05:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:40,077 INFO L93 Difference]: Finished difference Result 12986 states and 16818 transitions. [2019-11-24 06:05:40,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:40,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-24 06:05:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:40,096 INFO L225 Difference]: With dead ends: 12986 [2019-11-24 06:05:40,096 INFO L226 Difference]: Without dead ends: 8761 [2019-11-24 06:05:40,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8761 states. [2019-11-24 06:05:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8761 to 6602. [2019-11-24 06:05:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6602 states. [2019-11-24 06:05:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6602 states to 6602 states and 8586 transitions. [2019-11-24 06:05:40,427 INFO L78 Accepts]: Start accepts. Automaton has 6602 states and 8586 transitions. Word has length 70 [2019-11-24 06:05:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:40,427 INFO L462 AbstractCegarLoop]: Abstraction has 6602 states and 8586 transitions. [2019-11-24 06:05:40,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6602 states and 8586 transitions. [2019-11-24 06:05:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 06:05:40,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:40,437 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:40,437 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1480155978, now seen corresponding path program 1 times [2019-11-24 06:05:40,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:40,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491380027] [2019-11-24 06:05:40,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:40,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491380027] [2019-11-24 06:05:40,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:40,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:40,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354815603] [2019-11-24 06:05:40,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:40,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:40,503 INFO L87 Difference]: Start difference. First operand 6602 states and 8586 transitions. Second operand 4 states. [2019-11-24 06:05:40,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:40,798 INFO L93 Difference]: Finished difference Result 11245 states and 14643 transitions. [2019-11-24 06:05:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:40,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-24 06:05:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:40,809 INFO L225 Difference]: With dead ends: 11245 [2019-11-24 06:05:40,809 INFO L226 Difference]: Without dead ends: 6624 [2019-11-24 06:05:40,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6624 states. [2019-11-24 06:05:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6624 to 6602. [2019-11-24 06:05:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6602 states. [2019-11-24 06:05:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6602 states to 6602 states and 8464 transitions. [2019-11-24 06:05:41,159 INFO L78 Accepts]: Start accepts. Automaton has 6602 states and 8464 transitions. Word has length 70 [2019-11-24 06:05:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:41,160 INFO L462 AbstractCegarLoop]: Abstraction has 6602 states and 8464 transitions. [2019-11-24 06:05:41,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 6602 states and 8464 transitions. [2019-11-24 06:05:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 06:05:41,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:41,172 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:41,173 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:41,173 INFO L82 PathProgramCache]: Analyzing trace with hash -591373394, now seen corresponding path program 1 times [2019-11-24 06:05:41,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:41,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008502801] [2019-11-24 06:05:41,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:41,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008502801] [2019-11-24 06:05:41,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569434534] [2019-11-24 06:05:41,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:41,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:41,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:41,467 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:41,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:41,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:41,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:41,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:41,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958629984] [2019-11-24 06:05:41,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:41,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:41,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:41,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:41,488 INFO L87 Difference]: Start difference. First operand 6602 states and 8464 transitions. Second operand 3 states. [2019-11-24 06:05:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:41,833 INFO L93 Difference]: Finished difference Result 14069 states and 18085 transitions. [2019-11-24 06:05:41,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:41,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-24 06:05:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:41,842 INFO L225 Difference]: With dead ends: 14069 [2019-11-24 06:05:41,842 INFO L226 Difference]: Without dead ends: 7481 [2019-11-24 06:05:41,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7481 states. [2019-11-24 06:05:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7481 to 7462. [2019-11-24 06:05:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7462 states. [2019-11-24 06:05:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 9489 transitions. [2019-11-24 06:05:42,210 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 9489 transitions. Word has length 71 [2019-11-24 06:05:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:42,210 INFO L462 AbstractCegarLoop]: Abstraction has 7462 states and 9489 transitions. [2019-11-24 06:05:42,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 9489 transitions. [2019-11-24 06:05:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 06:05:42,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:42,223 INFO L410 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] [2019-11-24 06:05:42,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:42,427 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash -14451245, now seen corresponding path program 1 times [2019-11-24 06:05:42,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:42,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26452281] [2019-11-24 06:05:42,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:42,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26452281] [2019-11-24 06:05:42,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:42,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:42,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277369499] [2019-11-24 06:05:42,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:42,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:42,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:42,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:42,473 INFO L87 Difference]: Start difference. First operand 7462 states and 9489 transitions. Second operand 4 states. [2019-11-24 06:05:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:42,913 INFO L93 Difference]: Finished difference Result 14382 states and 18404 transitions. [2019-11-24 06:05:42,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:42,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-24 06:05:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:42,922 INFO L225 Difference]: With dead ends: 14382 [2019-11-24 06:05:42,922 INFO L226 Difference]: Without dead ends: 9321 [2019-11-24 06:05:42,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9321 states. [2019-11-24 06:05:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9321 to 7489. [2019-11-24 06:05:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7489 states. [2019-11-24 06:05:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7489 states to 7489 states and 9584 transitions. [2019-11-24 06:05:43,287 INFO L78 Accepts]: Start accepts. Automaton has 7489 states and 9584 transitions. Word has length 74 [2019-11-24 06:05:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:43,288 INFO L462 AbstractCegarLoop]: Abstraction has 7489 states and 9584 transitions. [2019-11-24 06:05:43,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 7489 states and 9584 transitions. [2019-11-24 06:05:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 06:05:43,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:43,294 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:43,294 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash 794189323, now seen corresponding path program 1 times [2019-11-24 06:05:43,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:43,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030704981] [2019-11-24 06:05:43,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:43,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030704981] [2019-11-24 06:05:43,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:43,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:43,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581148546] [2019-11-24 06:05:43,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:43,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:43,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:43,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:43,350 INFO L87 Difference]: Start difference. First operand 7489 states and 9584 transitions. Second operand 4 states. [2019-11-24 06:05:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:43,801 INFO L93 Difference]: Finished difference Result 14540 states and 18604 transitions. [2019-11-24 06:05:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:43,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-24 06:05:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:43,813 INFO L225 Difference]: With dead ends: 14540 [2019-11-24 06:05:43,813 INFO L226 Difference]: Without dead ends: 7639 [2019-11-24 06:05:43,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2019-11-24 06:05:44,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 7489. [2019-11-24 06:05:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7489 states. [2019-11-24 06:05:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7489 states to 7489 states and 9494 transitions. [2019-11-24 06:05:44,219 INFO L78 Accepts]: Start accepts. Automaton has 7489 states and 9494 transitions. Word has length 74 [2019-11-24 06:05:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:44,220 INFO L462 AbstractCegarLoop]: Abstraction has 7489 states and 9494 transitions. [2019-11-24 06:05:44,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7489 states and 9494 transitions. [2019-11-24 06:05:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 06:05:44,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:44,228 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:44,229 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170252, now seen corresponding path program 1 times [2019-11-24 06:05:44,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:44,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701076388] [2019-11-24 06:05:44,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:44,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701076388] [2019-11-24 06:05:44,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:44,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:44,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123636345] [2019-11-24 06:05:44,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:44,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:44,280 INFO L87 Difference]: Start difference. First operand 7489 states and 9494 transitions. Second operand 3 states. [2019-11-24 06:05:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:44,519 INFO L93 Difference]: Finished difference Result 11180 states and 14251 transitions. [2019-11-24 06:05:44,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:44,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-24 06:05:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:44,523 INFO L225 Difference]: With dead ends: 11180 [2019-11-24 06:05:44,523 INFO L226 Difference]: Without dead ends: 4279 [2019-11-24 06:05:44,528 INFO L630 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-11-24 06:05:44,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2019-11-24 06:05:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4053. [2019-11-24 06:05:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2019-11-24 06:05:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 4949 transitions. [2019-11-24 06:05:44,677 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 4949 transitions. Word has length 74 [2019-11-24 06:05:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:44,677 INFO L462 AbstractCegarLoop]: Abstraction has 4053 states and 4949 transitions. [2019-11-24 06:05:44,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 4949 transitions. [2019-11-24 06:05:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:05:44,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:44,683 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:44,683 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1478497803, now seen corresponding path program 1 times [2019-11-24 06:05:44,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:44,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645549389] [2019-11-24 06:05:44,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:44,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645549389] [2019-11-24 06:05:44,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335788332] [2019-11-24 06:05:44,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:44,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 06:05:44,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:44,884 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:44,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:44,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:05:44,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2019-11-24 06:05:44,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126403830] [2019-11-24 06:05:44,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:44,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:44,972 INFO L87 Difference]: Start difference. First operand 4053 states and 4949 transitions. Second operand 6 states. [2019-11-24 06:05:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:45,407 INFO L93 Difference]: Finished difference Result 9038 states and 10854 transitions. [2019-11-24 06:05:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 06:05:45,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-11-24 06:05:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:45,415 INFO L225 Difference]: With dead ends: 9038 [2019-11-24 06:05:45,415 INFO L226 Difference]: Without dead ends: 6346 [2019-11-24 06:05:45,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-11-24 06:05:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6346 states. [2019-11-24 06:05:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6346 to 5193. [2019-11-24 06:05:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2019-11-24 06:05:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6139 transitions. [2019-11-24 06:05:45,627 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6139 transitions. Word has length 75 [2019-11-24 06:05:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:45,627 INFO L462 AbstractCegarLoop]: Abstraction has 5193 states and 6139 transitions. [2019-11-24 06:05:45,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6139 transitions. [2019-11-24 06:05:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:05:45,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:45,631 INFO L410 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] [2019-11-24 06:05:45,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:45,834 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:45,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687200, now seen corresponding path program 1 times [2019-11-24 06:05:45,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:45,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710394295] [2019-11-24 06:05:45,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:45,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710394295] [2019-11-24 06:05:45,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:45,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:45,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46284244] [2019-11-24 06:05:45,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:45,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:45,889 INFO L87 Difference]: Start difference. First operand 5193 states and 6139 transitions. Second operand 5 states. [2019-11-24 06:05:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:46,472 INFO L93 Difference]: Finished difference Result 10716 states and 12544 transitions. [2019-11-24 06:05:46,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:46,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-24 06:05:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:46,477 INFO L225 Difference]: With dead ends: 10716 [2019-11-24 06:05:46,478 INFO L226 Difference]: Without dead ends: 7061 [2019-11-24 06:05:46,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7061 states. [2019-11-24 06:05:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7061 to 5551. [2019-11-24 06:05:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5551 states. [2019-11-24 06:05:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 6455 transitions. [2019-11-24 06:05:46,698 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 6455 transitions. Word has length 75 [2019-11-24 06:05:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:46,698 INFO L462 AbstractCegarLoop]: Abstraction has 5551 states and 6455 transitions. [2019-11-24 06:05:46,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 6455 transitions. [2019-11-24 06:05:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:05:46,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:46,700 INFO L410 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] [2019-11-24 06:05:46,701 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:46,701 INFO L82 PathProgramCache]: Analyzing trace with hash 584416540, now seen corresponding path program 1 times [2019-11-24 06:05:46,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:46,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296394205] [2019-11-24 06:05:46,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:46,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296394205] [2019-11-24 06:05:46,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:46,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:46,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694826666] [2019-11-24 06:05:46,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:46,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:46,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:46,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:46,790 INFO L87 Difference]: Start difference. First operand 5551 states and 6455 transitions. Second operand 4 states. [2019-11-24 06:05:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:47,233 INFO L93 Difference]: Finished difference Result 12827 states and 14798 transitions. [2019-11-24 06:05:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:47,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-24 06:05:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:47,238 INFO L225 Difference]: With dead ends: 12827 [2019-11-24 06:05:47,238 INFO L226 Difference]: Without dead ends: 5406 [2019-11-24 06:05:47,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2019-11-24 06:05:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 4215. [2019-11-24 06:05:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4215 states. [2019-11-24 06:05:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4215 states to 4215 states and 4829 transitions. [2019-11-24 06:05:47,408 INFO L78 Accepts]: Start accepts. Automaton has 4215 states and 4829 transitions. Word has length 75 [2019-11-24 06:05:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:47,409 INFO L462 AbstractCegarLoop]: Abstraction has 4215 states and 4829 transitions. [2019-11-24 06:05:47,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4215 states and 4829 transitions. [2019-11-24 06:05:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-24 06:05:47,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:47,411 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:47,411 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:47,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:47,411 INFO L82 PathProgramCache]: Analyzing trace with hash -213304305, now seen corresponding path program 1 times [2019-11-24 06:05:47,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:47,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294727291] [2019-11-24 06:05:47,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:47,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294727291] [2019-11-24 06:05:47,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:47,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:47,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282721694] [2019-11-24 06:05:47,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:47,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:47,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:47,491 INFO L87 Difference]: Start difference. First operand 4215 states and 4829 transitions. Second operand 4 states. [2019-11-24 06:05:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:47,858 INFO L93 Difference]: Finished difference Result 8150 states and 9334 transitions. [2019-11-24 06:05:47,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:47,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-24 06:05:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:47,863 INFO L225 Difference]: With dead ends: 8150 [2019-11-24 06:05:47,863 INFO L226 Difference]: Without dead ends: 4517 [2019-11-24 06:05:47,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-11-24 06:05:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 3727. [2019-11-24 06:05:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2019-11-24 06:05:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 4215 transitions. [2019-11-24 06:05:48,040 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 4215 transitions. Word has length 96 [2019-11-24 06:05:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:48,040 INFO L462 AbstractCegarLoop]: Abstraction has 3727 states and 4215 transitions. [2019-11-24 06:05:48,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 4215 transitions. [2019-11-24 06:05:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-24 06:05:48,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:48,042 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:48,043 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2122216595, now seen corresponding path program 1 times [2019-11-24 06:05:48,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:48,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757445301] [2019-11-24 06:05:48,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:48,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757445301] [2019-11-24 06:05:48,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:48,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:05:48,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788754037] [2019-11-24 06:05:48,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:48,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:48,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:48,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:48,198 INFO L87 Difference]: Start difference. First operand 3727 states and 4215 transitions. Second operand 6 states. [2019-11-24 06:05:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:48,815 INFO L93 Difference]: Finished difference Result 12750 states and 14454 transitions. [2019-11-24 06:05:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 06:05:48,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-11-24 06:05:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:48,823 INFO L225 Difference]: With dead ends: 12750 [2019-11-24 06:05:48,823 INFO L226 Difference]: Without dead ends: 10890 [2019-11-24 06:05:48,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-11-24 06:05:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 6229. [2019-11-24 06:05:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6229 states. [2019-11-24 06:05:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 7061 transitions. [2019-11-24 06:05:49,127 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 7061 transitions. Word has length 118 [2019-11-24 06:05:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:49,127 INFO L462 AbstractCegarLoop]: Abstraction has 6229 states and 7061 transitions. [2019-11-24 06:05:49,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 7061 transitions. [2019-11-24 06:05:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-24 06:05:49,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:49,131 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:49,131 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:49,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1409494772, now seen corresponding path program 1 times [2019-11-24 06:05:49,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:49,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219169449] [2019-11-24 06:05:49,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 06:05:49,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219169449] [2019-11-24 06:05:49,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:49,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:49,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353627022] [2019-11-24 06:05:49,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:49,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:49,182 INFO L87 Difference]: Start difference. First operand 6229 states and 7061 transitions. Second operand 4 states. [2019-11-24 06:05:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:50,120 INFO L93 Difference]: Finished difference Result 14386 states and 16439 transitions. [2019-11-24 06:05:50,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:50,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-24 06:05:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:50,129 INFO L225 Difference]: With dead ends: 14386 [2019-11-24 06:05:50,129 INFO L226 Difference]: Without dead ends: 8319 [2019-11-24 06:05:50,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8319 states. [2019-11-24 06:05:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8319 to 6457. [2019-11-24 06:05:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6457 states. [2019-11-24 06:05:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6457 states to 6457 states and 7371 transitions. [2019-11-24 06:05:50,781 INFO L78 Accepts]: Start accepts. Automaton has 6457 states and 7371 transitions. Word has length 123 [2019-11-24 06:05:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:50,782 INFO L462 AbstractCegarLoop]: Abstraction has 6457 states and 7371 transitions. [2019-11-24 06:05:50,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6457 states and 7371 transitions. [2019-11-24 06:05:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-24 06:05:50,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:50,789 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:50,789 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 147299194, now seen corresponding path program 1 times [2019-11-24 06:05:50,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:50,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899292965] [2019-11-24 06:05:50,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 06:05:50,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899292965] [2019-11-24 06:05:50,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:50,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:50,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955561076] [2019-11-24 06:05:50,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:50,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:50,879 INFO L87 Difference]: Start difference. First operand 6457 states and 7371 transitions. Second operand 5 states. [2019-11-24 06:05:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:51,117 INFO L93 Difference]: Finished difference Result 7960 states and 9081 transitions. [2019-11-24 06:05:51,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:51,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-11-24 06:05:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:51,118 INFO L225 Difference]: With dead ends: 7960 [2019-11-24 06:05:51,118 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 06:05:51,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 06:05:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 06:05:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 06:05:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 06:05:51,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2019-11-24 06:05:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:51,122 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 06:05:51,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 06:05:51,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 06:05:51,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 06:05:52,492 WARN L192 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 436 DAG size of output: 334 [2019-11-24 06:05:52,665 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 100 [2019-11-24 06:05:52,846 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 179 [2019-11-24 06:05:53,116 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 178 [2019-11-24 06:05:53,613 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 397 DAG size of output: 334 [2019-11-24 06:05:54,187 WARN L192 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 505 DAG size of output: 434 [2019-11-24 06:05:55,619 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 832 DAG size of output: 696 [2019-11-24 06:05:58,392 WARN L192 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 1156 DAG size of output: 932 [2019-11-24 06:05:58,709 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 251 [2019-11-24 06:05:59,154 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 512 DAG size of output: 396 [2019-11-24 06:05:59,756 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 497 DAG size of output: 407 [2019-11-24 06:06:02,103 WARN L192 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 1123 DAG size of output: 977 [2019-11-24 06:06:02,364 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 231 [2019-11-24 06:06:04,475 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 1080 DAG size of output: 934 [2019-11-24 06:06:05,133 WARN L192 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 375 [2019-11-24 06:06:05,472 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 189 [2019-11-24 06:06:05,706 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 237 [2019-11-24 06:06:06,207 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 310 [2019-11-24 06:06:06,563 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 255 [2019-11-24 06:06:09,970 WARN L192 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 305 DAG size of output: 95 [2019-11-24 06:06:11,151 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-11-24 06:06:12,401 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-11-24 06:06:13,604 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 178 DAG size of output: 84 [2019-11-24 06:06:15,111 WARN L192 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-11-24 06:06:16,885 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 304 DAG size of output: 76 [2019-11-24 06:06:21,675 WARN L192 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 404 DAG size of output: 108 [2019-11-24 06:06:34,527 WARN L192 SmtUtils]: Spent 12.84 s on a formula simplification. DAG size of input: 665 DAG size of output: 166 [2019-11-24 06:06:34,976 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-11-24 06:06:50,070 WARN L192 SmtUtils]: Spent 15.09 s on a formula simplification. DAG size of input: 825 DAG size of output: 152 [2019-11-24 06:06:50,628 WARN L192 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 60 [2019-11-24 06:06:53,049 WARN L192 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 229 DAG size of output: 93 [2019-11-24 06:06:53,644 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 57