/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_spec2_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:42:11,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:42:11,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:42:11,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:42:11,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:42:11,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:42:11,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:42:11,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:42:11,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:42:11,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:42:11,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:42:11,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:42:11,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:42:11,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:42:11,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:42:11,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:42:11,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:42:11,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:42:11,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:42:11,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:42:11,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:42:11,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:42:11,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:42:11,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:42:11,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:42:11,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:42:11,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:42:11,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:42:11,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:42:11,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:42:11,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:42:11,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:42:11,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:42:11,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:42:11,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:42:11,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:42:11,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:42:11,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:42:11,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:42:11,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:42:11,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:42:11,876 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:42:11,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:42:11,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:42:11,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:42:11,897 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:42:11,898 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:42:11,898 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:42:11,898 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:42:11,898 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:42:11,898 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:42:11,899 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:42:11,899 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:42:11,899 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:42:11,899 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:42:11,899 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:42:11,900 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:42:11,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:42:11,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:42:11,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:42:11,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:42:11,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:42:11,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:42:11,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:42:11,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:42:11,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:42:11,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:42:11,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:42:11,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:42:11,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:42:11,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:42:11,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:42:11,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:42:11,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:42:11,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:42:11,904 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:42:11,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:42:11,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:42:11,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:42:11,904 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:42:12,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:42:12,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:42:12,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:42:12,228 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:42:12,229 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:42:12,229 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-11-24 04:42:12,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06779627c/b2d4711f0a6b42de821a6e4738a925fe/FLAGdc79ed173 [2019-11-24 04:42:13,025 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:42:13,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-11-24 04:42:13,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06779627c/b2d4711f0a6b42de821a6e4738a925fe/FLAGdc79ed173 [2019-11-24 04:42:13,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06779627c/b2d4711f0a6b42de821a6e4738a925fe [2019-11-24 04:42:13,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:42:13,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:42:13,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:42:13,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:42:13,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:42:13,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:13,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12954213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13, skipping insertion in model container [2019-11-24 04:42:13,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:13,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:42:13,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:42:13,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:42:13,976 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:42:14,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:42:14,220 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:42:14,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14 WrapperNode [2019-11-24 04:42:14,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:42:14,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:42:14,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:42:14,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:42:14,232 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:42:14" (1/1) ... [2019-11-24 04:42:14,285 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:42:14" (1/1) ... [2019-11-24 04:42:14,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:42:14,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:42:14,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:42:14,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:42:14,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (1/1) ... [2019-11-24 04:42:14,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (1/1) ... [2019-11-24 04:42:14,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (1/1) ... [2019-11-24 04:42:14,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (1/1) ... [2019-11-24 04:42:14,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (1/1) ... [2019-11-24 04:42:14,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (1/1) ... [2019-11-24 04:42:14,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (1/1) ... [2019-11-24 04:42:14,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:42:14,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:42:14,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:42:14,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:42:14,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (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:42:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:42:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:42:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:42:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:43:04,278 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:43:04,280 INFO L284 CfgBuilder]: Removed 1125 assume(true) statements. [2019-11-24 04:43:04,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:43:04 BoogieIcfgContainer [2019-11-24 04:43:04,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:43:04,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:43:04,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:43:04,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:43:04,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:42:13" (1/3) ... [2019-11-24 04:43:04,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd5d173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:43:04, skipping insertion in model container [2019-11-24 04:43:04,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:14" (2/3) ... [2019-11-24 04:43:04,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd5d173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:43:04, skipping insertion in model container [2019-11-24 04:43:04,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:43:04" (3/3) ... [2019-11-24 04:43:04,295 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2019-11-24 04:43:04,305 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:43:04,316 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:43:04,328 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:43:04,358 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:43:04,358 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:43:04,358 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:43:04,359 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:43:04,359 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:43:04,359 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:43:04,359 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:43:04,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:43:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states. [2019-11-24 04:43:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:43:04,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:04,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:04,416 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:43:04,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:04,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1018483022, now seen corresponding path program 1 times [2019-11-24 04:43:04,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:04,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959960181] [2019-11-24 04:43:04,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:04,871 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:43:04,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959960181] [2019-11-24 04:43:04,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:04,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:43:04,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186885143] [2019-11-24 04:43:04,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:43:04,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:04,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:43:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:43:04,893 INFO L87 Difference]: Start difference. First operand 1433 states. Second operand 2 states. [2019-11-24 04:43:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:05,252 INFO L93 Difference]: Finished difference Result 1450 states and 2795 transitions. [2019-11-24 04:43:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:43:05,255 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-24 04:43:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:05,296 INFO L225 Difference]: With dead ends: 1450 [2019-11-24 04:43:05,296 INFO L226 Difference]: Without dead ends: 1431 [2019-11-24 04:43:05,302 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:43:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-11-24 04:43:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2019-11-24 04:43:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-11-24 04:43:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2765 transitions. [2019-11-24 04:43:05,448 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2765 transitions. Word has length 12 [2019-11-24 04:43:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:05,448 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 2765 transitions. [2019-11-24 04:43:05,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:43:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2765 transitions. [2019-11-24 04:43:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:43:05,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:05,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:05,457 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:43:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1482243331, now seen corresponding path program 1 times [2019-11-24 04:43:05,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:05,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952410670] [2019-11-24 04:43:05,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:05,656 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:43:05,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952410670] [2019-11-24 04:43:05,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:05,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:05,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344517592] [2019-11-24 04:43:05,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:05,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:05,662 INFO L87 Difference]: Start difference. First operand 1431 states and 2765 transitions. Second operand 3 states. [2019-11-24 04:43:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:06,116 INFO L93 Difference]: Finished difference Result 2520 states and 4862 transitions. [2019-11-24 04:43:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:06,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:43:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:06,132 INFO L225 Difference]: With dead ends: 2520 [2019-11-24 04:43:06,132 INFO L226 Difference]: Without dead ends: 1784 [2019-11-24 04:43:06,137 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:43:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2019-11-24 04:43:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1710. [2019-11-24 04:43:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-24 04:43:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 3301 transitions. [2019-11-24 04:43:06,194 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 3301 transitions. Word has length 13 [2019-11-24 04:43:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:06,195 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 3301 transitions. [2019-11-24 04:43:06,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 3301 transitions. [2019-11-24 04:43:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:43:06,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:06,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:06,197 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:43:06,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:06,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1917598084, now seen corresponding path program 1 times [2019-11-24 04:43:06,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:06,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893645009] [2019-11-24 04:43:06,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:06,284 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:43:06,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893645009] [2019-11-24 04:43:06,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:06,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:06,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964301855] [2019-11-24 04:43:06,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:43:06,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:06,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:43:06,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:43:06,286 INFO L87 Difference]: Start difference. First operand 1710 states and 3301 transitions. Second operand 4 states. [2019-11-24 04:43:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:07,855 INFO L93 Difference]: Finished difference Result 4650 states and 8936 transitions. [2019-11-24 04:43:07,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:43:07,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:43:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:07,892 INFO L225 Difference]: With dead ends: 4650 [2019-11-24 04:43:07,901 INFO L226 Difference]: Without dead ends: 3402 [2019-11-24 04:43:07,906 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:43:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-11-24 04:43:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 2282. [2019-11-24 04:43:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2019-11-24 04:43:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 4259 transitions. [2019-11-24 04:43:08,019 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 4259 transitions. Word has length 15 [2019-11-24 04:43:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:08,019 INFO L462 AbstractCegarLoop]: Abstraction has 2282 states and 4259 transitions. [2019-11-24 04:43:08,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:43:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 4259 transitions. [2019-11-24 04:43:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:43:08,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:08,021 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:43:08,022 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:43:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1080432410, now seen corresponding path program 1 times [2019-11-24 04:43:08,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:08,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905967704] [2019-11-24 04:43:08,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:08,102 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:43:08,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905967704] [2019-11-24 04:43:08,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:08,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:08,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862757705] [2019-11-24 04:43:08,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:08,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:08,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:08,105 INFO L87 Difference]: Start difference. First operand 2282 states and 4259 transitions. Second operand 3 states. [2019-11-24 04:43:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:08,650 INFO L93 Difference]: Finished difference Result 4550 states and 8522 transitions. [2019-11-24 04:43:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:08,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:43:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:08,679 INFO L225 Difference]: With dead ends: 4550 [2019-11-24 04:43:08,679 INFO L226 Difference]: Without dead ends: 3442 [2019-11-24 04:43:08,690 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:43:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2019-11-24 04:43:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 2996. [2019-11-24 04:43:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2996 states. [2019-11-24 04:43:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 5563 transitions. [2019-11-24 04:43:08,844 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 5563 transitions. Word has length 17 [2019-11-24 04:43:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:08,844 INFO L462 AbstractCegarLoop]: Abstraction has 2996 states and 5563 transitions. [2019-11-24 04:43:08,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 5563 transitions. [2019-11-24 04:43:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:43:08,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:08,848 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:43:08,848 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:43:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:08,849 INFO L82 PathProgramCache]: Analyzing trace with hash 866362999, now seen corresponding path program 1 times [2019-11-24 04:43:08,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:08,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318436936] [2019-11-24 04:43:08,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:08,978 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:43:08,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318436936] [2019-11-24 04:43:08,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:08,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:08,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110143665] [2019-11-24 04:43:08,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:08,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:08,982 INFO L87 Difference]: Start difference. First operand 2996 states and 5563 transitions. Second operand 3 states. [2019-11-24 04:43:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:09,439 INFO L93 Difference]: Finished difference Result 4734 states and 8829 transitions. [2019-11-24 04:43:09,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:09,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:43:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:09,457 INFO L225 Difference]: With dead ends: 4734 [2019-11-24 04:43:09,457 INFO L226 Difference]: Without dead ends: 2989 [2019-11-24 04:43:09,464 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:43:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-11-24 04:43:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2989. [2019-11-24 04:43:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-11-24 04:43:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 5546 transitions. [2019-11-24 04:43:09,560 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 5546 transitions. Word has length 18 [2019-11-24 04:43:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:09,561 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 5546 transitions. [2019-11-24 04:43:09,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 5546 transitions. [2019-11-24 04:43:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:43:09,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:09,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:09,563 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:43:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1087478543, now seen corresponding path program 1 times [2019-11-24 04:43:09,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:09,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36341608] [2019-11-24 04:43:09,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:09,640 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:43:09,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36341608] [2019-11-24 04:43:09,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:09,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:09,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793749513] [2019-11-24 04:43:09,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:09,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:09,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:09,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:09,645 INFO L87 Difference]: Start difference. First operand 2989 states and 5546 transitions. Second operand 3 states. [2019-11-24 04:43:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:10,280 INFO L93 Difference]: Finished difference Result 6596 states and 12331 transitions. [2019-11-24 04:43:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:10,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:43:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:10,306 INFO L225 Difference]: With dead ends: 6596 [2019-11-24 04:43:10,307 INFO L226 Difference]: Without dead ends: 4860 [2019-11-24 04:43:10,311 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:43:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2019-11-24 04:43:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4264. [2019-11-24 04:43:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4264 states. [2019-11-24 04:43:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4264 states to 4264 states and 7914 transitions. [2019-11-24 04:43:10,529 INFO L78 Accepts]: Start accepts. Automaton has 4264 states and 7914 transitions. Word has length 19 [2019-11-24 04:43:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:10,530 INFO L462 AbstractCegarLoop]: Abstraction has 4264 states and 7914 transitions. [2019-11-24 04:43:10,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4264 states and 7914 transitions. [2019-11-24 04:43:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:43:10,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:10,540 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:43:10,540 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:43:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:10,541 INFO L82 PathProgramCache]: Analyzing trace with hash -647874176, now seen corresponding path program 1 times [2019-11-24 04:43:10,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:10,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392520446] [2019-11-24 04:43:10,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:10,671 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:43:10,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392520446] [2019-11-24 04:43:10,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:10,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:10,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344477635] [2019-11-24 04:43:10,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:10,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:10,673 INFO L87 Difference]: Start difference. First operand 4264 states and 7914 transitions. Second operand 3 states. [2019-11-24 04:43:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:11,148 INFO L93 Difference]: Finished difference Result 4264 states and 7914 transitions. [2019-11-24 04:43:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:11,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:43:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:11,204 INFO L225 Difference]: With dead ends: 4264 [2019-11-24 04:43:11,204 INFO L226 Difference]: Without dead ends: 4257 [2019-11-24 04:43:11,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:43:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2019-11-24 04:43:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 4257. [2019-11-24 04:43:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4257 states. [2019-11-24 04:43:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 7899 transitions. [2019-11-24 04:43:11,373 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 7899 transitions. Word has length 20 [2019-11-24 04:43:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:11,374 INFO L462 AbstractCegarLoop]: Abstraction has 4257 states and 7899 transitions. [2019-11-24 04:43:11,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 7899 transitions. [2019-11-24 04:43:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:43:11,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:11,378 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] [2019-11-24 04:43:11,379 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:43:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash 323847275, now seen corresponding path program 1 times [2019-11-24 04:43:11,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:11,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54612256] [2019-11-24 04:43:11,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:11,523 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:43:11,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54612256] [2019-11-24 04:43:11,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:11,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:11,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961424095] [2019-11-24 04:43:11,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:43:11,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:43:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:43:11,525 INFO L87 Difference]: Start difference. First operand 4257 states and 7899 transitions. Second operand 4 states. [2019-11-24 04:43:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:11,982 INFO L93 Difference]: Finished difference Result 9433 states and 17407 transitions. [2019-11-24 04:43:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:43:11,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-24 04:43:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:11,997 INFO L225 Difference]: With dead ends: 9433 [2019-11-24 04:43:11,997 INFO L226 Difference]: Without dead ends: 5510 [2019-11-24 04:43:12,004 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:43:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2019-11-24 04:43:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 3843. [2019-11-24 04:43:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3843 states. [2019-11-24 04:43:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 7061 transitions. [2019-11-24 04:43:12,330 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 7061 transitions. Word has length 32 [2019-11-24 04:43:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:12,330 INFO L462 AbstractCegarLoop]: Abstraction has 3843 states and 7061 transitions. [2019-11-24 04:43:12,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:43:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 7061 transitions. [2019-11-24 04:43:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 04:43:12,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:12,334 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] [2019-11-24 04:43:12,335 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:43:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash 180901868, now seen corresponding path program 1 times [2019-11-24 04:43:12,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:12,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558952997] [2019-11-24 04:43:12,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:12,585 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:43:12,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558952997] [2019-11-24 04:43:12,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:12,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:43:12,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623673032] [2019-11-24 04:43:12,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:43:12,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:12,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:43:12,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:43:12,587 INFO L87 Difference]: Start difference. First operand 3843 states and 7061 transitions. Second operand 4 states. [2019-11-24 04:43:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:14,381 INFO L93 Difference]: Finished difference Result 7811 states and 14388 transitions. [2019-11-24 04:43:14,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:43:14,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-24 04:43:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:14,395 INFO L225 Difference]: With dead ends: 7811 [2019-11-24 04:43:14,395 INFO L226 Difference]: Without dead ends: 4167 [2019-11-24 04:43:14,402 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:43:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2019-11-24 04:43:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 3843. [2019-11-24 04:43:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3843 states. [2019-11-24 04:43:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 6961 transitions. [2019-11-24 04:43:14,607 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 6961 transitions. Word has length 33 [2019-11-24 04:43:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:14,610 INFO L462 AbstractCegarLoop]: Abstraction has 3843 states and 6961 transitions. [2019-11-24 04:43:14,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:43:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 6961 transitions. [2019-11-24 04:43:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:43:14,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:14,615 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:43:14,615 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:43:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash -514870349, now seen corresponding path program 1 times [2019-11-24 04:43:14,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:14,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362245979] [2019-11-24 04:43:14,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:14,942 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:43:14,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362245979] [2019-11-24 04:43:14,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:14,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:14,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790907831] [2019-11-24 04:43:14,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:14,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:14,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:14,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:14,945 INFO L87 Difference]: Start difference. First operand 3843 states and 6961 transitions. Second operand 3 states. [2019-11-24 04:43:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:16,455 INFO L93 Difference]: Finished difference Result 10255 states and 18615 transitions. [2019-11-24 04:43:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:16,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 04:43:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:16,474 INFO L225 Difference]: With dead ends: 10255 [2019-11-24 04:43:16,474 INFO L226 Difference]: Without dead ends: 6632 [2019-11-24 04:43:16,481 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:43:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6632 states. [2019-11-24 04:43:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6632 to 3783. [2019-11-24 04:43:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3783 states. [2019-11-24 04:43:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3783 states and 6801 transitions. [2019-11-24 04:43:16,673 INFO L78 Accepts]: Start accepts. Automaton has 3783 states and 6801 transitions. Word has length 38 [2019-11-24 04:43:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:16,674 INFO L462 AbstractCegarLoop]: Abstraction has 3783 states and 6801 transitions. [2019-11-24 04:43:16,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 6801 transitions. [2019-11-24 04:43:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:43:16,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:16,678 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:43:16,678 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:43:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash 163279329, now seen corresponding path program 1 times [2019-11-24 04:43:16,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:16,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551364911] [2019-11-24 04:43:16,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:17,047 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:43:17,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551364911] [2019-11-24 04:43:17,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:17,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:17,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655361040] [2019-11-24 04:43:17,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:17,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:17,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:17,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:17,051 INFO L87 Difference]: Start difference. First operand 3783 states and 6801 transitions. Second operand 3 states. [2019-11-24 04:43:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:18,556 INFO L93 Difference]: Finished difference Result 10124 states and 18294 transitions. [2019-11-24 04:43:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:18,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:43:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:18,574 INFO L225 Difference]: With dead ends: 10124 [2019-11-24 04:43:18,574 INFO L226 Difference]: Without dead ends: 6588 [2019-11-24 04:43:18,580 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:43:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2019-11-24 04:43:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 3743. [2019-11-24 04:43:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-24 04:43:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 6661 transitions. [2019-11-24 04:43:18,793 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 6661 transitions. Word has length 39 [2019-11-24 04:43:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:18,797 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 6661 transitions. [2019-11-24 04:43:18,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 6661 transitions. [2019-11-24 04:43:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:43:18,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:18,800 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:43:18,800 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:43:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1708803140, now seen corresponding path program 1 times [2019-11-24 04:43:18,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:18,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711750220] [2019-11-24 04:43:18,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:19,034 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:43:19,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711750220] [2019-11-24 04:43:19,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:19,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:19,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185594356] [2019-11-24 04:43:19,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:19,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:19,037 INFO L87 Difference]: Start difference. First operand 3743 states and 6661 transitions. Second operand 3 states. [2019-11-24 04:43:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:20,376 INFO L93 Difference]: Finished difference Result 10028 states and 18008 transitions. [2019-11-24 04:43:20,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:20,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:43:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:20,393 INFO L225 Difference]: With dead ends: 10028 [2019-11-24 04:43:20,393 INFO L226 Difference]: Without dead ends: 6564 [2019-11-24 04:43:20,400 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:43:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2019-11-24 04:43:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 3723. [2019-11-24 04:43:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3723 states. [2019-11-24 04:43:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 6541 transitions. [2019-11-24 04:43:20,605 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 6541 transitions. Word has length 41 [2019-11-24 04:43:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:20,605 INFO L462 AbstractCegarLoop]: Abstraction has 3723 states and 6541 transitions. [2019-11-24 04:43:20,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 6541 transitions. [2019-11-24 04:43:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:43:20,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:20,609 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:43:20,609 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:43:20,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:20,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1723933867, now seen corresponding path program 1 times [2019-11-24 04:43:20,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:20,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683540162] [2019-11-24 04:43:20,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:20,837 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:43:20,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683540162] [2019-11-24 04:43:20,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:20,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:20,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746478281] [2019-11-24 04:43:20,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:20,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:20,839 INFO L87 Difference]: Start difference. First operand 3723 states and 6541 transitions. Second operand 3 states. [2019-11-24 04:43:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:22,256 INFO L93 Difference]: Finished difference Result 7454 states and 13191 transitions. [2019-11-24 04:43:22,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:22,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-24 04:43:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:22,269 INFO L225 Difference]: With dead ends: 7454 [2019-11-24 04:43:22,270 INFO L226 Difference]: Without dead ends: 4047 [2019-11-24 04:43:22,275 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:43:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2019-11-24 04:43:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 3723. [2019-11-24 04:43:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3723 states. [2019-11-24 04:43:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 6441 transitions. [2019-11-24 04:43:22,579 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 6441 transitions. Word has length 44 [2019-11-24 04:43:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:22,580 INFO L462 AbstractCegarLoop]: Abstraction has 3723 states and 6441 transitions. [2019-11-24 04:43:22,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 6441 transitions. [2019-11-24 04:43:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:43:22,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:22,585 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] [2019-11-24 04:43:22,585 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:43:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1485955621, now seen corresponding path program 1 times [2019-11-24 04:43:22,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:22,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757712740] [2019-11-24 04:43:22,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:22,966 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:43:22,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757712740] [2019-11-24 04:43:22,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:22,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:43:22,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105869346] [2019-11-24 04:43:22,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:22,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:22,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:22,970 INFO L87 Difference]: Start difference. First operand 3723 states and 6441 transitions. Second operand 5 states. [2019-11-24 04:43:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:25,077 INFO L93 Difference]: Finished difference Result 12524 states and 22320 transitions. [2019-11-24 04:43:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:43:25,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-24 04:43:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:25,094 INFO L225 Difference]: With dead ends: 12524 [2019-11-24 04:43:25,094 INFO L226 Difference]: Without dead ends: 8934 [2019-11-24 04:43:25,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:43:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2019-11-24 04:43:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 3427. [2019-11-24 04:43:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-11-24 04:43:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 5997 transitions. [2019-11-24 04:43:25,379 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 5997 transitions. Word has length 47 [2019-11-24 04:43:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:25,379 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 5997 transitions. [2019-11-24 04:43:25,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 5997 transitions. [2019-11-24 04:43:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:43:25,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:25,382 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:43:25,382 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:43:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash -250304245, now seen corresponding path program 1 times [2019-11-24 04:43:25,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:25,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288895943] [2019-11-24 04:43:25,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:25,669 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:43:25,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288895943] [2019-11-24 04:43:25,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:25,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:43:25,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518981504] [2019-11-24 04:43:25,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 04:43:25,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:25,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 04:43:25,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:43:25,671 INFO L87 Difference]: Start difference. First operand 3427 states and 5997 transitions. Second operand 10 states.