/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/elevator_spec1_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:37:07,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:37:07,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:37:07,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:37:07,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:37:07,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:37:07,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:37:07,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:37:07,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:37:07,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:37:07,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:37:07,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:37:07,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:37:07,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:37:07,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:37:07,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:37:07,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:37:07,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:37:07,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:37:07,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:37:07,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:37:07,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:37:07,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:37:07,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:37:07,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:37:07,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:37:07,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:37:07,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:37:07,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:37:07,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:37:07,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:37:07,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:37:07,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:37:07,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:37:07,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:37:07,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:37:07,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:37:07,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:37:07,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:37:07,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:37:07,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:37:07,789 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 04:37:07,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:37:07,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:37:07,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:37:07,810 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:37:07,810 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:37:07,810 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:37:07,811 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:37:07,811 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:37:07,811 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:37:07,811 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:37:07,811 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:37:07,812 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:37:07,812 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:37:07,812 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:37:07,812 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:37:07,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:37:07,813 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:37:07,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:37:07,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:37:07,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:37:07,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:37:07,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:37:07,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:37:07,816 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:37:07,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:37:07,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:37:07,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:37:07,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:37:07,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:37:07,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:37:07,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:37:07,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:37:07,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:37:07,818 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:37:07,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:37:07,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:37:07,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:37:07,818 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:37:08,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:37:08,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:37:08,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:37:08,109 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:37:08,109 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:37:08,110 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product18.cil.c [2019-11-24 04:37:08,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0472e0ff/6a5660a08a2d4ed7bc46344ad9a53141/FLAG8c7421228 [2019-11-24 04:37:08,800 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:37:08,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product18.cil.c [2019-11-24 04:37:08,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0472e0ff/6a5660a08a2d4ed7bc46344ad9a53141/FLAG8c7421228 [2019-11-24 04:37:09,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0472e0ff/6a5660a08a2d4ed7bc46344ad9a53141 [2019-11-24 04:37:09,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:37:09,025 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:37:09,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:37:09,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:37:09,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:37:09,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:37:09" (1/1) ... [2019-11-24 04:37:09,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584faea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:09, skipping insertion in model container [2019-11-24 04:37:09,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:37:09" (1/1) ... [2019-11-24 04:37:09,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:37:09,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:37:09,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:37:09,872 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:37:10,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:37:10,103 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:37:10,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10 WrapperNode [2019-11-24 04:37:10,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:37:10,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:37:10,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:37:10,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:37:10,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:37:10,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:37:10,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:37:10,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:37:10,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (1/1) ... [2019-11-24 04:37:10,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:37:10,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:37:10,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:37:10,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:37:10,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (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 04:37:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:37:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:37:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:37:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:37:53,768 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:37:53,768 INFO L284 CfgBuilder]: Removed 993 assume(true) statements. [2019-11-24 04:37:53,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:53 BoogieIcfgContainer [2019-11-24 04:37:53,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:37:53,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:37:53,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:37:53,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:37:53,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:37:09" (1/3) ... [2019-11-24 04:37:53,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90fd393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:53, skipping insertion in model container [2019-11-24 04:37:53,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:10" (2/3) ... [2019-11-24 04:37:53,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90fd393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:53, skipping insertion in model container [2019-11-24 04:37:53,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:53" (3/3) ... [2019-11-24 04:37:53,777 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product18.cil.c [2019-11-24 04:37:53,785 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:37:53,794 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:37:53,806 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:37:53,840 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:37:53,840 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:37:53,840 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:37:53,840 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:37:53,841 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:37:53,841 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:37:53,841 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:37:53,841 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:37:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states. [2019-11-24 04:37:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:37:53,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:53,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:53,898 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:53,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:53,903 INFO L82 PathProgramCache]: Analyzing trace with hash -404914782, now seen corresponding path program 1 times [2019-11-24 04:37:53,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:53,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822853554] [2019-11-24 04:37:53,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:54,297 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 04:37:54,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822853554] [2019-11-24 04:37:54,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:54,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:37:54,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051859299] [2019-11-24 04:37:54,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:37:54,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:54,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:37:54,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:37:54,322 INFO L87 Difference]: Start difference. First operand 1433 states. Second operand 2 states. [2019-11-24 04:37:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:54,426 INFO L93 Difference]: Finished difference Result 1450 states and 2795 transitions. [2019-11-24 04:37:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:37:54,429 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-24 04:37:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:54,469 INFO L225 Difference]: With dead ends: 1450 [2019-11-24 04:37:54,469 INFO L226 Difference]: Without dead ends: 1431 [2019-11-24 04:37:54,476 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 04:37:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-11-24 04:37:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2019-11-24 04:37:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-11-24 04:37:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2765 transitions. [2019-11-24 04:37:54,617 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2765 transitions. Word has length 12 [2019-11-24 04:37:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:54,617 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 2765 transitions. [2019-11-24 04:37:54,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:37:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2765 transitions. [2019-11-24 04:37:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:37:54,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:54,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:54,629 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 232252590, now seen corresponding path program 1 times [2019-11-24 04:37:54,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:54,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467753902] [2019-11-24 04:37:54,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:54,829 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 04:37:54,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467753902] [2019-11-24 04:37:54,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:54,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:54,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018769567] [2019-11-24 04:37:54,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:54,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:54,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:54,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:54,834 INFO L87 Difference]: Start difference. First operand 1431 states and 2765 transitions. Second operand 3 states. [2019-11-24 04:37:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:54,951 INFO L93 Difference]: Finished difference Result 2163 states and 4174 transitions. [2019-11-24 04:37:54,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:54,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:37:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:54,961 INFO L225 Difference]: With dead ends: 2163 [2019-11-24 04:37:54,961 INFO L226 Difference]: Without dead ends: 1427 [2019-11-24 04:37:54,968 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 04:37:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-11-24 04:37:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2019-11-24 04:37:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-11-24 04:37:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2757 transitions. [2019-11-24 04:37:55,008 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2757 transitions. Word has length 13 [2019-11-24 04:37:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:55,009 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 2757 transitions. [2019-11-24 04:37:55,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2757 transitions. [2019-11-24 04:37:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:37:55,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:55,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:55,011 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1972306641, now seen corresponding path program 1 times [2019-11-24 04:37:55,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:55,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437049701] [2019-11-24 04:37:55,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:55,149 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 04:37:55,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437049701] [2019-11-24 04:37:55,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:55,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:55,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083426865] [2019-11-24 04:37:55,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:55,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:55,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:55,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:55,153 INFO L87 Difference]: Start difference. First operand 1427 states and 2757 transitions. Second operand 4 states. [2019-11-24 04:37:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:56,433 INFO L93 Difference]: Finished difference Result 3641 states and 7001 transitions. [2019-11-24 04:37:56,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:56,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:37:56,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:56,450 INFO L225 Difference]: With dead ends: 3641 [2019-11-24 04:37:56,450 INFO L226 Difference]: Without dead ends: 2672 [2019-11-24 04:37:56,453 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 04:37:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-11-24 04:37:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1879. [2019-11-24 04:37:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-11-24 04:37:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 3534 transitions. [2019-11-24 04:37:56,535 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 3534 transitions. Word has length 15 [2019-11-24 04:37:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:56,535 INFO L462 AbstractCegarLoop]: Abstraction has 1879 states and 3534 transitions. [2019-11-24 04:37:56,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 3534 transitions. [2019-11-24 04:37:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:37:56,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:56,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:56,539 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash -700619629, now seen corresponding path program 1 times [2019-11-24 04:37:56,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:56,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16045730] [2019-11-24 04:37:56,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:56,707 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 04:37:56,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16045730] [2019-11-24 04:37:56,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:56,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:56,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157742490] [2019-11-24 04:37:56,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:56,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:56,709 INFO L87 Difference]: Start difference. First operand 1879 states and 3534 transitions. Second operand 5 states. [2019-11-24 04:37:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:56,935 INFO L93 Difference]: Finished difference Result 3182 states and 5991 transitions. [2019-11-24 04:37:56,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:56,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:37:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:56,954 INFO L225 Difference]: With dead ends: 3182 [2019-11-24 04:37:56,954 INFO L226 Difference]: Without dead ends: 3169 [2019-11-24 04:37:56,956 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 04:37:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2019-11-24 04:37:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 1883. [2019-11-24 04:37:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1883 states. [2019-11-24 04:37:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 3538 transitions. [2019-11-24 04:37:57,025 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 3538 transitions. Word has length 17 [2019-11-24 04:37:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:57,026 INFO L462 AbstractCegarLoop]: Abstraction has 1883 states and 3538 transitions. [2019-11-24 04:37:57,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 3538 transitions. [2019-11-24 04:37:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:37:57,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:57,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:57,028 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 900070688, now seen corresponding path program 1 times [2019-11-24 04:37:57,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:57,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134378880] [2019-11-24 04:37:57,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:57,127 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 04:37:57,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134378880] [2019-11-24 04:37:57,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:57,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:37:57,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927992231] [2019-11-24 04:37:57,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:57,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:57,130 INFO L87 Difference]: Start difference. First operand 1883 states and 3538 transitions. Second operand 3 states. [2019-11-24 04:37:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:57,631 INFO L93 Difference]: Finished difference Result 3515 states and 6601 transitions. [2019-11-24 04:37:57,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:57,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:37:57,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:57,643 INFO L225 Difference]: With dead ends: 3515 [2019-11-24 04:37:57,644 INFO L226 Difference]: Without dead ends: 2215 [2019-11-24 04:37:57,647 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 04:37:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-11-24 04:37:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2202. [2019-11-24 04:37:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2019-11-24 04:37:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 4132 transitions. [2019-11-24 04:37:57,727 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 4132 transitions. Word has length 18 [2019-11-24 04:37:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:57,727 INFO L462 AbstractCegarLoop]: Abstraction has 2202 states and 4132 transitions. [2019-11-24 04:37:57,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 4132 transitions. [2019-11-24 04:37:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:37:57,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:57,729 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] [2019-11-24 04:37:57,730 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1714969874, now seen corresponding path program 1 times [2019-11-24 04:37:57,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:57,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058535141] [2019-11-24 04:37:57,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:57,814 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 04:37:57,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058535141] [2019-11-24 04:37:57,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:57,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:57,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780385551] [2019-11-24 04:37:57,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:57,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:57,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:57,817 INFO L87 Difference]: Start difference. First operand 2202 states and 4132 transitions. Second operand 4 states. [2019-11-24 04:37:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:58,023 INFO L93 Difference]: Finished difference Result 4066 states and 7591 transitions. [2019-11-24 04:37:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:58,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 04:37:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:58,035 INFO L225 Difference]: With dead ends: 4066 [2019-11-24 04:37:58,035 INFO L226 Difference]: Without dead ends: 2148 [2019-11-24 04:37:58,038 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 04:37:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-11-24 04:37:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1695. [2019-11-24 04:37:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-11-24 04:37:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 3166 transitions. [2019-11-24 04:37:58,105 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 3166 transitions. Word has length 20 [2019-11-24 04:37:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:58,106 INFO L462 AbstractCegarLoop]: Abstraction has 1695 states and 3166 transitions. [2019-11-24 04:37:58,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3166 transitions. [2019-11-24 04:37:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:37:58,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:58,107 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] [2019-11-24 04:37:58,108 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash 756263166, now seen corresponding path program 1 times [2019-11-24 04:37:58,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:58,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349670988] [2019-11-24 04:37:58,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:58,192 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 04:37:58,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349670988] [2019-11-24 04:37:58,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:58,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:58,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270914948] [2019-11-24 04:37:58,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:58,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:58,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:58,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:58,194 INFO L87 Difference]: Start difference. First operand 1695 states and 3166 transitions. Second operand 4 states. [2019-11-24 04:38:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:00,281 INFO L93 Difference]: Finished difference Result 3489 states and 6475 transitions. [2019-11-24 04:38:00,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:00,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-24 04:38:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:00,293 INFO L225 Difference]: With dead ends: 3489 [2019-11-24 04:38:00,293 INFO L226 Difference]: Without dead ends: 2352 [2019-11-24 04:38:00,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2019-11-24 04:38:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1707. [2019-11-24 04:38:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-24 04:38:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 3175 transitions. [2019-11-24 04:38:00,371 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 3175 transitions. Word has length 21 [2019-11-24 04:38:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:00,372 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 3175 transitions. [2019-11-24 04:38:00,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:38:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 3175 transitions. [2019-11-24 04:38:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:38:00,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:00,373 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] [2019-11-24 04:38:00,374 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:00,374 INFO L82 PathProgramCache]: Analyzing trace with hash -467449475, now seen corresponding path program 1 times [2019-11-24 04:38:00,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:00,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890212362] [2019-11-24 04:38:00,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:00,485 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 04:38:00,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890212362] [2019-11-24 04:38:00,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:00,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:00,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143523286] [2019-11-24 04:38:00,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:38:00,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:00,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:38:00,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:38:00,487 INFO L87 Difference]: Start difference. First operand 1707 states and 3175 transitions. Second operand 4 states. [2019-11-24 04:38:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:00,651 INFO L93 Difference]: Finished difference Result 2911 states and 5362 transitions. [2019-11-24 04:38:00,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:00,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-24 04:38:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:00,666 INFO L225 Difference]: With dead ends: 2911 [2019-11-24 04:38:00,667 INFO L226 Difference]: Without dead ends: 2898 [2019-11-24 04:38:00,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-11-24 04:38:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1758. [2019-11-24 04:38:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1758 states. [2019-11-24 04:38:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 3248 transitions. [2019-11-24 04:38:00,753 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 3248 transitions. Word has length 24 [2019-11-24 04:38:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:00,754 INFO L462 AbstractCegarLoop]: Abstraction has 1758 states and 3248 transitions. [2019-11-24 04:38:00,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:38:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3248 transitions. [2019-11-24 04:38:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:38:00,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:00,755 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] [2019-11-24 04:38:00,756 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash 337913111, now seen corresponding path program 1 times [2019-11-24 04:38:00,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:00,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216450464] [2019-11-24 04:38:00,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:00,842 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 04:38:00,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216450464] [2019-11-24 04:38:00,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:00,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:00,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700516508] [2019-11-24 04:38:00,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:00,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:00,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:00,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:00,844 INFO L87 Difference]: Start difference. First operand 1758 states and 3248 transitions. Second operand 3 states. [2019-11-24 04:38:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:00,985 INFO L93 Difference]: Finished difference Result 4084 states and 7583 transitions. [2019-11-24 04:38:00,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:00,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:38:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:00,999 INFO L225 Difference]: With dead ends: 4084 [2019-11-24 04:38:01,000 INFO L226 Difference]: Without dead ends: 2918 [2019-11-24 04:38:01,002 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 04:38:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2019-11-24 04:38:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2918. [2019-11-24 04:38:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2918 states. [2019-11-24 04:38:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 5408 transitions. [2019-11-24 04:38:01,138 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 5408 transitions. Word has length 25 [2019-11-24 04:38:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:01,138 INFO L462 AbstractCegarLoop]: Abstraction has 2918 states and 5408 transitions. [2019-11-24 04:38:01,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 5408 transitions. [2019-11-24 04:38:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:38:01,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:01,140 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] [2019-11-24 04:38:01,140 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:01,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1885399880, now seen corresponding path program 1 times [2019-11-24 04:38:01,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:01,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773761415] [2019-11-24 04:38:01,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:01,234 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 04:38:01,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773761415] [2019-11-24 04:38:01,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:01,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:01,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310495220] [2019-11-24 04:38:01,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:01,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:01,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:01,236 INFO L87 Difference]: Start difference. First operand 2918 states and 5408 transitions. Second operand 5 states. [2019-11-24 04:38:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:01,655 INFO L93 Difference]: Finished difference Result 9605 states and 17888 transitions. [2019-11-24 04:38:01,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:38:01,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-24 04:38:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:01,675 INFO L225 Difference]: With dead ends: 9605 [2019-11-24 04:38:01,676 INFO L226 Difference]: Without dead ends: 7234 [2019-11-24 04:38:01,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:38:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7234 states. [2019-11-24 04:38:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7234 to 2896. [2019-11-24 04:38:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2019-11-24 04:38:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 5370 transitions. [2019-11-24 04:38:01,868 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 5370 transitions. Word has length 26 [2019-11-24 04:38:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:01,869 INFO L462 AbstractCegarLoop]: Abstraction has 2896 states and 5370 transitions. [2019-11-24 04:38:01,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 5370 transitions. [2019-11-24 04:38:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:38:01,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:01,870 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] [2019-11-24 04:38:01,871 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:01,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:01,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2038571902, now seen corresponding path program 1 times [2019-11-24 04:38:01,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:01,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738531428] [2019-11-24 04:38:01,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:38:02,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738531428] [2019-11-24 04:38:02,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:02,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:02,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617836485] [2019-11-24 04:38:02,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:02,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:02,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:02,046 INFO L87 Difference]: Start difference. First operand 2896 states and 5370 transitions. Second operand 5 states. [2019-11-24 04:38:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:02,551 INFO L93 Difference]: Finished difference Result 5225 states and 9682 transitions. [2019-11-24 04:38:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:38:02,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-24 04:38:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:02,561 INFO L225 Difference]: With dead ends: 5225 [2019-11-24 04:38:02,561 INFO L226 Difference]: Without dead ends: 4063 [2019-11-24 04:38:02,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:38:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2019-11-24 04:38:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 2896. [2019-11-24 04:38:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2019-11-24 04:38:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 5366 transitions. [2019-11-24 04:38:02,713 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 5366 transitions. Word has length 26 [2019-11-24 04:38:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:02,713 INFO L462 AbstractCegarLoop]: Abstraction has 2896 states and 5366 transitions. [2019-11-24 04:38:02,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 5366 transitions. [2019-11-24 04:38:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:38:02,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:02,715 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] [2019-11-24 04:38:02,715 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:02,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:02,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1353603471, now seen corresponding path program 1 times [2019-11-24 04:38:02,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:02,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873403212] [2019-11-24 04:38:02,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:02,810 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 04:38:02,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873403212] [2019-11-24 04:38:02,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:02,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:02,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771585026] [2019-11-24 04:38:02,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:02,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:02,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:02,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:02,812 INFO L87 Difference]: Start difference. First operand 2896 states and 5366 transitions. Second operand 5 states. [2019-11-24 04:38:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:03,489 INFO L93 Difference]: Finished difference Result 7477 states and 13886 transitions. [2019-11-24 04:38:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:38:03,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-24 04:38:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:03,498 INFO L225 Difference]: With dead ends: 7477 [2019-11-24 04:38:03,498 INFO L226 Difference]: Without dead ends: 5155 [2019-11-24 04:38:03,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:38:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2019-11-24 04:38:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 2896. [2019-11-24 04:38:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2019-11-24 04:38:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 5358 transitions. [2019-11-24 04:38:03,652 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 5358 transitions. Word has length 26 [2019-11-24 04:38:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:03,653 INFO L462 AbstractCegarLoop]: Abstraction has 2896 states and 5358 transitions. [2019-11-24 04:38:03,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 5358 transitions. [2019-11-24 04:38:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:38:03,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:03,654 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] [2019-11-24 04:38:03,654 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash 499919446, now seen corresponding path program 1 times [2019-11-24 04:38:03,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:03,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844986453] [2019-11-24 04:38:03,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:03,854 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 04:38:03,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844986453] [2019-11-24 04:38:03,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:03,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:03,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894339724] [2019-11-24 04:38:03,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:38:03,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:03,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:38:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:38:03,856 INFO L87 Difference]: Start difference. First operand 2896 states and 5358 transitions. Second operand 4 states. [2019-11-24 04:38:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:04,617 INFO L93 Difference]: Finished difference Result 6455 states and 11902 transitions. [2019-11-24 04:38:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:04,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 04:38:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:04,624 INFO L225 Difference]: With dead ends: 6455 [2019-11-24 04:38:04,624 INFO L226 Difference]: Without dead ends: 4102 [2019-11-24 04:38:04,629 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 04:38:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-24 04:38:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 2896. [2019-11-24 04:38:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2019-11-24 04:38:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 5348 transitions. [2019-11-24 04:38:04,812 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 5348 transitions. Word has length 26 [2019-11-24 04:38:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:04,812 INFO L462 AbstractCegarLoop]: Abstraction has 2896 states and 5348 transitions. [2019-11-24 04:38:04,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:38:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 5348 transitions. [2019-11-24 04:38:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:38:04,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:04,814 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] [2019-11-24 04:38:04,814 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash 999006091, now seen corresponding path program 1 times [2019-11-24 04:38:04,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:04,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777797102] [2019-11-24 04:38:04,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:04,876 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 04:38:04,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777797102] [2019-11-24 04:38:04,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:04,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:04,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506113417] [2019-11-24 04:38:04,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:38:04,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:04,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:38:04,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:38:04,879 INFO L87 Difference]: Start difference. First operand 2896 states and 5348 transitions. Second operand 4 states. [2019-11-24 04:38:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:05,129 INFO L93 Difference]: Finished difference Result 6437 states and 11858 transitions. [2019-11-24 04:38:05,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:05,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 04:38:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:05,135 INFO L225 Difference]: With dead ends: 6437 [2019-11-24 04:38:05,135 INFO L226 Difference]: Without dead ends: 4082 [2019-11-24 04:38:05,140 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 04:38:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2019-11-24 04:38:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 2890. [2019-11-24 04:38:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-11-24 04:38:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 5340 transitions. [2019-11-24 04:38:05,311 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 5340 transitions. Word has length 26 [2019-11-24 04:38:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:05,311 INFO L462 AbstractCegarLoop]: Abstraction has 2890 states and 5340 transitions. [2019-11-24 04:38:05,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:38:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 5340 transitions. [2019-11-24 04:38:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:38:05,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:05,312 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] [2019-11-24 04:38:05,312 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2082366654, now seen corresponding path program 1 times [2019-11-24 04:38:05,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:05,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963179323] [2019-11-24 04:38:05,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:05,566 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 04:38:05,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963179323] [2019-11-24 04:38:05,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:05,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:38:05,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002077868] [2019-11-24 04:38:05,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:38:05,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:05,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:38:05,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:38:05,568 INFO L87 Difference]: Start difference. First operand 2890 states and 5340 transitions. Second operand 9 states. [2019-11-24 04:38:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:07,501 INFO L93 Difference]: Finished difference Result 5849 states and 10768 transitions. [2019-11-24 04:38:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:38:07,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-24 04:38:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:07,506 INFO L225 Difference]: With dead ends: 5849 [2019-11-24 04:38:07,506 INFO L226 Difference]: Without dead ends: 3478 [2019-11-24 04:38:07,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:38:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2019-11-24 04:38:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 2890. [2019-11-24 04:38:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-11-24 04:38:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 5226 transitions. [2019-11-24 04:38:07,640 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 5226 transitions. Word has length 28 [2019-11-24 04:38:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:07,640 INFO L462 AbstractCegarLoop]: Abstraction has 2890 states and 5226 transitions. [2019-11-24 04:38:07,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:38:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 5226 transitions. [2019-11-24 04:38:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:38:07,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:07,644 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] [2019-11-24 04:38:07,644 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:07,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash -714896253, now seen corresponding path program 1 times [2019-11-24 04:38:07,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:07,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971748049] [2019-11-24 04:38:07,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:07,786 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 04:38:07,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971748049] [2019-11-24 04:38:07,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:07,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:07,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585438538] [2019-11-24 04:38:07,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:07,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:07,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:07,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:07,789 INFO L87 Difference]: Start difference. First operand 2890 states and 5226 transitions. Second operand 3 states. [2019-11-24 04:38:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:09,347 INFO L93 Difference]: Finished difference Result 5776 states and 10450 transitions. [2019-11-24 04:38:09,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:09,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 04:38:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:09,357 INFO L225 Difference]: With dead ends: 5776 [2019-11-24 04:38:09,357 INFO L226 Difference]: Without dead ends: 3648 [2019-11-24 04:38:09,360 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 04:38:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-11-24 04:38:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2770. [2019-11-24 04:38:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2019-11-24 04:38:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 4926 transitions. [2019-11-24 04:38:09,491 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 4926 transitions. Word has length 38 [2019-11-24 04:38:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:09,491 INFO L462 AbstractCegarLoop]: Abstraction has 2770 states and 4926 transitions. [2019-11-24 04:38:09,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 4926 transitions. [2019-11-24 04:38:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:38:09,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:09,494 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] [2019-11-24 04:38:09,494 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash -322102357, now seen corresponding path program 1 times [2019-11-24 04:38:09,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:09,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949517439] [2019-11-24 04:38:09,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:09,622 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 04:38:09,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949517439] [2019-11-24 04:38:09,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:09,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:09,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762661984] [2019-11-24 04:38:09,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:09,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:09,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:09,624 INFO L87 Difference]: Start difference. First operand 2770 states and 4926 transitions. Second operand 3 states. [2019-11-24 04:38:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:10,954 INFO L93 Difference]: Finished difference Result 5538 states and 9872 transitions. [2019-11-24 04:38:10,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:10,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:38:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:10,960 INFO L225 Difference]: With dead ends: 5538 [2019-11-24 04:38:10,961 INFO L226 Difference]: Without dead ends: 3552 [2019-11-24 04:38:10,963 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 04:38:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2019-11-24 04:38:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 2680. [2019-11-24 04:38:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2019-11-24 04:38:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 4656 transitions. [2019-11-24 04:38:11,193 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 4656 transitions. Word has length 39 [2019-11-24 04:38:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:11,193 INFO L462 AbstractCegarLoop]: Abstraction has 2680 states and 4656 transitions. [2019-11-24 04:38:11,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 4656 transitions. [2019-11-24 04:38:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:38:11,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:11,196 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] [2019-11-24 04:38:11,196 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash 322493478, now seen corresponding path program 1 times [2019-11-24 04:38:11,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:11,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343606423] [2019-11-24 04:38:11,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:11,404 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 04:38:11,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343606423] [2019-11-24 04:38:11,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:11,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:11,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825000403] [2019-11-24 04:38:11,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:11,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:11,406 INFO L87 Difference]: Start difference. First operand 2680 states and 4656 transitions. Second operand 3 states. [2019-11-24 04:38:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:12,589 INFO L93 Difference]: Finished difference Result 5355 states and 9349 transitions. [2019-11-24 04:38:12,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:12,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:38:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:12,595 INFO L225 Difference]: With dead ends: 5355 [2019-11-24 04:38:12,596 INFO L226 Difference]: Without dead ends: 3486 [2019-11-24 04:38:12,599 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 04:38:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2019-11-24 04:38:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2620. [2019-11-24 04:38:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2620 states. [2019-11-24 04:38:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 4416 transitions. [2019-11-24 04:38:12,861 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 4416 transitions. Word has length 41 [2019-11-24 04:38:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:12,861 INFO L462 AbstractCegarLoop]: Abstraction has 2620 states and 4416 transitions. [2019-11-24 04:38:12,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 4416 transitions. [2019-11-24 04:38:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:38:12,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:12,866 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] [2019-11-24 04:38:12,866 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1967810823, now seen corresponding path program 1 times [2019-11-24 04:38:12,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:12,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229337647] [2019-11-24 04:38:12,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:13,043 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 04:38:13,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229337647] [2019-11-24 04:38:13,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:13,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:13,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032903240] [2019-11-24 04:38:13,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:13,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:13,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:13,045 INFO L87 Difference]: Start difference. First operand 2620 states and 4416 transitions. Second operand 3 states. [2019-11-24 04:38:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:14,259 INFO L93 Difference]: Finished difference Result 5227 states and 8881 transitions. [2019-11-24 04:38:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:14,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-24 04:38:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:14,265 INFO L225 Difference]: With dead ends: 5227 [2019-11-24 04:38:14,265 INFO L226 Difference]: Without dead ends: 3450 [2019-11-24 04:38:14,267 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 04:38:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2019-11-24 04:38:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2590. [2019-11-24 04:38:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-11-24 04:38:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4206 transitions. [2019-11-24 04:38:14,480 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4206 transitions. Word has length 44 [2019-11-24 04:38:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:14,480 INFO L462 AbstractCegarLoop]: Abstraction has 2590 states and 4206 transitions. [2019-11-24 04:38:14,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4206 transitions. [2019-11-24 04:38:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:38:14,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:14,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:14,483 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 130726805, now seen corresponding path program 1 times [2019-11-24 04:38:14,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:14,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062485146] [2019-11-24 04:38:14,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:14,605 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 04:38:14,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062485146] [2019-11-24 04:38:14,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:14,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:38:14,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367315222] [2019-11-24 04:38:14,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:38:14,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:38:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:38:14,609 INFO L87 Difference]: Start difference. First operand 2590 states and 4206 transitions. Second operand 6 states. [2019-11-24 04:38:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:16,574 INFO L93 Difference]: Finished difference Result 8859 states and 14725 transitions. [2019-11-24 04:38:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:38:16,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-24 04:38:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:16,585 INFO L225 Difference]: With dead ends: 8859 [2019-11-24 04:38:16,585 INFO L226 Difference]: Without dead ends: 6743 [2019-11-24 04:38:16,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:38:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2019-11-24 04:38:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 5400. [2019-11-24 04:38:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5400 states. [2019-11-24 04:38:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5400 states to 5400 states and 8322 transitions. [2019-11-24 04:38:16,881 INFO L78 Accepts]: Start accepts. Automaton has 5400 states and 8322 transitions. Word has length 46 [2019-11-24 04:38:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:16,882 INFO L462 AbstractCegarLoop]: Abstraction has 5400 states and 8322 transitions. [2019-11-24 04:38:16,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:38:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5400 states and 8322 transitions. [2019-11-24 04:38:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:38:16,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:16,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:16,886 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1010702788, now seen corresponding path program 1 times [2019-11-24 04:38:16,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:16,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568229818] [2019-11-24 04:38:16,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:16,979 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 04:38:16,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568229818] [2019-11-24 04:38:16,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:16,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:38:16,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409064750] [2019-11-24 04:38:16,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:38:16,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:38:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:38:16,983 INFO L87 Difference]: Start difference. First operand 5400 states and 8322 transitions. Second operand 6 states. [2019-11-24 04:38:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:18,128 INFO L93 Difference]: Finished difference Result 13653 states and 20976 transitions. [2019-11-24 04:38:18,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:38:18,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-24 04:38:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:18,137 INFO L225 Difference]: With dead ends: 13653 [2019-11-24 04:38:18,137 INFO L226 Difference]: Without dead ends: 8705 [2019-11-24 04:38:18,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:38:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8705 states. [2019-11-24 04:38:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8705 to 5472. [2019-11-24 04:38:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5472 states. [2019-11-24 04:38:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5472 states to 5472 states and 8278 transitions. [2019-11-24 04:38:18,577 INFO L78 Accepts]: Start accepts. Automaton has 5472 states and 8278 transitions. Word has length 46 [2019-11-24 04:38:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:18,577 INFO L462 AbstractCegarLoop]: Abstraction has 5472 states and 8278 transitions. [2019-11-24 04:38:18,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:38:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states and 8278 transitions. [2019-11-24 04:38:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:38:18,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:18,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:18,580 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:18,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:18,580 INFO L82 PathProgramCache]: Analyzing trace with hash -297384888, now seen corresponding path program 1 times [2019-11-24 04:38:18,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:18,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226369908] [2019-11-24 04:38:18,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:18,679 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 04:38:18,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226369908] [2019-11-24 04:38:18,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:18,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:38:18,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721945995] [2019-11-24 04:38:18,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:38:18,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:18,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:38:18,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:38:18,681 INFO L87 Difference]: Start difference. First operand 5472 states and 8278 transitions. Second operand 6 states. [2019-11-24 04:38:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:19,720 INFO L93 Difference]: Finished difference Result 8472 states and 12986 transitions. [2019-11-24 04:38:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:38:19,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-24 04:38:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:19,727 INFO L225 Difference]: With dead ends: 8472 [2019-11-24 04:38:19,727 INFO L226 Difference]: Without dead ends: 3458 [2019-11-24 04:38:19,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:38:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-11-24 04:38:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3435. [2019-11-24 04:38:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-24 04:38:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5254 transitions. [2019-11-24 04:38:19,932 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5254 transitions. Word has length 46 [2019-11-24 04:38:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:19,932 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5254 transitions. [2019-11-24 04:38:19,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:38:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5254 transitions. [2019-11-24 04:38:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:38:19,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:19,934 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] [2019-11-24 04:38:19,934 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:19,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:19,934 INFO L82 PathProgramCache]: Analyzing trace with hash 860318063, now seen corresponding path program 1 times [2019-11-24 04:38:19,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:19,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731153707] [2019-11-24 04:38:19,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:20,130 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 04:38:20,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731153707] [2019-11-24 04:38:20,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:20,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:20,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021126625] [2019-11-24 04:38:20,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:20,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:20,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:20,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:20,132 INFO L87 Difference]: Start difference. First operand 3435 states and 5254 transitions. Second operand 3 states. [2019-11-24 04:38:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:21,360 INFO L93 Difference]: Finished difference Result 5998 states and 9154 transitions. [2019-11-24 04:38:21,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:21,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-24 04:38:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:21,364 INFO L225 Difference]: With dead ends: 5998 [2019-11-24 04:38:21,365 INFO L226 Difference]: Without dead ends: 3460 [2019-11-24 04:38:21,367 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 04:38:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2019-11-24 04:38:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3435. [2019-11-24 04:38:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-24 04:38:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4954 transitions. [2019-11-24 04:38:21,558 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4954 transitions. Word has length 48 [2019-11-24 04:38:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:21,559 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 4954 transitions. [2019-11-24 04:38:21,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4954 transitions. [2019-11-24 04:38:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:38:21,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:21,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:21,560 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash 41292557, now seen corresponding path program 1 times [2019-11-24 04:38:21,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:21,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121954823] [2019-11-24 04:38:21,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:21,701 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 04:38:21,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121954823] [2019-11-24 04:38:21,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:21,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:38:21,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016367277] [2019-11-24 04:38:21,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:38:21,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:38:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:38:21,704 INFO L87 Difference]: Start difference. First operand 3435 states and 4954 transitions. Second operand 8 states. [2019-11-24 04:38:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:23,379 INFO L93 Difference]: Finished difference Result 10216 states and 14804 transitions. [2019-11-24 04:38:23,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:23,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-24 04:38:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:23,384 INFO L225 Difference]: With dead ends: 10216 [2019-11-24 04:38:23,385 INFO L226 Difference]: Without dead ends: 4367 [2019-11-24 04:38:23,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:38:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2019-11-24 04:38:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 3435. [2019-11-24 04:38:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-24 04:38:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4938 transitions. [2019-11-24 04:38:23,608 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4938 transitions. Word has length 49 [2019-11-24 04:38:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:23,608 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 4938 transitions. [2019-11-24 04:38:23,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:38:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4938 transitions. [2019-11-24 04:38:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:38:23,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:23,610 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, 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 04:38:23,610 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 868485033, now seen corresponding path program 1 times [2019-11-24 04:38:23,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:23,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358076226] [2019-11-24 04:38:23,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY