/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_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:41:12,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:41:12,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:41:12,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:41:12,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:41:12,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:41:12,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:41:12,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:41:12,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:41:12,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:41:12,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:41:12,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:41:12,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:41:12,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:41:12,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:41:12,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:41:12,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:41:12,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:41:12,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:41:12,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:41:12,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:41:12,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:41:12,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:41:12,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:41:12,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:41:12,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:41:12,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:41:12,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:41:12,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:41:12,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:41:12,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:41:12,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:41:12,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:41:12,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:41:12,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:41:12,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:41:12,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:41:12,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:41:12,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:41:12,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:41:12,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:41:12,460 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:41:12,480 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:41:12,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:41:12,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:41:12,481 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:41:12,482 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:41:12,482 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:41:12,482 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:41:12,482 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:41:12,482 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:41:12,483 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:41:12,484 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:41:12,484 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:41:12,484 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:41:12,485 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:41:12,485 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:41:12,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:41:12,486 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:41:12,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:41:12,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:41:12,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:41:12,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:41:12,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:41:12,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:41:12,488 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:41:12,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:41:12,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:41:12,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:41:12,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:41:12,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:41:12,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:41:12,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:41:12,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:41:12,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:41:12,491 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:41:12,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:41:12,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:41:12,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:41:12,492 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:41:12,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:41:12,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:41:12,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:41:12,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:41:12,808 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:41:12,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-11-24 04:41:12,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837754c62/5f624b9f055848cca9e0939757a88a67/FLAG0b5caa349 [2019-11-24 04:41:13,462 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:41:13,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-11-24 04:41:13,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837754c62/5f624b9f055848cca9e0939757a88a67/FLAG0b5caa349 [2019-11-24 04:41:13,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837754c62/5f624b9f055848cca9e0939757a88a67 [2019-11-24 04:41:13,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:41:13,710 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:41:13,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:41:13,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:41:13,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:41:13,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:41:13" (1/1) ... [2019-11-24 04:41:13,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c0e2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:13, skipping insertion in model container [2019-11-24 04:41:13,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:41:13" (1/1) ... [2019-11-24 04:41:13,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:41:13,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:41:14,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:41:14,545 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:41:14,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:41:14,699 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:41:14,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14 WrapperNode [2019-11-24 04:41:14,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:41:14,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:41:14,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:41:14,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:41:14,710 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:41:14" (1/1) ... [2019-11-24 04:41:14,749 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:41:14" (1/1) ... [2019-11-24 04:41:14,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:41:14,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:41:14,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:41:14,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:41:14,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14" (1/1) ... [2019-11-24 04:41:14,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14" (1/1) ... [2019-11-24 04:41:15,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14" (1/1) ... [2019-11-24 04:41:15,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14" (1/1) ... [2019-11-24 04:41:15,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14" (1/1) ... [2019-11-24 04:41:15,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14" (1/1) ... [2019-11-24 04:41:15,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14" (1/1) ... [2019-11-24 04:41:15,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:41:15,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:41:15,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:41:15,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:41:15,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41: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:41:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:41:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:41:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:41:15,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:41:48,639 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:41:48,639 INFO L284 CfgBuilder]: Removed 773 assume(true) statements. [2019-11-24 04:41:48,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:48 BoogieIcfgContainer [2019-11-24 04:41:48,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:41:48,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:41:48,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:41:48,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:41:48,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:41:13" (1/3) ... [2019-11-24 04:41:48,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b1f53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:48, skipping insertion in model container [2019-11-24 04:41:48,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:14" (2/3) ... [2019-11-24 04:41:48,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b1f53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:48, skipping insertion in model container [2019-11-24 04:41:48,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:48" (3/3) ... [2019-11-24 04:41:48,649 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2019-11-24 04:41:48,657 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:41:48,666 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:41:48,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:41:48,714 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:41:48,715 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:41:48,715 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:41:48,715 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:41:48,715 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:41:48,715 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:41:48,716 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:41:48,716 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:41:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states. [2019-11-24 04:41:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:41:48,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:48,768 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:41:48,768 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:41:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1295127298, now seen corresponding path program 1 times [2019-11-24 04:41:48,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:48,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231518806] [2019-11-24 04:41:48,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:49,328 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:41:49,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231518806] [2019-11-24 04:41:49,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:49,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:49,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280403476] [2019-11-24 04:41:49,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:49,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:49,357 INFO L87 Difference]: Start difference. First operand 1233 states. Second operand 5 states. [2019-11-24 04:41:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:50,143 INFO L93 Difference]: Finished difference Result 2259 states and 4301 transitions. [2019-11-24 04:41:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:41:50,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:41:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:50,189 INFO L225 Difference]: With dead ends: 2259 [2019-11-24 04:41:50,189 INFO L226 Difference]: Without dead ends: 1610 [2019-11-24 04:41:50,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:41:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-11-24 04:41:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1241. [2019-11-24 04:41:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-11-24 04:41:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2383 transitions. [2019-11-24 04:41:50,342 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2383 transitions. Word has length 17 [2019-11-24 04:41:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:50,343 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2383 transitions. [2019-11-24 04:41:50,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2383 transitions. [2019-11-24 04:41:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:41:50,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:50,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:50,352 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:41:50,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1787214054, now seen corresponding path program 1 times [2019-11-24 04:41:50,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:50,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924311454] [2019-11-24 04:41:50,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:50,554 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:41:50,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924311454] [2019-11-24 04:41:50,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:50,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:41:50,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443700436] [2019-11-24 04:41:50,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:50,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:50,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:50,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:50,558 INFO L87 Difference]: Start difference. First operand 1241 states and 2383 transitions. Second operand 3 states. [2019-11-24 04:41:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:51,621 INFO L93 Difference]: Finished difference Result 2498 states and 4769 transitions. [2019-11-24 04:41:51,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:51,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:41:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:51,631 INFO L225 Difference]: With dead ends: 2498 [2019-11-24 04:41:51,632 INFO L226 Difference]: Without dead ends: 1501 [2019-11-24 04:41:51,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:41:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-24 04:41:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1473. [2019-11-24 04:41:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-11-24 04:41:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2702 transitions. [2019-11-24 04:41:51,679 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2702 transitions. Word has length 21 [2019-11-24 04:41:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:51,679 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 2702 transitions. [2019-11-24 04:41:51,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2702 transitions. [2019-11-24 04:41:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:41:51,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:51,681 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] [2019-11-24 04:41:51,682 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:41:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1072214241, now seen corresponding path program 1 times [2019-11-24 04:41:51,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:51,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217752153] [2019-11-24 04:41:51,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:51,823 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:41:51,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217752153] [2019-11-24 04:41:51,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:51,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:51,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47112634] [2019-11-24 04:41:51,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:51,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:51,825 INFO L87 Difference]: Start difference. First operand 1473 states and 2702 transitions. Second operand 3 states. [2019-11-24 04:41:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:52,092 INFO L93 Difference]: Finished difference Result 2852 states and 5256 transitions. [2019-11-24 04:41:52,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:52,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:41:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:52,107 INFO L225 Difference]: With dead ends: 2852 [2019-11-24 04:41:52,107 INFO L226 Difference]: Without dead ends: 2132 [2019-11-24 04:41:52,110 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:41:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-24 04:41:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2058. [2019-11-24 04:41:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-11-24 04:41:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 3763 transitions. [2019-11-24 04:41:52,176 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 3763 transitions. Word has length 23 [2019-11-24 04:41:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:52,176 INFO L462 AbstractCegarLoop]: Abstraction has 2058 states and 3763 transitions. [2019-11-24 04:41:52,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 3763 transitions. [2019-11-24 04:41:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:41:52,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:52,178 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:41:52,179 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:41:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:52,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1877503969, now seen corresponding path program 1 times [2019-11-24 04:41:52,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:52,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976776355] [2019-11-24 04:41:52,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:52,303 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:41:52,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976776355] [2019-11-24 04:41:52,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:52,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:52,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132882135] [2019-11-24 04:41:52,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:52,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:52,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:52,306 INFO L87 Difference]: Start difference. First operand 2058 states and 3763 transitions. Second operand 3 states. [2019-11-24 04:41:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:52,701 INFO L93 Difference]: Finished difference Result 4629 states and 8516 transitions. [2019-11-24 04:41:52,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:52,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:41:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:52,720 INFO L225 Difference]: With dead ends: 4629 [2019-11-24 04:41:52,720 INFO L226 Difference]: Without dead ends: 3441 [2019-11-24 04:41:52,724 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:41:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2019-11-24 04:41:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3217. [2019-11-24 04:41:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-11-24 04:41:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 5863 transitions. [2019-11-24 04:41:52,835 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 5863 transitions. Word has length 25 [2019-11-24 04:41:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:52,835 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 5863 transitions. [2019-11-24 04:41:52,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 5863 transitions. [2019-11-24 04:41:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:41:52,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:52,838 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] [2019-11-24 04:41:52,838 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:41:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1742246840, now seen corresponding path program 1 times [2019-11-24 04:41:52,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:52,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166494267] [2019-11-24 04:41:52,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:52,944 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:41:52,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166494267] [2019-11-24 04:41:52,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:52,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:52,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664160493] [2019-11-24 04:41:52,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:52,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:52,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:52,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:52,947 INFO L87 Difference]: Start difference. First operand 3217 states and 5863 transitions. Second operand 3 states. [2019-11-24 04:41:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:53,445 INFO L93 Difference]: Finished difference Result 5989 states and 10936 transitions. [2019-11-24 04:41:53,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:53,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 04:41:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:53,469 INFO L225 Difference]: With dead ends: 5989 [2019-11-24 04:41:53,469 INFO L226 Difference]: Without dead ends: 3202 [2019-11-24 04:41:53,474 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:41:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2019-11-24 04:41:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3202. [2019-11-24 04:41:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3202 states. [2019-11-24 04:41:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 5822 transitions. [2019-11-24 04:41:53,593 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 5822 transitions. Word has length 27 [2019-11-24 04:41:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:53,593 INFO L462 AbstractCegarLoop]: Abstraction has 3202 states and 5822 transitions. [2019-11-24 04:41:53,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 5822 transitions. [2019-11-24 04:41:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:41:53,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:53,595 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:41:53,596 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:41:53,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:53,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2104535566, now seen corresponding path program 1 times [2019-11-24 04:41:53,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:53,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191267831] [2019-11-24 04:41:53,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:53,694 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:41:53,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191267831] [2019-11-24 04:41:53,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:53,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:53,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119732255] [2019-11-24 04:41:53,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:53,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:53,697 INFO L87 Difference]: Start difference. First operand 3202 states and 5822 transitions. Second operand 3 states. [2019-11-24 04:41:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:54,175 INFO L93 Difference]: Finished difference Result 7887 states and 14439 transitions. [2019-11-24 04:41:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:54,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 04:41:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:54,217 INFO L225 Difference]: With dead ends: 7887 [2019-11-24 04:41:54,217 INFO L226 Difference]: Without dead ends: 5769 [2019-11-24 04:41:54,224 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:41:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-11-24 04:41:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5469. [2019-11-24 04:41:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-11-24 04:41:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 9914 transitions. [2019-11-24 04:41:54,468 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 9914 transitions. Word has length 28 [2019-11-24 04:41:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:54,469 INFO L462 AbstractCegarLoop]: Abstraction has 5469 states and 9914 transitions. [2019-11-24 04:41:54,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 9914 transitions. [2019-11-24 04:41:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:41:54,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:54,477 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] [2019-11-24 04:41:54,480 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:41:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash -816070479, now seen corresponding path program 1 times [2019-11-24 04:41:54,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:54,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134073151] [2019-11-24 04:41:54,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:54,589 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:41:54,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134073151] [2019-11-24 04:41:54,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:54,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:54,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743183255] [2019-11-24 04:41:54,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:54,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:54,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:54,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:54,591 INFO L87 Difference]: Start difference. First operand 5469 states and 9914 transitions. Second operand 3 states. [2019-11-24 04:41:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:54,887 INFO L93 Difference]: Finished difference Result 5469 states and 9914 transitions. [2019-11-24 04:41:54,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:54,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 04:41:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:54,916 INFO L225 Difference]: With dead ends: 5469 [2019-11-24 04:41:54,916 INFO L226 Difference]: Without dead ends: 5462 [2019-11-24 04:41:54,919 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:41:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2019-11-24 04:41:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 5462. [2019-11-24 04:41:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5462 states. [2019-11-24 04:41:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 9899 transitions. [2019-11-24 04:41:55,099 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 9899 transitions. Word has length 29 [2019-11-24 04:41:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:55,099 INFO L462 AbstractCegarLoop]: Abstraction has 5462 states and 9899 transitions. [2019-11-24 04:41:55,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 9899 transitions. [2019-11-24 04:41:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:41:55,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:55,101 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] [2019-11-24 04:41:55,102 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:41:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1504850923, now seen corresponding path program 1 times [2019-11-24 04:41:55,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:55,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905887524] [2019-11-24 04:41:55,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:55,290 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:41:55,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905887524] [2019-11-24 04:41:55,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:55,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:55,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235671557] [2019-11-24 04:41:55,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:55,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:55,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:55,293 INFO L87 Difference]: Start difference. First operand 5462 states and 9899 transitions. Second operand 3 states. [2019-11-24 04:41:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:56,677 INFO L93 Difference]: Finished difference Result 15235 states and 27594 transitions. [2019-11-24 04:41:56,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:56,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 04:41:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:56,705 INFO L225 Difference]: With dead ends: 15235 [2019-11-24 04:41:56,705 INFO L226 Difference]: Without dead ends: 10019 [2019-11-24 04:41:56,714 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:41:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10019 states. [2019-11-24 04:41:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10019 to 5402. [2019-11-24 04:41:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5402 states. [2019-11-24 04:41:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 9749 transitions. [2019-11-24 04:41:56,962 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 9749 transitions. Word has length 31 [2019-11-24 04:41:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:56,963 INFO L462 AbstractCegarLoop]: Abstraction has 5402 states and 9749 transitions. [2019-11-24 04:41:56,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 9749 transitions. [2019-11-24 04:41:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:41:56,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:56,965 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:41:56,965 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:41:56,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1286285462, now seen corresponding path program 1 times [2019-11-24 04:41:56,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:56,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431177286] [2019-11-24 04:41:56,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:57,139 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:41:57,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431177286] [2019-11-24 04:41:57,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:57,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:57,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989321032] [2019-11-24 04:41:57,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:57,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:57,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:57,141 INFO L87 Difference]: Start difference. First operand 5402 states and 9749 transitions. Second operand 3 states. [2019-11-24 04:41:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:58,294 INFO L93 Difference]: Finished difference Result 15105 states and 27289 transitions. [2019-11-24 04:41:58,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:58,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:41:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:58,317 INFO L225 Difference]: With dead ends: 15105 [2019-11-24 04:41:58,317 INFO L226 Difference]: Without dead ends: 9971 [2019-11-24 04:41:58,327 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:41:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9971 states. [2019-11-24 04:41:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9971 to 5357. [2019-11-24 04:41:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5357 states. [2019-11-24 04:41:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 9614 transitions. [2019-11-24 04:41:58,600 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 9614 transitions. Word has length 32 [2019-11-24 04:41:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:58,600 INFO L462 AbstractCegarLoop]: Abstraction has 5357 states and 9614 transitions. [2019-11-24 04:41:58,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 9614 transitions. [2019-11-24 04:41:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:41:58,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:58,605 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] [2019-11-24 04:41:58,605 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:41:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash -253516145, now seen corresponding path program 1 times [2019-11-24 04:41:58,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:58,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036916401] [2019-11-24 04:41:58,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:58,924 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:41:58,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036916401] [2019-11-24 04:41:58,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:58,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:58,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008272146] [2019-11-24 04:41:58,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:58,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:58,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:58,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:58,927 INFO L87 Difference]: Start difference. First operand 5357 states and 9614 transitions. Second operand 3 states. [2019-11-24 04:42:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:01,134 INFO L93 Difference]: Finished difference Result 15000 states and 27009 transitions. [2019-11-24 04:42:01,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:01,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:42:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:01,156 INFO L225 Difference]: With dead ends: 15000 [2019-11-24 04:42:01,157 INFO L226 Difference]: Without dead ends: 9938 [2019-11-24 04:42:01,166 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:42:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9938 states. [2019-11-24 04:42:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9938 to 5327. [2019-11-24 04:42:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5327 states. [2019-11-24 04:42:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5327 states to 5327 states and 9494 transitions. [2019-11-24 04:42:01,446 INFO L78 Accepts]: Start accepts. Automaton has 5327 states and 9494 transitions. Word has length 34 [2019-11-24 04:42:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:01,447 INFO L462 AbstractCegarLoop]: Abstraction has 5327 states and 9494 transitions. [2019-11-24 04:42:01,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5327 states and 9494 transitions. [2019-11-24 04:42:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:42:01,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:01,449 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] [2019-11-24 04:42:01,449 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:42:01,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash 201222879, now seen corresponding path program 1 times [2019-11-24 04:42:01,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:01,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798288901] [2019-11-24 04:42:01,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:01,663 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:42:01,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798288901] [2019-11-24 04:42:01,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:01,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:01,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974660572] [2019-11-24 04:42:01,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:01,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:01,665 INFO L87 Difference]: Start difference. First operand 5327 states and 9494 transitions. Second operand 3 states. [2019-11-24 04:42:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:03,020 INFO L93 Difference]: Finished difference Result 14920 states and 26754 transitions. [2019-11-24 04:42:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:03,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:42:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:03,041 INFO L225 Difference]: With dead ends: 14920 [2019-11-24 04:42:03,041 INFO L226 Difference]: Without dead ends: 9920 [2019-11-24 04:42:03,051 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:42:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9920 states. [2019-11-24 04:42:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9920 to 5312. [2019-11-24 04:42:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5312 states. [2019-11-24 04:42:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 9389 transitions. [2019-11-24 04:42:03,467 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 9389 transitions. Word has length 37 [2019-11-24 04:42:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:03,468 INFO L462 AbstractCegarLoop]: Abstraction has 5312 states and 9389 transitions. [2019-11-24 04:42:03,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 9389 transitions. [2019-11-24 04:42:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:42:03,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:03,471 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:42:03,471 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:42:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash -681827159, now seen corresponding path program 1 times [2019-11-24 04:42:03,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:03,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385800470] [2019-11-24 04:42:03,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:03,668 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:42:03,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385800470] [2019-11-24 04:42:03,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:03,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:03,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247865175] [2019-11-24 04:42:03,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:03,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:03,670 INFO L87 Difference]: Start difference. First operand 5312 states and 9389 transitions. Second operand 3 states. [2019-11-24 04:42:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:04,454 INFO L93 Difference]: Finished difference Result 10730 states and 19084 transitions. [2019-11-24 04:42:04,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:04,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:42:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:04,464 INFO L225 Difference]: With dead ends: 10730 [2019-11-24 04:42:04,464 INFO L226 Difference]: Without dead ends: 5782 [2019-11-24 04:42:04,473 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:42:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2019-11-24 04:42:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 5312. [2019-11-24 04:42:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5312 states. [2019-11-24 04:42:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 9299 transitions. [2019-11-24 04:42:04,739 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 9299 transitions. Word has length 41 [2019-11-24 04:42:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:04,740 INFO L462 AbstractCegarLoop]: Abstraction has 5312 states and 9299 transitions. [2019-11-24 04:42:04,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 9299 transitions. [2019-11-24 04:42:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:42:04,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:04,743 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] [2019-11-24 04:42:04,743 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:42:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1731538948, now seen corresponding path program 1 times [2019-11-24 04:42:04,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:04,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127050983] [2019-11-24 04:42:04,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:05,048 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:42:05,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127050983] [2019-11-24 04:42:05,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:05,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:42:05,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845880720] [2019-11-24 04:42:05,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:05,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:05,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:05,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:05,050 INFO L87 Difference]: Start difference. First operand 5312 states and 9299 transitions. Second operand 5 states. [2019-11-24 04:42:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:07,317 INFO L93 Difference]: Finished difference Result 18026 states and 32364 transitions. [2019-11-24 04:42:07,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:42:07,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:42:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:07,334 INFO L225 Difference]: With dead ends: 18026 [2019-11-24 04:42:07,335 INFO L226 Difference]: Without dead ends: 12915 [2019-11-24 04:42:07,341 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:42:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12915 states. [2019-11-24 04:42:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12915 to 5046. [2019-11-24 04:42:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2019-11-24 04:42:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 8925 transitions. [2019-11-24 04:42:07,678 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 8925 transitions. Word has length 45 [2019-11-24 04:42:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:07,678 INFO L462 AbstractCegarLoop]: Abstraction has 5046 states and 8925 transitions. [2019-11-24 04:42:07,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 8925 transitions. [2019-11-24 04:42:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:42:07,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:07,681 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] [2019-11-24 04:42:07,681 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:42:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1593297214, now seen corresponding path program 1 times [2019-11-24 04:42:07,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:07,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451295885] [2019-11-24 04:42:07,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:08,445 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:42:08,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451295885] [2019-11-24 04:42:08,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:08,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:42:08,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889648463] [2019-11-24 04:42:08,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:42:08,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:42:08,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:42:08,447 INFO L87 Difference]: Start difference. First operand 5046 states and 8925 transitions. Second operand 22 states. [2019-11-24 04:42:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:11,384 INFO L93 Difference]: Finished difference Result 15624 states and 28107 transitions. [2019-11-24 04:42:11,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:42:11,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-11-24 04:42:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:11,396 INFO L225 Difference]: With dead ends: 15624 [2019-11-24 04:42:11,396 INFO L226 Difference]: Without dead ends: 10831 [2019-11-24 04:42:11,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:42:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10831 states. [2019-11-24 04:42:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10831 to 4749. [2019-11-24 04:42:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4749 states. [2019-11-24 04:42:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 8419 transitions. [2019-11-24 04:42:11,886 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 8419 transitions. Word has length 46 [2019-11-24 04:42:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:11,887 INFO L462 AbstractCegarLoop]: Abstraction has 4749 states and 8419 transitions. [2019-11-24 04:42:11,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:42:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 8419 transitions. [2019-11-24 04:42:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:42:11,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:11,890 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:42:11,891 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:42:11,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2095834692, now seen corresponding path program 1 times [2019-11-24 04:42:11,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:11,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138261808] [2019-11-24 04:42:11,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:12,651 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:42:12,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138261808] [2019-11-24 04:42:12,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:12,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:42:12,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017305036] [2019-11-24 04:42:12,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:42:12,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:42:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:42:12,653 INFO L87 Difference]: Start difference. First operand 4749 states and 8419 transitions. Second operand 22 states. [2019-11-24 04:42:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:15,408 INFO L93 Difference]: Finished difference Result 15158 states and 27269 transitions. [2019-11-24 04:42:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:42:15,408 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-24 04:42:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:15,418 INFO L225 Difference]: With dead ends: 15158 [2019-11-24 04:42:15,418 INFO L226 Difference]: Without dead ends: 10653 [2019-11-24 04:42:15,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:42:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10653 states. [2019-11-24 04:42:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10653 to 4777. [2019-11-24 04:42:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4777 states. [2019-11-24 04:42:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 8385 transitions. [2019-11-24 04:42:15,869 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 8385 transitions. Word has length 47 [2019-11-24 04:42:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:15,869 INFO L462 AbstractCegarLoop]: Abstraction has 4777 states and 8385 transitions. [2019-11-24 04:42:15,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:42:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 8385 transitions. [2019-11-24 04:42:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:42:15,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:15,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:15,872 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:42:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:15,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1094169517, now seen corresponding path program 1 times [2019-11-24 04:42:15,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:15,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449894509] [2019-11-24 04:42:15,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:16,568 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:42:16,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449894509] [2019-11-24 04:42:16,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:16,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:42:16,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664158762] [2019-11-24 04:42:16,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:42:16,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:16,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:42:16,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:42:16,571 INFO L87 Difference]: Start difference. First operand 4777 states and 8385 transitions. Second operand 22 states. [2019-11-24 04:42:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:19,056 INFO L93 Difference]: Finished difference Result 13589 states and 24027 transitions. [2019-11-24 04:42:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:42:19,056 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2019-11-24 04:42:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:19,065 INFO L225 Difference]: With dead ends: 13589 [2019-11-24 04:42:19,065 INFO L226 Difference]: Without dead ends: 9051 [2019-11-24 04:42:19,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:42:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2019-11-24 04:42:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 5018. [2019-11-24 04:42:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5018 states. [2019-11-24 04:42:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 8699 transitions. [2019-11-24 04:42:19,517 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 8699 transitions. Word has length 50 [2019-11-24 04:42:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:19,518 INFO L462 AbstractCegarLoop]: Abstraction has 5018 states and 8699 transitions. [2019-11-24 04:42:19,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:42:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 8699 transitions. [2019-11-24 04:42:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 04:42:19,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:19,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:19,521 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:42:19,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:19,522 INFO L82 PathProgramCache]: Analyzing trace with hash -784327587, now seen corresponding path program 1 times [2019-11-24 04:42:19,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:19,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772390762] [2019-11-24 04:42:19,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:19,684 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:42:19,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772390762] [2019-11-24 04:42:19,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:19,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:19,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797589209] [2019-11-24 04:42:19,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:19,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:19,686 INFO L87 Difference]: Start difference. First operand 5018 states and 8699 transitions. Second operand 5 states. [2019-11-24 04:42:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:21,225 INFO L93 Difference]: Finished difference Result 13971 states and 24805 transitions. [2019-11-24 04:42:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:42:21,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-24 04:42:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:21,235 INFO L225 Difference]: With dead ends: 13971 [2019-11-24 04:42:21,235 INFO L226 Difference]: Without dead ends: 9340 [2019-11-24 04:42:21,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:42:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2019-11-24 04:42:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 5099. [2019-11-24 04:42:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5099 states. [2019-11-24 04:42:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 8780 transitions. [2019-11-24 04:42:21,703 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 8780 transitions. Word has length 70 [2019-11-24 04:42:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:21,704 INFO L462 AbstractCegarLoop]: Abstraction has 5099 states and 8780 transitions. [2019-11-24 04:42:21,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 8780 transitions. [2019-11-24 04:42:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 04:42:21,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:21,707 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, 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:42:21,707 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:42:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 817093208, now seen corresponding path program 1 times [2019-11-24 04:42:21,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:21,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409343184] [2019-11-24 04:42:21,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:21,904 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:42:21,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409343184] [2019-11-24 04:42:21,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:21,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:21,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927028674] [2019-11-24 04:42:21,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:21,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:21,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:21,908 INFO L87 Difference]: Start difference. First operand 5099 states and 8780 transitions. Second operand 5 states. [2019-11-24 04:42:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:23,871 INFO L93 Difference]: Finished difference Result 14052 states and 24846 transitions. [2019-11-24 04:42:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:42:23,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-24 04:42:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:23,882 INFO L225 Difference]: With dead ends: 14052 [2019-11-24 04:42:23,883 INFO L226 Difference]: Without dead ends: 9340 [2019-11-24 04:42:23,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:42:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2019-11-24 04:42:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 5099. [2019-11-24 04:42:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5099 states. [2019-11-24 04:42:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 8740 transitions. [2019-11-24 04:42:24,364 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 8740 transitions. Word has length 71 [2019-11-24 04:42:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:24,364 INFO L462 AbstractCegarLoop]: Abstraction has 5099 states and 8740 transitions. [2019-11-24 04:42:24,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 8740 transitions. [2019-11-24 04:42:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 04:42:24,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:24,366 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, 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:42:24,366 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:42:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash -936268479, now seen corresponding path program 1 times [2019-11-24 04:42:24,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:24,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969322660] [2019-11-24 04:42:24,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:24,596 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:42:24,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969322660] [2019-11-24 04:42:24,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:24,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:24,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813371152] [2019-11-24 04:42:24,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:24,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:24,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:24,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:24,599 INFO L87 Difference]: Start difference. First operand 5099 states and 8740 transitions. Second operand 5 states. [2019-11-24 04:42:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:26,353 INFO L93 Difference]: Finished difference Result 14112 states and 24847 transitions. [2019-11-24 04:42:26,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:42:26,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-24 04:42:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:26,366 INFO L225 Difference]: With dead ends: 14112 [2019-11-24 04:42:26,366 INFO L226 Difference]: Without dead ends: 9400 [2019-11-24 04:42:26,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:42:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2019-11-24 04:42:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 5091. [2019-11-24 04:42:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2019-11-24 04:42:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 8729 transitions. [2019-11-24 04:42:26,994 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 8729 transitions. Word has length 72 [2019-11-24 04:42:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:26,994 INFO L462 AbstractCegarLoop]: Abstraction has 5091 states and 8729 transitions. [2019-11-24 04:42:26,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 8729 transitions. [2019-11-24 04:42:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 04:42:26,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:26,996 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, 1, 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:42:26,996 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:42:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash -680939787, now seen corresponding path program 1 times [2019-11-24 04:42:26,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:26,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565830708] [2019-11-24 04:42:26,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:27,271 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:42:27,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565830708] [2019-11-24 04:42:27,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:27,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:27,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767471284] [2019-11-24 04:42:27,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:27,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:27,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:27,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:27,274 INFO L87 Difference]: Start difference. First operand 5091 states and 8729 transitions. Second operand 5 states.