/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/product-lines/email_spec8_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:13:00,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:13:00,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:13:00,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:13:00,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:13:00,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:13:00,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:13:00,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:13:00,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:13:00,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:13:00,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:13:00,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:13:00,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:13:00,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:13:00,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:13:00,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:13:00,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:13:00,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:13:00,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:13:00,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:13:00,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:13:00,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:13:00,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:13:00,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:13:00,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:13:00,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:13:00,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:13:00,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:13:00,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:13:00,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:13:00,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:13:00,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:13:00,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:13:00,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:13:00,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:13:00,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:13:00,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:13:00,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:13:00,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:13:00,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:13:00,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:13:00,711 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:13:00,730 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:13:00,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:13:00,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:13:00,732 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:13:00,732 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:13:00,733 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:13:00,733 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:13:00,733 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:13:00,733 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:13:00,733 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:13:00,733 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:13:00,734 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:13:00,734 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:13:00,734 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:13:00,734 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:13:00,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:13:00,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:13:00,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:13:00,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:13:00,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:13:00,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:13:00,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:13:00,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:13:00,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:13:00,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:13:00,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:13:00,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:13:00,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:13:00,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:13:00,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:13:00,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:13:00,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:13:00,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:13:00,741 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:13:00,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:13:00,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:13:00,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:13:00,743 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:13:01,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:13:01,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:13:01,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:13:01,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:13:01,027 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:13:01,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product34.cil.c [2019-11-24 05:13:01,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7186208/7a8b99336eb346aebff47b93fee14550/FLAG64445e3f3 [2019-11-24 05:13:01,791 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:13:01,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product34.cil.c [2019-11-24 05:13:01,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7186208/7a8b99336eb346aebff47b93fee14550/FLAG64445e3f3 [2019-11-24 05:13:02,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7186208/7a8b99336eb346aebff47b93fee14550 [2019-11-24 05:13:02,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:13:02,027 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:13:02,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:13:02,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:13:02,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:13:02,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:13:02" (1/1) ... [2019-11-24 05:13:02,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea6eddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:02, skipping insertion in model container [2019-11-24 05:13:02,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:13:02" (1/1) ... [2019-11-24 05:13:02,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:13:02,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:13:02,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:13:02,830 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:13:03,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:13:03,147 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:13:03,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03 WrapperNode [2019-11-24 05:13:03,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:13:03,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:13:03,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:13:03,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:13:03,159 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:13:03" (1/1) ... [2019-11-24 05:13:03,217 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:13:03" (1/1) ... [2019-11-24 05:13:03,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:13:03,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:13:03,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:13:03,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:13:03,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (1/1) ... [2019-11-24 05:13:03,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (1/1) ... [2019-11-24 05:13:03,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (1/1) ... [2019-11-24 05:13:03,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (1/1) ... [2019-11-24 05:13:03,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (1/1) ... [2019-11-24 05:13:03,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (1/1) ... [2019-11-24 05:13:03,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (1/1) ... [2019-11-24 05:13:03,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:13:03,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:13:03,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:13:03,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:13:03,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (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:13:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 05:13:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 05:13:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 05:13:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:13:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:13:26,590 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:13:26,591 INFO L284 CfgBuilder]: Removed 861 assume(true) statements. [2019-11-24 05:13:26,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:13:26 BoogieIcfgContainer [2019-11-24 05:13:26,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:13:26,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:13:26,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:13:26,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:13:26,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:13:02" (1/3) ... [2019-11-24 05:13:26,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449f05ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:13:26, skipping insertion in model container [2019-11-24 05:13:26,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:13:03" (2/3) ... [2019-11-24 05:13:26,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449f05ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:13:26, skipping insertion in model container [2019-11-24 05:13:26,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:13:26" (3/3) ... [2019-11-24 05:13:26,623 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product34.cil.c [2019-11-24 05:13:26,638 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:13:26,649 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:13:26,667 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:13:26,706 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:13:26,706 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:13:26,706 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:13:26,706 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:13:26,707 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:13:26,707 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:13:26,707 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:13:26,707 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:13:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 05:13:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:13:26,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:26,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:13:26,755 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:13:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2045297062, now seen corresponding path program 1 times [2019-11-24 05:13:26,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:26,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051366617] [2019-11-24 05:13:26,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:27,307 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:13:27,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051366617] [2019-11-24 05:13:27,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:27,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:13:27,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690838521] [2019-11-24 05:13:27,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 05:13:27,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:27,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 05:13:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:13:27,335 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 05:13:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:27,376 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 05:13:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 05:13:27,378 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 05:13:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:27,394 INFO L225 Difference]: With dead ends: 100 [2019-11-24 05:13:27,395 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 05:13:27,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:13:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 05:13:27,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 05:13:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 05:13:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 05:13:27,466 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 05:13:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:27,466 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 05:13:27,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 05:13:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 05:13:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:13:27,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:27,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:13:27,470 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:13:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1903753717, now seen corresponding path program 1 times [2019-11-24 05:13:27,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:27,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806576573] [2019-11-24 05:13:27,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:27,670 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:13:27,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806576573] [2019-11-24 05:13:27,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:27,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:13:27,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818631702] [2019-11-24 05:13:27,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:13:27,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:13:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:27,676 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 05:13:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:27,702 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 05:13:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:13:27,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:13:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:27,705 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:13:27,705 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 05:13:27,706 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:13:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 05:13:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 05:13:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 05:13:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 05:13:27,727 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 05:13:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:27,727 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 05:13:27,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:13:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 05:13:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:13:27,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:27,730 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:13:27,730 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:13:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1071006360, now seen corresponding path program 1 times [2019-11-24 05:13:27,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:27,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349766019] [2019-11-24 05:13:27,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:13:27,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349766019] [2019-11-24 05:13:27,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:27,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:13:27,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168186821] [2019-11-24 05:13:27,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:13:27,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:13:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:27,883 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 05:13:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:28,045 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-11-24 05:13:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:13:28,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 05:13:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:28,047 INFO L225 Difference]: With dead ends: 86 [2019-11-24 05:13:28,048 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 05:13:28,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 05:13:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-24 05:13:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 05:13:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 05:13:28,055 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 05:13:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:28,056 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 05:13:28,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:13:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 05:13:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:13:28,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:28,057 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:13:28,057 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:13:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:28,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1548872949, now seen corresponding path program 1 times [2019-11-24 05:13:28,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:28,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123166440] [2019-11-24 05:13:28,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:13:28,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123166440] [2019-11-24 05:13:28,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:28,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:13:28,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353738478] [2019-11-24 05:13:28,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:13:28,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:28,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:13:28,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:13:28,239 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 5 states. [2019-11-24 05:13:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:28,500 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2019-11-24 05:13:28,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 05:13:28,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 05:13:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:28,504 INFO L225 Difference]: With dead ends: 124 [2019-11-24 05:13:28,504 INFO L226 Difference]: Without dead ends: 101 [2019-11-24 05:13:28,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:13:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-24 05:13:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-11-24 05:13:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-24 05:13:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2019-11-24 05:13:28,517 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 15 [2019-11-24 05:13:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:28,517 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 129 transitions. [2019-11-24 05:13:28,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:13:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 129 transitions. [2019-11-24 05:13:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:13:28,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:28,521 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:13:28,521 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:13:28,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:28,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1562466025, now seen corresponding path program 1 times [2019-11-24 05:13:28,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:28,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771472218] [2019-11-24 05:13:28,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:13:28,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771472218] [2019-11-24 05:13:28,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:28,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:13:28,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942191481] [2019-11-24 05:13:28,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:13:28,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:28,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:13:28,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:13:28,738 INFO L87 Difference]: Start difference. First operand 81 states and 129 transitions. Second operand 4 states. [2019-11-24 05:13:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:28,826 INFO L93 Difference]: Finished difference Result 101 states and 149 transitions. [2019-11-24 05:13:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:13:28,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 05:13:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:28,828 INFO L225 Difference]: With dead ends: 101 [2019-11-24 05:13:28,828 INFO L226 Difference]: Without dead ends: 92 [2019-11-24 05:13:28,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:13:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-24 05:13:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2019-11-24 05:13:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-24 05:13:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2019-11-24 05:13:28,838 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 18 [2019-11-24 05:13:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:28,838 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2019-11-24 05:13:28,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:13:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2019-11-24 05:13:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:13:28,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:28,840 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:13:28,840 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:13:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1563264253, now seen corresponding path program 1 times [2019-11-24 05:13:28,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:28,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128676887] [2019-11-24 05:13:28,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:13:29,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128676887] [2019-11-24 05:13:29,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:29,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:13:29,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001101998] [2019-11-24 05:13:29,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:13:29,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:13:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:13:29,202 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand 8 states. [2019-11-24 05:13:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:30,340 INFO L93 Difference]: Finished difference Result 163 states and 258 transitions. [2019-11-24 05:13:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:13:30,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-24 05:13:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:30,346 INFO L225 Difference]: With dead ends: 163 [2019-11-24 05:13:30,346 INFO L226 Difference]: Without dead ends: 138 [2019-11-24 05:13:30,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:13:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-24 05:13:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2019-11-24 05:13:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-24 05:13:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 225 transitions. [2019-11-24 05:13:30,370 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 225 transitions. Word has length 18 [2019-11-24 05:13:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:30,370 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 225 transitions. [2019-11-24 05:13:30,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:13:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 225 transitions. [2019-11-24 05:13:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 05:13:30,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:30,377 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:13:30,378 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:13:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash -932578098, now seen corresponding path program 1 times [2019-11-24 05:13:30,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:30,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860307630] [2019-11-24 05:13:30,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:30,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860307630] [2019-11-24 05:13:30,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:30,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:13:30,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943926160] [2019-11-24 05:13:30,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:13:30,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:30,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:13:30,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:30,479 INFO L87 Difference]: Start difference. First operand 134 states and 225 transitions. Second operand 3 states. [2019-11-24 05:13:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:30,512 INFO L93 Difference]: Finished difference Result 394 states and 663 transitions. [2019-11-24 05:13:30,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:13:30,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 05:13:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:30,515 INFO L225 Difference]: With dead ends: 394 [2019-11-24 05:13:30,515 INFO L226 Difference]: Without dead ends: 262 [2019-11-24 05:13:30,522 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:13:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-24 05:13:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 226. [2019-11-24 05:13:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-24 05:13:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 398 transitions. [2019-11-24 05:13:30,560 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 398 transitions. Word has length 22 [2019-11-24 05:13:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:30,560 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 398 transitions. [2019-11-24 05:13:30,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:13:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 398 transitions. [2019-11-24 05:13:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 05:13:30,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:30,564 INFO L410 BasicCegarLoop]: trace histogram [2, 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:13:30,565 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:13:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:30,565 INFO L82 PathProgramCache]: Analyzing trace with hash 804747301, now seen corresponding path program 1 times [2019-11-24 05:13:30,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:30,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201938963] [2019-11-24 05:13:30,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:30,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201938963] [2019-11-24 05:13:30,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:30,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:13:30,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971898032] [2019-11-24 05:13:30,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:13:30,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:30,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:13:30,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:30,639 INFO L87 Difference]: Start difference. First operand 226 states and 398 transitions. Second operand 3 states. [2019-11-24 05:13:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:30,683 INFO L93 Difference]: Finished difference Result 666 states and 1174 transitions. [2019-11-24 05:13:30,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:13:30,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 05:13:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:30,686 INFO L225 Difference]: With dead ends: 666 [2019-11-24 05:13:30,686 INFO L226 Difference]: Without dead ends: 442 [2019-11-24 05:13:30,688 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:13:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-24 05:13:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 406. [2019-11-24 05:13:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-11-24 05:13:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 732 transitions. [2019-11-24 05:13:30,730 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 732 transitions. Word has length 23 [2019-11-24 05:13:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:30,731 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 732 transitions. [2019-11-24 05:13:30,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:13:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 732 transitions. [2019-11-24 05:13:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:13:30,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:30,733 INFO L410 BasicCegarLoop]: trace histogram [2, 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:13:30,733 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:13:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1697099644, now seen corresponding path program 1 times [2019-11-24 05:13:30,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:30,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371822501] [2019-11-24 05:13:30,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:30,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371822501] [2019-11-24 05:13:30,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:30,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:13:30,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675865539] [2019-11-24 05:13:30,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:13:30,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:30,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:13:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:30,822 INFO L87 Difference]: Start difference. First operand 406 states and 732 transitions. Second operand 3 states. [2019-11-24 05:13:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:30,886 INFO L93 Difference]: Finished difference Result 1198 states and 2160 transitions. [2019-11-24 05:13:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:13:30,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 05:13:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:30,891 INFO L225 Difference]: With dead ends: 1198 [2019-11-24 05:13:30,891 INFO L226 Difference]: Without dead ends: 794 [2019-11-24 05:13:30,892 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:13:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-11-24 05:13:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 758. [2019-11-24 05:13:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-11-24 05:13:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1376 transitions. [2019-11-24 05:13:30,961 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1376 transitions. Word has length 24 [2019-11-24 05:13:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:30,962 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1376 transitions. [2019-11-24 05:13:30,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:13:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1376 transitions. [2019-11-24 05:13:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 05:13:30,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:30,964 INFO L410 BasicCegarLoop]: trace histogram [2, 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:13:30,964 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:13:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1971524505, now seen corresponding path program 1 times [2019-11-24 05:13:30,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:30,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330073584] [2019-11-24 05:13:30,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:31,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330073584] [2019-11-24 05:13:31,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:31,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:13:31,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839777992] [2019-11-24 05:13:31,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:13:31,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:13:31,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:31,034 INFO L87 Difference]: Start difference. First operand 758 states and 1376 transitions. Second operand 3 states. [2019-11-24 05:13:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:31,194 INFO L93 Difference]: Finished difference Result 2238 states and 4060 transitions. [2019-11-24 05:13:31,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:13:31,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 05:13:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:31,204 INFO L225 Difference]: With dead ends: 2238 [2019-11-24 05:13:31,204 INFO L226 Difference]: Without dead ends: 1482 [2019-11-24 05:13:31,206 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:13:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2019-11-24 05:13:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1446. [2019-11-24 05:13:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2019-11-24 05:13:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2616 transitions. [2019-11-24 05:13:31,380 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2616 transitions. Word has length 25 [2019-11-24 05:13:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:31,380 INFO L462 AbstractCegarLoop]: Abstraction has 1446 states and 2616 transitions. [2019-11-24 05:13:31,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:13:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2616 transitions. [2019-11-24 05:13:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 05:13:31,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:31,382 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:13:31,382 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:13:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1356560051, now seen corresponding path program 1 times [2019-11-24 05:13:31,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:31,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989326833] [2019-11-24 05:13:31,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:31,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989326833] [2019-11-24 05:13:31,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:31,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:13:31,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11610706] [2019-11-24 05:13:31,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:13:31,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:31,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:13:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:31,439 INFO L87 Difference]: Start difference. First operand 1446 states and 2616 transitions. Second operand 3 states. [2019-11-24 05:13:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:31,627 INFO L93 Difference]: Finished difference Result 4270 states and 7716 transitions. [2019-11-24 05:13:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:13:31,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 05:13:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:31,643 INFO L225 Difference]: With dead ends: 4270 [2019-11-24 05:13:31,643 INFO L226 Difference]: Without dead ends: 2826 [2019-11-24 05:13:31,646 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:13:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-11-24 05:13:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2790. [2019-11-24 05:13:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-11-24 05:13:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 5000 transitions. [2019-11-24 05:13:31,829 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 5000 transitions. Word has length 26 [2019-11-24 05:13:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:31,829 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 5000 transitions. [2019-11-24 05:13:31,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:13:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 5000 transitions. [2019-11-24 05:13:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 05:13:31,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:31,831 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:13:31,831 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:13:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1090212264, now seen corresponding path program 1 times [2019-11-24 05:13:31,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:31,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135766303] [2019-11-24 05:13:31,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:31,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135766303] [2019-11-24 05:13:31,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:13:31,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:13:31,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430087406] [2019-11-24 05:13:31,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:13:31,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:13:31,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:13:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:13:31,925 INFO L87 Difference]: Start difference. First operand 2790 states and 5000 transitions. Second operand 3 states. [2019-11-24 05:13:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:13:32,189 INFO L93 Difference]: Finished difference Result 6924 states and 12434 transitions. [2019-11-24 05:13:32,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:13:32,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 05:13:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:13:32,211 INFO L225 Difference]: With dead ends: 6924 [2019-11-24 05:13:32,211 INFO L226 Difference]: Without dead ends: 4136 [2019-11-24 05:13:32,216 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:13:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2019-11-24 05:13:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 4102. [2019-11-24 05:13:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-11-24 05:13:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 7272 transitions. [2019-11-24 05:13:32,533 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 7272 transitions. Word has length 27 [2019-11-24 05:13:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:13:32,534 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 7272 transitions. [2019-11-24 05:13:32,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:13:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 7272 transitions. [2019-11-24 05:13:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:13:32,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:13:32,536 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:13:32,536 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:13:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:13:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash -585582466, now seen corresponding path program 1 times [2019-11-24 05:13:32,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:13:32,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445209202] [2019-11-24 05:13:32,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:13:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:32,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445209202] [2019-11-24 05:13:32,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671361091] [2019-11-24 05:13:32,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:13:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:13:33,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 05:13:33,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:13:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:33,286 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:13:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:13:33,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [711115211] [2019-11-24 05:13:33,340 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-24 05:13:33,340 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:13:33,349 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:13:33,360 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:13:33,360 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs