/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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:46:28,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:46:28,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:46:28,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:46:28,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:46:28,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:46:28,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:46:28,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:46:28,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:46:28,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:46:28,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:46:28,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:46:28,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:46:28,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:46:28,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:46:28,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:46:28,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:46:28,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:46:28,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:46:28,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:46:28,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:46:28,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:46:28,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:46:28,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:46:28,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:46:28,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:46:28,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:46:28,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:46:28,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:46:28,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:46:28,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:46:28,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:46:28,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:46:28,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:46:28,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:46:28,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:46:28,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:46:28,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:46:28,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:46:28,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:46:28,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:46:28,647 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 05:46:28,666 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:46:28,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:46:28,667 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:46:28,667 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:46:28,668 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:46:28,668 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:46:28,668 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:46:28,669 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:46:28,669 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:46:28,669 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:46:28,670 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:46:28,670 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:46:28,671 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:46:28,671 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:46:28,671 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:46:28,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:46:28,673 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:46:28,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:46:28,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:46:28,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:46:28,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:46:28,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:46:28,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:46:28,674 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:46:28,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:46:28,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:46:28,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:46:28,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:46:28,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:46:28,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:46:28,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:46:28,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:46:28,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:46:28,677 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:46:28,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:46:28,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:46:28,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:46:28,678 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:46:29,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:46:29,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:46:29,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:46:29,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:46:29,025 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:46:29,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-24 05:46:29,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253724a3e/1d66af6689004abeb2472fc9145d343e/FLAGb7c3344d9 [2019-11-24 05:46:29,817 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:46:29,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-24 05:46:29,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253724a3e/1d66af6689004abeb2472fc9145d343e/FLAGb7c3344d9 [2019-11-24 05:46:29,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253724a3e/1d66af6689004abeb2472fc9145d343e [2019-11-24 05:46:29,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:46:29,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:46:29,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:29,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:46:29,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:46:29,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9ebbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29, skipping insertion in model container [2019-11-24 05:46:29,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:30,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:46:30,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:46:31,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:31,176 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:46:31,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:31,571 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:46:31,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31 WrapperNode [2019-11-24 05:46:31,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:31,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:31,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:46:31,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:46:31,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:31,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:46:31,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:46:31,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:46:31,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (1/1) ... [2019-11-24 05:46:31,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:46:31,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:46:31,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:46:31,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:46:31,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (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 05:46:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:46:31,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:46:35,977 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:46:35,977 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:46:35,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:35 BoogieIcfgContainer [2019-11-24 05:46:35,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:46:35,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:46:35,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:46:35,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:46:35,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:46:29" (1/3) ... [2019-11-24 05:46:35,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1c7cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:35, skipping insertion in model container [2019-11-24 05:46:35,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:31" (2/3) ... [2019-11-24 05:46:35,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1c7cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:35, skipping insertion in model container [2019-11-24 05:46:35,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:35" (3/3) ... [2019-11-24 05:46:35,990 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-24 05:46:36,000 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:46:36,008 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:46:36,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:46:36,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:46:36,061 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:46:36,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:46:36,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:46:36,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:46:36,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:46:36,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:46:36,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:46:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states. [2019-11-24 05:46:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:46:36,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:36,130 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, 1, 1, 1, 1, 1, 1, 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 05:46:36,130 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash 440971975, now seen corresponding path program 1 times [2019-11-24 05:46:36,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:36,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531203912] [2019-11-24 05:46:36,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:36,624 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 05:46:36,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531203912] [2019-11-24 05:46:36,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:36,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:36,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324368183] [2019-11-24 05:46:36,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:36,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:36,652 INFO L87 Difference]: Start difference. First operand 1134 states. Second operand 5 states. [2019-11-24 05:46:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:38,342 INFO L93 Difference]: Finished difference Result 2051 states and 3535 transitions. [2019-11-24 05:46:38,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:38,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:46:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:38,370 INFO L225 Difference]: With dead ends: 2051 [2019-11-24 05:46:38,371 INFO L226 Difference]: Without dead ends: 1335 [2019-11-24 05:46:38,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-11-24 05:46:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1321. [2019-11-24 05:46:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-11-24 05:46:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1661 transitions. [2019-11-24 05:46:38,616 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1661 transitions. Word has length 51 [2019-11-24 05:46:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:38,617 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 1661 transitions. [2019-11-24 05:46:38,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1661 transitions. [2019-11-24 05:46:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:46:38,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:38,623 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, 1, 1, 1, 1, 1, 1, 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 05:46:38,623 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash -230979491, now seen corresponding path program 1 times [2019-11-24 05:46:38,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:38,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955590121] [2019-11-24 05:46:38,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:38,787 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 05:46:38,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955590121] [2019-11-24 05:46:38,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:38,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:38,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962877776] [2019-11-24 05:46:38,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:38,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:38,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:38,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:38,795 INFO L87 Difference]: Start difference. First operand 1321 states and 1661 transitions. Second operand 5 states. [2019-11-24 05:46:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:39,969 INFO L93 Difference]: Finished difference Result 2410 states and 3059 transitions. [2019-11-24 05:46:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:39,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:46:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:39,978 INFO L225 Difference]: With dead ends: 2410 [2019-11-24 05:46:39,978 INFO L226 Difference]: Without dead ends: 1629 [2019-11-24 05:46:39,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-11-24 05:46:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1619. [2019-11-24 05:46:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1619 states. [2019-11-24 05:46:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2043 transitions. [2019-11-24 05:46:40,061 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2043 transitions. Word has length 51 [2019-11-24 05:46:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:40,061 INFO L462 AbstractCegarLoop]: Abstraction has 1619 states and 2043 transitions. [2019-11-24 05:46:40,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2043 transitions. [2019-11-24 05:46:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:46:40,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:40,129 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, 1, 1, 1, 1, 1, 1, 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 05:46:40,129 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:40,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:40,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1941934323, now seen corresponding path program 1 times [2019-11-24 05:46:40,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:40,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773336694] [2019-11-24 05:46:40,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:40,251 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 05:46:40,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773336694] [2019-11-24 05:46:40,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:40,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:40,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016401669] [2019-11-24 05:46:40,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:40,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:40,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:40,254 INFO L87 Difference]: Start difference. First operand 1619 states and 2043 transitions. Second operand 5 states. [2019-11-24 05:46:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:41,312 INFO L93 Difference]: Finished difference Result 3140 states and 3984 transitions. [2019-11-24 05:46:41,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:41,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:46:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:41,325 INFO L225 Difference]: With dead ends: 3140 [2019-11-24 05:46:41,325 INFO L226 Difference]: Without dead ends: 2338 [2019-11-24 05:46:41,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-11-24 05:46:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2332. [2019-11-24 05:46:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-11-24 05:46:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 2912 transitions. [2019-11-24 05:46:41,443 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 2912 transitions. Word has length 51 [2019-11-24 05:46:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:41,443 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 2912 transitions. [2019-11-24 05:46:41,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2912 transitions. [2019-11-24 05:46:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:46:41,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:41,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:41,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash -274476207, now seen corresponding path program 1 times [2019-11-24 05:46:41,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:41,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711690933] [2019-11-24 05:46:41,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:41,619 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 05:46:41,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711690933] [2019-11-24 05:46:41,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:41,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:46:41,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035166258] [2019-11-24 05:46:41,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:46:41,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:41,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:46:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:46:41,623 INFO L87 Difference]: Start difference. First operand 2332 states and 2912 transitions. Second operand 8 states. [2019-11-24 05:46:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:44,061 INFO L93 Difference]: Finished difference Result 4239 states and 5441 transitions. [2019-11-24 05:46:44,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:46:44,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-24 05:46:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:44,082 INFO L225 Difference]: With dead ends: 4239 [2019-11-24 05:46:44,083 INFO L226 Difference]: Without dead ends: 3875 [2019-11-24 05:46:44,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:46:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-11-24 05:46:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 2332. [2019-11-24 05:46:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-11-24 05:46:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 2911 transitions. [2019-11-24 05:46:44,248 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 2911 transitions. Word has length 53 [2019-11-24 05:46:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:44,248 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 2911 transitions. [2019-11-24 05:46:44,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:46:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2911 transitions. [2019-11-24 05:46:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:46:44,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:44,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:44,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -603870735, now seen corresponding path program 1 times [2019-11-24 05:46:44,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:44,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059893922] [2019-11-24 05:46:44,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:44,430 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 05:46:44,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059893922] [2019-11-24 05:46:44,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:44,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:46:44,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797353255] [2019-11-24 05:46:44,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:46:44,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:46:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:46:44,433 INFO L87 Difference]: Start difference. First operand 2332 states and 2911 transitions. Second operand 8 states. [2019-11-24 05:46:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:46,868 INFO L93 Difference]: Finished difference Result 3547 states and 4493 transitions. [2019-11-24 05:46:46,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:46:46,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-24 05:46:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:46,889 INFO L225 Difference]: With dead ends: 3547 [2019-11-24 05:46:46,889 INFO L226 Difference]: Without dead ends: 3541 [2019-11-24 05:46:46,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-11-24 05:46:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2019-11-24 05:46:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2332. [2019-11-24 05:46:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-11-24 05:46:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 2910 transitions. [2019-11-24 05:46:47,044 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 2910 transitions. Word has length 53 [2019-11-24 05:46:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:47,047 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 2910 transitions. [2019-11-24 05:46:47,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:46:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2910 transitions. [2019-11-24 05:46:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:46:47,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:47,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:47,053 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1273862225, now seen corresponding path program 1 times [2019-11-24 05:46:47,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:47,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334827807] [2019-11-24 05:46:47,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:47,212 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 05:46:47,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334827807] [2019-11-24 05:46:47,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:47,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:46:47,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850654042] [2019-11-24 05:46:47,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:46:47,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:47,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:46:47,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:47,307 INFO L87 Difference]: Start difference. First operand 2332 states and 2910 transitions. Second operand 7 states. [2019-11-24 05:46:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:48,952 INFO L93 Difference]: Finished difference Result 3887 states and 4977 transitions. [2019-11-24 05:46:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:46:48,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-24 05:46:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:48,970 INFO L225 Difference]: With dead ends: 3887 [2019-11-24 05:46:48,970 INFO L226 Difference]: Without dead ends: 3379 [2019-11-24 05:46:48,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:46:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2019-11-24 05:46:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2332. [2019-11-24 05:46:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-11-24 05:46:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 2909 transitions. [2019-11-24 05:46:49,134 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 2909 transitions. Word has length 53 [2019-11-24 05:46:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:49,134 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 2909 transitions. [2019-11-24 05:46:49,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:46:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2909 transitions. [2019-11-24 05:46:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:46:49,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:49,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:49,141 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash -843774436, now seen corresponding path program 1 times [2019-11-24 05:46:49,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:49,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356568041] [2019-11-24 05:46:49,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:49,225 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 05:46:49,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356568041] [2019-11-24 05:46:49,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:49,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:49,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188371611] [2019-11-24 05:46:49,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:49,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:49,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:49,227 INFO L87 Difference]: Start difference. First operand 2332 states and 2909 transitions. Second operand 3 states. [2019-11-24 05:46:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:49,529 INFO L93 Difference]: Finished difference Result 3200 states and 4082 transitions. [2019-11-24 05:46:49,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:49,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:46:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:49,538 INFO L225 Difference]: With dead ends: 3200 [2019-11-24 05:46:49,538 INFO L226 Difference]: Without dead ends: 2033 [2019-11-24 05:46:49,540 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 05:46:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-11-24 05:46:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2031. [2019-11-24 05:46:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2019-11-24 05:46:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2495 transitions. [2019-11-24 05:46:49,685 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2495 transitions. Word has length 54 [2019-11-24 05:46:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:49,686 INFO L462 AbstractCegarLoop]: Abstraction has 2031 states and 2495 transitions. [2019-11-24 05:46:49,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2495 transitions. [2019-11-24 05:46:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:46:49,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:49,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:49,690 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:49,690 INFO L82 PathProgramCache]: Analyzing trace with hash 586810076, now seen corresponding path program 1 times [2019-11-24 05:46:49,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:49,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248955805] [2019-11-24 05:46:49,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:49,779 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 05:46:49,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248955805] [2019-11-24 05:46:49,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:49,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:49,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828752899] [2019-11-24 05:46:49,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:49,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:49,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:49,782 INFO L87 Difference]: Start difference. First operand 2031 states and 2495 transitions. Second operand 3 states. [2019-11-24 05:46:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:49,981 INFO L93 Difference]: Finished difference Result 3121 states and 4006 transitions. [2019-11-24 05:46:49,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:49,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:46:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:49,990 INFO L225 Difference]: With dead ends: 3121 [2019-11-24 05:46:49,990 INFO L226 Difference]: Without dead ends: 2316 [2019-11-24 05:46:49,993 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 05:46:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2019-11-24 05:46:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2314. [2019-11-24 05:46:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2019-11-24 05:46:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 2910 transitions. [2019-11-24 05:46:50,151 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 2910 transitions. Word has length 54 [2019-11-24 05:46:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:50,152 INFO L462 AbstractCegarLoop]: Abstraction has 2314 states and 2910 transitions. [2019-11-24 05:46:50,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 2910 transitions. [2019-11-24 05:46:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:46:50,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:50,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:50,154 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -117726025, now seen corresponding path program 1 times [2019-11-24 05:46:50,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:50,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001453060] [2019-11-24 05:46:50,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:50,199 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 05:46:50,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001453060] [2019-11-24 05:46:50,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:50,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:50,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730781690] [2019-11-24 05:46:50,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:50,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:50,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:50,202 INFO L87 Difference]: Start difference. First operand 2314 states and 2910 transitions. Second operand 3 states. [2019-11-24 05:46:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:50,599 INFO L93 Difference]: Finished difference Result 4188 states and 5469 transitions. [2019-11-24 05:46:50,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:50,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:46:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:50,610 INFO L225 Difference]: With dead ends: 4188 [2019-11-24 05:46:50,610 INFO L226 Difference]: Without dead ends: 2957 [2019-11-24 05:46:50,612 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 05:46:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2019-11-24 05:46:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2955. [2019-11-24 05:46:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2019-11-24 05:46:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3765 transitions. [2019-11-24 05:46:50,825 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3765 transitions. Word has length 54 [2019-11-24 05:46:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:50,825 INFO L462 AbstractCegarLoop]: Abstraction has 2955 states and 3765 transitions. [2019-11-24 05:46:50,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3765 transitions. [2019-11-24 05:46:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:46:50,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:50,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:50,828 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:50,829 INFO L82 PathProgramCache]: Analyzing trace with hash -812769836, now seen corresponding path program 1 times [2019-11-24 05:46:50,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:50,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716181560] [2019-11-24 05:46:50,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:50,877 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 05:46:50,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716181560] [2019-11-24 05:46:50,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:50,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:50,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023773287] [2019-11-24 05:46:50,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:50,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:50,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:50,879 INFO L87 Difference]: Start difference. First operand 2955 states and 3765 transitions. Second operand 3 states. [2019-11-24 05:46:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:51,293 INFO L93 Difference]: Finished difference Result 5610 states and 7233 transitions. [2019-11-24 05:46:51,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:51,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-24 05:46:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:51,307 INFO L225 Difference]: With dead ends: 5610 [2019-11-24 05:46:51,307 INFO L226 Difference]: Without dead ends: 3205 [2019-11-24 05:46:51,310 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 05:46:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2019-11-24 05:46:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 2576. [2019-11-24 05:46:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-11-24 05:46:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3302 transitions. [2019-11-24 05:46:51,605 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3302 transitions. Word has length 55 [2019-11-24 05:46:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:51,605 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 3302 transitions. [2019-11-24 05:46:51,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3302 transitions. [2019-11-24 05:46:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:46:51,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:51,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:51,608 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 930333266, now seen corresponding path program 1 times [2019-11-24 05:46:51,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:51,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111780780] [2019-11-24 05:46:51,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:51,958 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 05:46:51,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111780780] [2019-11-24 05:46:51,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:51,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:46:51,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779901699] [2019-11-24 05:46:51,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:46:51,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:51,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:46:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:46:51,961 INFO L87 Difference]: Start difference. First operand 2576 states and 3302 transitions. Second operand 12 states. [2019-11-24 05:46:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:54,028 INFO L93 Difference]: Finished difference Result 4773 states and 6135 transitions. [2019-11-24 05:46:54,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:46:54,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-24 05:46:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:54,042 INFO L225 Difference]: With dead ends: 4773 [2019-11-24 05:46:54,042 INFO L226 Difference]: Without dead ends: 4518 [2019-11-24 05:46:54,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-24 05:46:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2019-11-24 05:46:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 2563. [2019-11-24 05:46:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-11-24 05:46:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3287 transitions. [2019-11-24 05:46:54,350 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3287 transitions. Word has length 55 [2019-11-24 05:46:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:54,350 INFO L462 AbstractCegarLoop]: Abstraction has 2563 states and 3287 transitions. [2019-11-24 05:46:54,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:46:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3287 transitions. [2019-11-24 05:46:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:46:54,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:54,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:54,352 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1102645022, now seen corresponding path program 1 times [2019-11-24 05:46:54,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:54,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534736357] [2019-11-24 05:46:54,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:54,384 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 05:46:54,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534736357] [2019-11-24 05:46:54,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:54,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:54,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710949078] [2019-11-24 05:46:54,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:54,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:54,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:54,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:54,386 INFO L87 Difference]: Start difference. First operand 2563 states and 3287 transitions. Second operand 3 states. [2019-11-24 05:46:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:54,709 INFO L93 Difference]: Finished difference Result 4729 states and 6145 transitions. [2019-11-24 05:46:54,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:54,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-24 05:46:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:54,715 INFO L225 Difference]: With dead ends: 4729 [2019-11-24 05:46:54,715 INFO L226 Difference]: Without dead ends: 2592 [2019-11-24 05:46:54,721 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 05:46:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2019-11-24 05:46:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2265. [2019-11-24 05:46:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2265 states. [2019-11-24 05:46:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2911 transitions. [2019-11-24 05:46:55,122 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2911 transitions. Word has length 55 [2019-11-24 05:46:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:55,122 INFO L462 AbstractCegarLoop]: Abstraction has 2265 states and 2911 transitions. [2019-11-24 05:46:55,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2911 transitions. [2019-11-24 05:46:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:46:55,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:55,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:55,124 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:55,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash -14136437, now seen corresponding path program 1 times [2019-11-24 05:46:55,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:55,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458624971] [2019-11-24 05:46:55,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:55,258 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 05:46:55,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458624971] [2019-11-24 05:46:55,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:55,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:46:55,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145825248] [2019-11-24 05:46:55,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:55,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:55,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:55,260 INFO L87 Difference]: Start difference. First operand 2265 states and 2911 transitions. Second operand 5 states. [2019-11-24 05:46:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:55,647 INFO L93 Difference]: Finished difference Result 3807 states and 4962 transitions. [2019-11-24 05:46:55,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:55,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-24 05:46:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:55,651 INFO L225 Difference]: With dead ends: 3807 [2019-11-24 05:46:55,651 INFO L226 Difference]: Without dead ends: 2042 [2019-11-24 05:46:55,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2019-11-24 05:46:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1684. [2019-11-24 05:46:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2019-11-24 05:46:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2126 transitions. [2019-11-24 05:46:55,910 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2126 transitions. Word has length 56 [2019-11-24 05:46:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:55,910 INFO L462 AbstractCegarLoop]: Abstraction has 1684 states and 2126 transitions. [2019-11-24 05:46:55,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2126 transitions. [2019-11-24 05:46:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:46:55,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:55,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:55,911 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash -375785998, now seen corresponding path program 1 times [2019-11-24 05:46:55,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:55,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628417933] [2019-11-24 05:46:55,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:56,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628417933] [2019-11-24 05:46:56,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:56,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:46:56,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742038965] [2019-11-24 05:46:56,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 05:46:56,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 05:46:56,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:46:56,367 INFO L87 Difference]: Start difference. First operand 1684 states and 2126 transitions. Second operand 13 states. [2019-11-24 05:46:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:59,163 INFO L93 Difference]: Finished difference Result 4552 states and 5742 transitions. [2019-11-24 05:46:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-24 05:46:59,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-11-24 05:46:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:59,172 INFO L225 Difference]: With dead ends: 4552 [2019-11-24 05:46:59,172 INFO L226 Difference]: Without dead ends: 4548 [2019-11-24 05:46:59,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-11-24 05:46:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2019-11-24 05:46:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 1680. [2019-11-24 05:46:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2019-11-24 05:46:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2122 transitions. [2019-11-24 05:46:59,487 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2122 transitions. Word has length 56 [2019-11-24 05:46:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:59,488 INFO L462 AbstractCegarLoop]: Abstraction has 1680 states and 2122 transitions. [2019-11-24 05:46:59,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 05:46:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2122 transitions. [2019-11-24 05:46:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:46:59,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:59,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:59,489 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1266882465, now seen corresponding path program 1 times [2019-11-24 05:46:59,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:59,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219701310] [2019-11-24 05:46:59,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:59,853 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 05:46:59,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219701310] [2019-11-24 05:46:59,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:59,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:46:59,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548555730] [2019-11-24 05:46:59,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 05:46:59,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:59,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 05:46:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:46:59,855 INFO L87 Difference]: Start difference. First operand 1680 states and 2122 transitions. Second operand 13 states. [2019-11-24 05:47:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:02,599 INFO L93 Difference]: Finished difference Result 4233 states and 5341 transitions. [2019-11-24 05:47:02,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-24 05:47:02,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-11-24 05:47:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:02,607 INFO L225 Difference]: With dead ends: 4233 [2019-11-24 05:47:02,607 INFO L226 Difference]: Without dead ends: 4229 [2019-11-24 05:47:02,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-11-24 05:47:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4229 states. [2019-11-24 05:47:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4229 to 1676. [2019-11-24 05:47:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2019-11-24 05:47:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2118 transitions. [2019-11-24 05:47:02,919 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2118 transitions. Word has length 56 [2019-11-24 05:47:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:02,919 INFO L462 AbstractCegarLoop]: Abstraction has 1676 states and 2118 transitions. [2019-11-24 05:47:02,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 05:47:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2118 transitions. [2019-11-24 05:47:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 05:47:02,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:02,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:02,920 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:02,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2089962212, now seen corresponding path program 1 times [2019-11-24 05:47:02,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:02,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257981335] [2019-11-24 05:47:02,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:03,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257981335] [2019-11-24 05:47:03,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:03,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:47:03,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011816917] [2019-11-24 05:47:03,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:47:03,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:03,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:47:03,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:47:03,091 INFO L87 Difference]: Start difference. First operand 1676 states and 2118 transitions. Second operand 12 states. [2019-11-24 05:47:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:05,345 INFO L93 Difference]: Finished difference Result 5836 states and 7486 transitions. [2019-11-24 05:47:05,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 05:47:05,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-11-24 05:47:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:05,352 INFO L225 Difference]: With dead ends: 5836 [2019-11-24 05:47:05,353 INFO L226 Difference]: Without dead ends: 4699 [2019-11-24 05:47:05,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2019-11-24 05:47:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2019-11-24 05:47:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 2390. [2019-11-24 05:47:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-11-24 05:47:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3007 transitions. [2019-11-24 05:47:05,815 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3007 transitions. Word has length 60 [2019-11-24 05:47:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:05,815 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 3007 transitions. [2019-11-24 05:47:05,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:47:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3007 transitions. [2019-11-24 05:47:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 05:47:05,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:05,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:05,817 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:05,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1193342281, now seen corresponding path program 1 times [2019-11-24 05:47:05,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:05,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717628314] [2019-11-24 05:47:05,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:06,011 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 05:47:06,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717628314] [2019-11-24 05:47:06,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:06,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:47:06,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060675617] [2019-11-24 05:47:06,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:47:06,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:06,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:47:06,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:47:06,013 INFO L87 Difference]: Start difference. First operand 2390 states and 3007 transitions. Second operand 12 states. [2019-11-24 05:47:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:08,451 INFO L93 Difference]: Finished difference Result 6042 states and 7694 transitions. [2019-11-24 05:47:08,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-24 05:47:08,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-11-24 05:47:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:08,455 INFO L225 Difference]: With dead ends: 6042 [2019-11-24 05:47:08,455 INFO L226 Difference]: Without dead ends: 4400 [2019-11-24 05:47:08,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2019-11-24 05:47:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2019-11-24 05:47:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 3181. [2019-11-24 05:47:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-11-24 05:47:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 3988 transitions. [2019-11-24 05:47:08,997 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 3988 transitions. Word has length 61 [2019-11-24 05:47:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:08,997 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 3988 transitions. [2019-11-24 05:47:08,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:47:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 3988 transitions. [2019-11-24 05:47:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 05:47:08,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:08,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:08,999 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash -588158690, now seen corresponding path program 1 times [2019-11-24 05:47:08,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:08,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139868075] [2019-11-24 05:47:09,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:09,084 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 05:47:09,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139868075] [2019-11-24 05:47:09,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:09,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:09,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883458170] [2019-11-24 05:47:09,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:09,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:09,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:09,091 INFO L87 Difference]: Start difference. First operand 3181 states and 3988 transitions. Second operand 8 states. [2019-11-24 05:47:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:11,907 INFO L93 Difference]: Finished difference Result 8930 states and 11229 transitions. [2019-11-24 05:47:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-24 05:47:11,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-11-24 05:47:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:11,915 INFO L225 Difference]: With dead ends: 8930 [2019-11-24 05:47:11,916 INFO L226 Difference]: Without dead ends: 7633 [2019-11-24 05:47:11,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-11-24 05:47:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states. [2019-11-24 05:47:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 3168. [2019-11-24 05:47:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2019-11-24 05:47:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 3974 transitions. [2019-11-24 05:47:12,511 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 3974 transitions. Word has length 62 [2019-11-24 05:47:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:12,511 INFO L462 AbstractCegarLoop]: Abstraction has 3168 states and 3974 transitions. [2019-11-24 05:47:12,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 3974 transitions. [2019-11-24 05:47:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 05:47:12,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:12,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:12,513 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1638652142, now seen corresponding path program 1 times [2019-11-24 05:47:12,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:12,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853321514] [2019-11-24 05:47:12,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:12,728 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 05:47:12,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853321514] [2019-11-24 05:47:12,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:12,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 05:47:12,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356202923] [2019-11-24 05:47:12,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 05:47:12,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 05:47:12,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:47:12,733 INFO L87 Difference]: Start difference. First operand 3168 states and 3974 transitions. Second operand 13 states. [2019-11-24 05:47:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:15,990 INFO L93 Difference]: Finished difference Result 7739 states and 9835 transitions. [2019-11-24 05:47:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 05:47:15,990 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-11-24 05:47:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:15,995 INFO L225 Difference]: With dead ends: 7739 [2019-11-24 05:47:15,995 INFO L226 Difference]: Without dead ends: 6605 [2019-11-24 05:47:15,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2019-11-24 05:47:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6605 states. [2019-11-24 05:47:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6605 to 3933. [2019-11-24 05:47:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2019-11-24 05:47:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 4928 transitions. [2019-11-24 05:47:16,753 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 4928 transitions. Word has length 63 [2019-11-24 05:47:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:16,754 INFO L462 AbstractCegarLoop]: Abstraction has 3933 states and 4928 transitions. [2019-11-24 05:47:16,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 05:47:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 4928 transitions. [2019-11-24 05:47:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 05:47:16,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:16,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:16,756 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash -822878625, now seen corresponding path program 1 times [2019-11-24 05:47:16,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:16,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822968784] [2019-11-24 05:47:16,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:16,971 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 05:47:16,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822968784] [2019-11-24 05:47:16,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:16,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 05:47:16,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477438124] [2019-11-24 05:47:16,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 05:47:16,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 05:47:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:47:16,973 INFO L87 Difference]: Start difference. First operand 3933 states and 4928 transitions. Second operand 13 states. [2019-11-24 05:47:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:20,213 INFO L93 Difference]: Finished difference Result 7613 states and 9618 transitions. [2019-11-24 05:47:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-24 05:47:20,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-11-24 05:47:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:20,218 INFO L225 Difference]: With dead ends: 7613 [2019-11-24 05:47:20,218 INFO L226 Difference]: Without dead ends: 6419 [2019-11-24 05:47:20,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2019-11-24 05:47:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2019-11-24 05:47:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 5325. [2019-11-24 05:47:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5325 states. [2019-11-24 05:47:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 6645 transitions. [2019-11-24 05:47:21,287 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 6645 transitions. Word has length 67 [2019-11-24 05:47:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:21,287 INFO L462 AbstractCegarLoop]: Abstraction has 5325 states and 6645 transitions. [2019-11-24 05:47:21,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 05:47:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 6645 transitions. [2019-11-24 05:47:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 05:47:21,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:21,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:21,289 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1899963189, now seen corresponding path program 1 times [2019-11-24 05:47:21,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:21,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938633980] [2019-11-24 05:47:21,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:21,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938633980] [2019-11-24 05:47:21,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:21,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:21,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633936675] [2019-11-24 05:47:21,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:21,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:21,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:21,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:21,376 INFO L87 Difference]: Start difference. First operand 5325 states and 6645 transitions. Second operand 8 states. [2019-11-24 05:47:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:24,593 INFO L93 Difference]: Finished difference Result 9879 states and 12314 transitions. [2019-11-24 05:47:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:47:24,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-24 05:47:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:24,600 INFO L225 Difference]: With dead ends: 9879 [2019-11-24 05:47:24,600 INFO L226 Difference]: Without dead ends: 9389 [2019-11-24 05:47:24,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:47:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9389 states. [2019-11-24 05:47:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9389 to 5309. [2019-11-24 05:47:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5309 states. [2019-11-24 05:47:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 6627 transitions. [2019-11-24 05:47:25,800 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 6627 transitions. Word has length 67 [2019-11-24 05:47:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:25,801 INFO L462 AbstractCegarLoop]: Abstraction has 5309 states and 6627 transitions. [2019-11-24 05:47:25,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 6627 transitions. [2019-11-24 05:47:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:47:25,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:25,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:25,803 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1573760683, now seen corresponding path program 1 times [2019-11-24 05:47:25,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:25,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066221008] [2019-11-24 05:47:25,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:26,142 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 05:47:26,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066221008] [2019-11-24 05:47:26,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:26,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 05:47:26,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924993482] [2019-11-24 05:47:26,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 05:47:26,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:26,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 05:47:26,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:47:26,145 INFO L87 Difference]: Start difference. First operand 5309 states and 6627 transitions. Second operand 13 states. [2019-11-24 05:47:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:29,787 INFO L93 Difference]: Finished difference Result 9216 states and 11656 transitions. [2019-11-24 05:47:29,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 05:47:29,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-11-24 05:47:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:29,794 INFO L225 Difference]: With dead ends: 9216 [2019-11-24 05:47:29,794 INFO L226 Difference]: Without dead ends: 7667 [2019-11-24 05:47:29,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2019-11-24 05:47:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7667 states. [2019-11-24 05:47:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7667 to 6396. [2019-11-24 05:47:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6396 states. [2019-11-24 05:47:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6396 states to 6396 states and 8004 transitions. [2019-11-24 05:47:31,223 INFO L78 Accepts]: Start accepts. Automaton has 6396 states and 8004 transitions. Word has length 68 [2019-11-24 05:47:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:31,223 INFO L462 AbstractCegarLoop]: Abstraction has 6396 states and 8004 transitions. [2019-11-24 05:47:31,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 05:47:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6396 states and 8004 transitions. [2019-11-24 05:47:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:47:31,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:31,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:31,225 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1854437398, now seen corresponding path program 1 times [2019-11-24 05:47:31,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:31,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649170396] [2019-11-24 05:47:31,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:31,341 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 05:47:31,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649170396] [2019-11-24 05:47:31,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:31,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:31,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342880275] [2019-11-24 05:47:31,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:31,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:31,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:31,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:31,351 INFO L87 Difference]: Start difference. First operand 6396 states and 8004 transitions. Second operand 8 states. [2019-11-24 05:47:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:35,183 INFO L93 Difference]: Finished difference Result 11659 states and 14478 transitions. [2019-11-24 05:47:35,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-24 05:47:35,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-11-24 05:47:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:35,193 INFO L225 Difference]: With dead ends: 11659 [2019-11-24 05:47:35,193 INFO L226 Difference]: Without dead ends: 11107 [2019-11-24 05:47:35,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-11-24 05:47:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11107 states. [2019-11-24 05:47:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11107 to 6396. [2019-11-24 05:47:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6396 states. [2019-11-24 05:47:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6396 states to 6396 states and 8003 transitions. [2019-11-24 05:47:36,670 INFO L78 Accepts]: Start accepts. Automaton has 6396 states and 8003 transitions. Word has length 68 [2019-11-24 05:47:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:36,670 INFO L462 AbstractCegarLoop]: Abstraction has 6396 states and 8003 transitions. [2019-11-24 05:47:36,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 6396 states and 8003 transitions. [2019-11-24 05:47:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:47:36,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:36,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:36,672 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1877865197, now seen corresponding path program 1 times [2019-11-24 05:47:36,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:36,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341519074] [2019-11-24 05:47:36,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:37,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341519074] [2019-11-24 05:47:37,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:37,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-24 05:47:37,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217327897] [2019-11-24 05:47:37,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-24 05:47:37,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-24 05:47:37,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-24 05:47:37,039 INFO L87 Difference]: Start difference. First operand 6396 states and 8003 transitions. Second operand 16 states. [2019-11-24 05:47:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:42,004 INFO L93 Difference]: Finished difference Result 7808 states and 9767 transitions. [2019-11-24 05:47:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-24 05:47:42,005 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-11-24 05:47:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:42,065 INFO L225 Difference]: With dead ends: 7808 [2019-11-24 05:47:42,065 INFO L226 Difference]: Without dead ends: 7686 [2019-11-24 05:47:42,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=395, Invalid=1087, Unknown=0, NotChecked=0, Total=1482 [2019-11-24 05:47:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7686 states. [2019-11-24 05:47:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7686 to 6562. [2019-11-24 05:47:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6562 states. [2019-11-24 05:47:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 8209 transitions. [2019-11-24 05:47:43,553 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 8209 transitions. Word has length 68 [2019-11-24 05:47:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:43,554 INFO L462 AbstractCegarLoop]: Abstraction has 6562 states and 8209 transitions. [2019-11-24 05:47:43,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-24 05:47:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 8209 transitions. [2019-11-24 05:47:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 05:47:43,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:43,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:43,556 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1448575995, now seen corresponding path program 1 times [2019-11-24 05:47:43,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:43,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058043179] [2019-11-24 05:47:43,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:43,607 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 05:47:43,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058043179] [2019-11-24 05:47:43,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:43,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:43,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058532675] [2019-11-24 05:47:43,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:43,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:43,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:43,609 INFO L87 Difference]: Start difference. First operand 6562 states and 8209 transitions. Second operand 3 states. [2019-11-24 05:47:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:45,715 INFO L93 Difference]: Finished difference Result 10781 states and 13627 transitions. [2019-11-24 05:47:45,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:45,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-24 05:47:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:45,723 INFO L225 Difference]: With dead ends: 10781 [2019-11-24 05:47:45,723 INFO L226 Difference]: Without dead ends: 7088 [2019-11-24 05:47:45,727 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 05:47:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-11-24 05:47:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 6488. [2019-11-24 05:47:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6488 states. [2019-11-24 05:47:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 8044 transitions. [2019-11-24 05:47:47,232 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 8044 transitions. Word has length 71 [2019-11-24 05:47:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:47,232 INFO L462 AbstractCegarLoop]: Abstraction has 6488 states and 8044 transitions. [2019-11-24 05:47:47,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 8044 transitions. [2019-11-24 05:47:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-24 05:47:47,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:47,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:47,236 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash -138181835, now seen corresponding path program 1 times [2019-11-24 05:47:47,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:47,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653168014] [2019-11-24 05:47:47,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:47,510 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 05:47:47,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653168014] [2019-11-24 05:47:47,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:47,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-24 05:47:47,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257209491] [2019-11-24 05:47:47,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-24 05:47:47,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-24 05:47:47,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:47:47,512 INFO L87 Difference]: Start difference. First operand 6488 states and 8044 transitions. Second operand 15 states. [2019-11-24 05:47:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:52,051 INFO L93 Difference]: Finished difference Result 9122 states and 11427 transitions. [2019-11-24 05:47:52,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-24 05:47:52,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2019-11-24 05:47:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:52,059 INFO L225 Difference]: With dead ends: 9122 [2019-11-24 05:47:52,059 INFO L226 Difference]: Without dead ends: 7816 [2019-11-24 05:47:52,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190 [2019-11-24 05:47:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7816 states. [2019-11-24 05:47:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7816 to 6143. [2019-11-24 05:47:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6143 states. [2019-11-24 05:47:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 7585 transitions. [2019-11-24 05:47:53,586 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 7585 transitions. Word has length 76 [2019-11-24 05:47:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:53,586 INFO L462 AbstractCegarLoop]: Abstraction has 6143 states and 7585 transitions. [2019-11-24 05:47:53,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-24 05:47:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 7585 transitions. [2019-11-24 05:47:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-24 05:47:53,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:53,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:53,589 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:53,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:53,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2085832344, now seen corresponding path program 1 times [2019-11-24 05:47:53,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:53,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132438754] [2019-11-24 05:47:53,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 05:47:53,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132438754] [2019-11-24 05:47:53,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:53,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:53,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602599091] [2019-11-24 05:47:53,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:53,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:53,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:53,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:53,685 INFO L87 Difference]: Start difference. First operand 6143 states and 7585 transitions. Second operand 8 states.