/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product28.cil.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-6598664
[2019-11-24 04:39:30,649 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-11-24 04:39:30,651 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-24 04:39:30,669 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-24 04:39:30,670 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-24 04:39:30,672 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-24 04:39:30,674 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-24 04:39:30,678 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-24 04:39:30,685 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-24 04:39:30,687 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-24 04:39:30,688 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-11-24 04:39:30,689 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-24 04:39:30,690 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-24 04:39:30,691 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-24 04:39:30,692 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-24 04:39:30,694 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-24 04:39:30,696 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-24 04:39:30,699 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-24 04:39:30,702 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-24 04:39:30,706 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-24 04:39:30,711 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-24 04:39:30,712 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-24 04:39:30,713 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-11-24 04:39:30,714 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-24 04:39:30,717 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-24 04:39:30,718 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-24 04:39:30,718 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-24 04:39:30,720 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-24 04:39:30,720 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-24 04:39:30,723 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-24 04:39:30,723 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-24 04:39:30,724 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-24 04:39:30,725 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-24 04:39:30,726 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-24 04:39:30,728 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-24 04:39:30,728 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-24 04:39:30,729 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-24 04:39:30,729 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-24 04:39:30,729 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-24 04:39:30,733 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-24 04:39:30,735 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-11-24 04:39:30,735 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:39:30,756 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-11-24 04:39:30,757 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-24 04:39:30,758 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-11-24 04:39:30,758 INFO  L138        SettingsManager]:  * User list type=DISABLED
[2019-11-24 04:39:30,758 INFO  L136        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-11-24 04:39:30,758 INFO  L138        SettingsManager]:  * Explicit value domain=true
[2019-11-24 04:39:30,759 INFO  L138        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2019-11-24 04:39:30,759 INFO  L138        SettingsManager]:  * Octagon Domain=false
[2019-11-24 04:39:30,759 INFO  L138        SettingsManager]:  * Abstract domain=CompoundDomain
[2019-11-24 04:39:30,759 INFO  L138        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2019-11-24 04:39:30,760 INFO  L138        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2019-11-24 04:39:30,760 INFO  L138        SettingsManager]:  * Interval Domain=false
[2019-11-24 04:39:30,761 INFO  L136        SettingsManager]: Preferences of Sifa differ from their defaults:
[2019-11-24 04:39:30,761 INFO  L138        SettingsManager]:  * Call Summarizer=TopInputCallSummarizer
[2019-11-24 04:39:30,761 INFO  L138        SettingsManager]:  * Simplification Technique=SIMPLIFY_QUICK
[2019-11-24 04:39:30,763 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-24 04:39:30,763 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-11-24 04:39:30,763 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-11-24 04:39:30,763 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-11-24 04:39:30,764 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-11-24 04:39:30,764 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-11-24 04:39:30,764 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-24 04:39:30,764 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-11-24 04:39:30,764 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-11-24 04:39:30,765 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-11-24 04:39:30,765 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-11-24 04:39:30,765 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-24 04:39:30,765 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-11-24 04:39:30,766 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-11-24 04:39:30,767 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-24 04:39:30,767 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-24 04:39:30,767 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-11-24 04:39:30,767 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-24 04:39:30,767 INFO  L138        SettingsManager]:  * Trace refinement strategy=SIFA_TAIPAN
[2019-11-24 04:39:30,768 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-24 04:39:30,768 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-24 04:39:30,768 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-11-24 04:39:30,769 INFO  L138        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2019-11-24 04:39:31,051 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-24 04:39:31,065 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-24 04:39:31,069 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-24 04:39:31,071 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-11-24 04:39:31,071 INFO  L275        PluginConnector]: CDTParser initialized
[2019-11-24 04:39:31,072 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product28.cil.c
[2019-11-24 04:39:31,136 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/127721d75/c84acc26bf294a6589434afab7684cd5/FLAGf14ae9243
[2019-11-24 04:39:31,707 INFO  L306              CDTParser]: Found 1 translation units.
[2019-11-24 04:39:31,708 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product28.cil.c
[2019-11-24 04:39:31,730 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/127721d75/c84acc26bf294a6589434afab7684cd5/FLAGf14ae9243
[2019-11-24 04:39:31,897 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/127721d75/c84acc26bf294a6589434afab7684cd5
[2019-11-24 04:39:31,906 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-24 04:39:31,907 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2019-11-24 04:39:31,908 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-24 04:39:31,909 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-24 04:39:31,912 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-24 04:39:31,913 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:31" (1/1) ...
[2019-11-24 04:39:31,916 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9f1e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:31, skipping insertion in model container
[2019-11-24 04:39:31,916 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:31" (1/1) ...
[2019-11-24 04:39:31,924 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2019-11-24 04:39:32,012 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2019-11-24 04:39:32,666 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-24 04:39:32,683 INFO  L203         MainTranslator]: Completed pre-run
[2019-11-24 04:39:32,820 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-24 04:39:32,897 INFO  L208         MainTranslator]: Completed translation
[2019-11-24 04:39:32,897 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32 WrapperNode
[2019-11-24 04:39:32,898 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-24 04:39:32,898 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-24 04:39:32,899 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-24 04:39:32,899 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-24 04:39:32,907 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:39:32" (1/1) ...
[2019-11-24 04:39:32,963 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:39:32" (1/1) ...
[2019-11-24 04:39:33,231 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-24 04:39:33,231 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-24 04:39:33,232 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-24 04:39:33,232 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-11-24 04:39:33,242 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (1/1) ...
[2019-11-24 04:39:33,243 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (1/1) ...
[2019-11-24 04:39:33,337 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (1/1) ...
[2019-11-24 04:39:33,338 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (1/1) ...
[2019-11-24 04:39:33,555 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (1/1) ...
[2019-11-24 04:39:33,675 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (1/1) ...
[2019-11-24 04:39:33,725 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (1/1) ...
[2019-11-24 04:39:33,778 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-24 04:39:33,779 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-24 04:39:33,779 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-11-24 04:39:33,779 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-11-24 04:39:33,780 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (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:39:33,847 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-11-24 04:39:33,847 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2019-11-24 04:39:33,848 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-24 04:39:33,848 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-24 04:40:27,179 INFO  L279             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-24 04:40:27,179 INFO  L284             CfgBuilder]: Removed 1209 assume(true) statements.
[2019-11-24 04:40:27,181 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:27 BoogieIcfgContainer
[2019-11-24 04:40:27,181 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-24 04:40:27,183 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-24 04:40:27,183 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-11-24 04:40:27,186 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-11-24 04:40:27,186 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:39:31" (1/3) ...
[2019-11-24 04:40:27,187 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467fe823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:27, skipping insertion in model container
[2019-11-24 04:40:27,187 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:32" (2/3) ...
[2019-11-24 04:40:27,188 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467fe823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:27, skipping insertion in model container
[2019-11-24 04:40:27,188 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:27" (3/3) ...
[2019-11-24 04:40:27,190 INFO  L109   eAbstractionObserver]: Analyzing ICFG elevator_spec1_product28.cil.c
[2019-11-24 04:40:27,198 INFO  L153   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-24 04:40:27,207 INFO  L165   ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations.
[2019-11-24 04:40:27,218 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2019-11-24 04:40:27,254 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-11-24 04:40:27,254 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-11-24 04:40:27,254 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-24 04:40:27,254 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-24 04:40:27,255 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-24 04:40:27,255 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-11-24 04:40:27,255 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-24 04:40:27,255 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-24 04:40:27,297 INFO  L276                IsEmpty]: Start isEmpty. Operand 1449 states.
[2019-11-24 04:40:27,307 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2019-11-24 04:40:27,308 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:27,308 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:40:27,309 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:40:27,313 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:27,314 INFO  L82        PathProgramCache]: Analyzing trace with hash -608712914, now seen corresponding path program 1 times
[2019-11-24 04:40:27,321 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:27,321 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900106533]
[2019-11-24 04:40:27,322 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:27,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:27,788 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:40:27,788 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900106533]
[2019-11-24 04:40:27,790 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:27,790 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-24 04:40:27,791 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172811450]
[2019-11-24 04:40:27,796 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-11-24 04:40:27,797 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:27,810 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-11-24 04:40:27,812 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-11-24 04:40:27,814 INFO  L87              Difference]: Start difference. First operand 1449 states. Second operand 2 states.
[2019-11-24 04:40:27,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:27,918 INFO  L93              Difference]: Finished difference Result 1466 states and 2819 transitions.
[2019-11-24 04:40:27,919 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2019-11-24 04:40:27,921 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 12
[2019-11-24 04:40:27,922 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:27,958 INFO  L225             Difference]: With dead ends: 1466
[2019-11-24 04:40:27,958 INFO  L226             Difference]: Without dead ends: 1447
[2019-11-24 04:40:27,964 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-11-24 04:40:27,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1447 states.
[2019-11-24 04:40:28,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447.
[2019-11-24 04:40:28,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1447 states.
[2019-11-24 04:40:28,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2789 transitions.
[2019-11-24 04:40:28,096 INFO  L78                 Accepts]: Start accepts. Automaton has 1447 states and 2789 transitions. Word has length 12
[2019-11-24 04:40:28,096 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:28,096 INFO  L462      AbstractCegarLoop]: Abstraction has 1447 states and 2789 transitions.
[2019-11-24 04:40:28,096 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-11-24 04:40:28,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 1447 states and 2789 transitions.
[2019-11-24 04:40:28,101 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2019-11-24 04:40:28,101 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:28,102 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:40:28,104 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:40:28,105 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:28,107 INFO  L82        PathProgramCache]: Analyzing trace with hash -1715429888, now seen corresponding path program 1 times
[2019-11-24 04:40:28,107 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:28,108 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902127715]
[2019-11-24 04:40:28,108 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:28,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:28,298 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:40:28,299 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902127715]
[2019-11-24 04:40:28,299 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:28,299 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:40:28,300 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158080771]
[2019-11-24 04:40:28,301 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:40:28,302 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:28,302 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:40:28,302 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:40:28,303 INFO  L87              Difference]: Start difference. First operand 1447 states and 2789 transitions. Second operand 3 states.
[2019-11-24 04:40:28,427 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:28,427 INFO  L93              Difference]: Finished difference Result 2187 states and 4210 transitions.
[2019-11-24 04:40:28,427 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:40:28,428 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2019-11-24 04:40:28,428 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:28,436 INFO  L225             Difference]: With dead ends: 2187
[2019-11-24 04:40:28,437 INFO  L226             Difference]: Without dead ends: 1443
[2019-11-24 04:40:28,444 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:40:28,449 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1443 states.
[2019-11-24 04:40:28,486 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443.
[2019-11-24 04:40:28,486 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1443 states.
[2019-11-24 04:40:28,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2781 transitions.
[2019-11-24 04:40:28,495 INFO  L78                 Accepts]: Start accepts. Automaton has 1443 states and 2781 transitions. Word has length 13
[2019-11-24 04:40:28,496 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:28,496 INFO  L462      AbstractCegarLoop]: Abstraction has 1443 states and 2781 transitions.
[2019-11-24 04:40:28,496 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:40:28,496 INFO  L276                IsEmpty]: Start isEmpty. Operand 1443 states and 2781 transitions.
[2019-11-24 04:40:28,503 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-11-24 04:40:28,503 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:28,504 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:40:28,504 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:40:28,505 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:28,505 INFO  L82        PathProgramCache]: Analyzing trace with hash -1014989456, now seen corresponding path program 1 times
[2019-11-24 04:40:28,506 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:28,506 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935670229]
[2019-11-24 04:40:28,507 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:28,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:28,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-24 04:40:28,640 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935670229]
[2019-11-24 04:40:28,641 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:28,641 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:40:28,641 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106103070]
[2019-11-24 04:40:28,642 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-24 04:40:28,642 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:28,642 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-24 04:40:28,643 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-24 04:40:28,643 INFO  L87              Difference]: Start difference. First operand 1443 states and 2781 transitions. Second operand 4 states.
[2019-11-24 04:40:30,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:30,099 INFO  L93              Difference]: Finished difference Result 3693 states and 7077 transitions.
[2019-11-24 04:40:30,100 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-24 04:40:30,100 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2019-11-24 04:40:30,101 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:30,122 INFO  L225             Difference]: With dead ends: 3693
[2019-11-24 04:40:30,129 INFO  L226             Difference]: Without dead ends: 2710
[2019-11-24 04:40:30,135 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:30,141 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2710 states.
[2019-11-24 04:40:30,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 1901.
[2019-11-24 04:40:30,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1901 states.
[2019-11-24 04:40:30,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 3570 transitions.
[2019-11-24 04:40:30,217 INFO  L78                 Accepts]: Start accepts. Automaton has 1901 states and 3570 transitions. Word has length 15
[2019-11-24 04:40:30,217 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:30,217 INFO  L462      AbstractCegarLoop]: Abstraction has 1901 states and 3570 transitions.
[2019-11-24 04:40:30,218 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-24 04:40:30,218 INFO  L276                IsEmpty]: Start isEmpty. Operand 1901 states and 3570 transitions.
[2019-11-24 04:40:30,220 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-11-24 04:40:30,220 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:30,220 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:40:30,220 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:40:30,221 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:30,221 INFO  L82        PathProgramCache]: Analyzing trace with hash -1524149594, now seen corresponding path program 1 times
[2019-11-24 04:40:30,221 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:30,221 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572178261]
[2019-11-24 04:40:30,222 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:30,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:30,367 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:40:30,368 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572178261]
[2019-11-24 04:40:30,368 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:30,368 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-24 04:40:30,368 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315402540]
[2019-11-24 04:40:30,369 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:40:30,369 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:30,369 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:40:30,369 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:40:30,370 INFO  L87              Difference]: Start difference. First operand 1901 states and 3570 transitions. Second operand 3 states.
[2019-11-24 04:40:30,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:30,991 INFO  L93              Difference]: Finished difference Result 3557 states and 6673 transitions.
[2019-11-24 04:40:30,992 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:40:30,993 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2019-11-24 04:40:30,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:31,004 INFO  L225             Difference]: With dead ends: 3557
[2019-11-24 04:40:31,005 INFO  L226             Difference]: Without dead ends: 2245
[2019-11-24 04:40:31,008 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:40:31,012 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2245 states.
[2019-11-24 04:40:31,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2232.
[2019-11-24 04:40:31,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2232 states.
[2019-11-24 04:40:31,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 4182 transitions.
[2019-11-24 04:40:31,077 INFO  L78                 Accepts]: Start accepts. Automaton has 2232 states and 4182 transitions. Word has length 16
[2019-11-24 04:40:31,077 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:31,077 INFO  L462      AbstractCegarLoop]: Abstraction has 2232 states and 4182 transitions.
[2019-11-24 04:40:31,078 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:40:31,078 INFO  L276                IsEmpty]: Start isEmpty. Operand 2232 states and 4182 transitions.
[2019-11-24 04:40:31,079 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2019-11-24 04:40:31,079 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:31,079 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:40:31,079 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:40:31,080 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:31,080 INFO  L82        PathProgramCache]: Analyzing trace with hash 1206501535, now seen corresponding path program 1 times
[2019-11-24 04:40:31,080 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:31,080 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039229119]
[2019-11-24 04:40:31,081 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:31,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:31,180 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:40:31,180 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039229119]
[2019-11-24 04:40:31,181 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:31,181 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:40:31,181 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586682479]
[2019-11-24 04:40:31,181 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-24 04:40:31,182 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:31,182 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-24 04:40:31,182 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-24 04:40:31,182 INFO  L87              Difference]: Start difference. First operand 2232 states and 4182 transitions. Second operand 4 states.
[2019-11-24 04:40:31,429 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:31,429 INFO  L93              Difference]: Finished difference Result 4125 states and 7689 transitions.
[2019-11-24 04:40:31,430 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-24 04:40:31,430 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 18
[2019-11-24 04:40:31,430 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:31,444 INFO  L225             Difference]: With dead ends: 4125
[2019-11-24 04:40:31,445 INFO  L226             Difference]: Without dead ends: 2181
[2019-11-24 04:40:31,449 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:31,454 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2181 states.
[2019-11-24 04:40:31,533 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1720.
[2019-11-24 04:40:31,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1720 states.
[2019-11-24 04:40:31,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 3208 transitions.
[2019-11-24 04:40:31,539 INFO  L78                 Accepts]: Start accepts. Automaton has 1720 states and 3208 transitions. Word has length 18
[2019-11-24 04:40:31,540 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:31,540 INFO  L462      AbstractCegarLoop]: Abstraction has 1720 states and 3208 transitions.
[2019-11-24 04:40:31,540 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-24 04:40:31,540 INFO  L276                IsEmpty]: Start isEmpty. Operand 1720 states and 3208 transitions.
[2019-11-24 04:40:31,541 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-11-24 04:40:31,541 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:31,542 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:40:31,542 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:40:31,542 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:31,543 INFO  L82        PathProgramCache]: Analyzing trace with hash 440915297, now seen corresponding path program 1 times
[2019-11-24 04:40:31,543 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:31,543 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072652749]
[2019-11-24 04:40:31,544 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:31,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:31,680 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:40:31,681 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072652749]
[2019-11-24 04:40:31,681 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:31,682 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-24 04:40:31,682 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602735239]
[2019-11-24 04:40:31,682 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:40:31,682 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:31,683 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:40:31,683 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:31,683 INFO  L87              Difference]: Start difference. First operand 1720 states and 3208 transitions. Second operand 5 states.
[2019-11-24 04:40:32,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:32,291 INFO  L93              Difference]: Finished difference Result 4017 states and 7495 transitions.
[2019-11-24 04:40:32,292 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-11-24 04:40:32,292 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 19
[2019-11-24 04:40:32,292 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:32,307 INFO  L225             Difference]: With dead ends: 4017
[2019-11-24 04:40:32,307 INFO  L226             Difference]: Without dead ends: 2874
[2019-11-24 04:40:32,311 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2019-11-24 04:40:32,316 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2874 states.
[2019-11-24 04:40:32,392 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1720.
[2019-11-24 04:40:32,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1720 states.
[2019-11-24 04:40:32,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 3205 transitions.
[2019-11-24 04:40:32,396 INFO  L78                 Accepts]: Start accepts. Automaton has 1720 states and 3205 transitions. Word has length 19
[2019-11-24 04:40:32,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:32,397 INFO  L462      AbstractCegarLoop]: Abstraction has 1720 states and 3205 transitions.
[2019-11-24 04:40:32,397 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:40:32,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 1720 states and 3205 transitions.
[2019-11-24 04:40:32,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-11-24 04:40:32,399 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:32,402 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:40:32,403 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:40:32,403 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:32,403 INFO  L82        PathProgramCache]: Analyzing trace with hash -1371215299, now seen corresponding path program 1 times
[2019-11-24 04:40:32,406 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:32,407 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427678453]
[2019-11-24 04:40:32,407 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:34,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:34,600 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:40:34,600 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427678453]
[2019-11-24 04:40:34,601 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:34,601 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-24 04:40:34,601 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090332402]
[2019-11-24 04:40:34,601 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:40:34,602 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:34,602 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:40:34,602 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:34,602 INFO  L87              Difference]: Start difference. First operand 1720 states and 3205 transitions. Second operand 5 states.
[2019-11-24 04:40:34,833 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:34,834 INFO  L93              Difference]: Finished difference Result 2853 states and 5307 transitions.
[2019-11-24 04:40:34,834 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-24 04:40:34,834 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2019-11-24 04:40:34,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:34,850 INFO  L225             Difference]: With dead ends: 2853
[2019-11-24 04:40:34,850 INFO  L226             Difference]: Without dead ends: 2840
[2019-11-24 04:40:34,851 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-11-24 04:40:34,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2840 states.
[2019-11-24 04:40:34,928 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1724.
[2019-11-24 04:40:34,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1724 states.
[2019-11-24 04:40:34,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3209 transitions.
[2019-11-24 04:40:34,933 INFO  L78                 Accepts]: Start accepts. Automaton has 1724 states and 3209 transitions. Word has length 20
[2019-11-24 04:40:34,933 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:34,933 INFO  L462      AbstractCegarLoop]: Abstraction has 1724 states and 3209 transitions.
[2019-11-24 04:40:34,933 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:40:34,934 INFO  L276                IsEmpty]: Start isEmpty. Operand 1724 states and 3209 transitions.
[2019-11-24 04:40:34,934 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-11-24 04:40:34,935 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:34,935 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:40:34,935 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:40:34,935 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:34,935 INFO  L82        PathProgramCache]: Analyzing trace with hash -1916530463, now seen corresponding path program 1 times
[2019-11-24 04:40:34,936 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:34,936 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168568514]
[2019-11-24 04:40:34,936 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:34,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:35,032 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:40:35,033 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168568514]
[2019-11-24 04:40:35,033 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:35,033 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-24 04:40:35,033 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107391516]
[2019-11-24 04:40:35,034 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-24 04:40:35,034 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:35,034 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-24 04:40:35,034 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-24 04:40:35,035 INFO  L87              Difference]: Start difference. First operand 1724 states and 3209 transitions. Second operand 4 states.
[2019-11-24 04:40:35,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:35,204 INFO  L93              Difference]: Finished difference Result 2935 states and 5411 transitions.
[2019-11-24 04:40:35,204 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-24 04:40:35,204 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2019-11-24 04:40:35,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:35,220 INFO  L225             Difference]: With dead ends: 2935
[2019-11-24 04:40:35,220 INFO  L226             Difference]: Without dead ends: 2922
[2019-11-24 04:40:35,221 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:35,225 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2922 states.
[2019-11-24 04:40:35,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1775.
[2019-11-24 04:40:35,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1775 states.
[2019-11-24 04:40:35,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 3282 transitions.
[2019-11-24 04:40:35,311 INFO  L78                 Accepts]: Start accepts. Automaton has 1775 states and 3282 transitions. Word has length 21
[2019-11-24 04:40:35,311 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:35,311 INFO  L462      AbstractCegarLoop]: Abstraction has 1775 states and 3282 transitions.
[2019-11-24 04:40:35,311 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-24 04:40:35,311 INFO  L276                IsEmpty]: Start isEmpty. Operand 1775 states and 3282 transitions.
[2019-11-24 04:40:35,312 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-11-24 04:40:35,312 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:35,312 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:40:35,313 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:40:35,313 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:35,313 INFO  L82        PathProgramCache]: Analyzing trace with hash 731421787, now seen corresponding path program 1 times
[2019-11-24 04:40:35,313 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:35,314 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241000169]
[2019-11-24 04:40:35,314 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:35,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:35,438 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:40:35,438 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241000169]
[2019-11-24 04:40:35,438 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:35,438 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-24 04:40:35,439 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573759044]
[2019-11-24 04:40:35,439 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:40:35,439 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:35,439 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:40:35,439 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:35,440 INFO  L87              Difference]: Start difference. First operand 1775 states and 3282 transitions. Second operand 5 states.
[2019-11-24 04:40:37,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:37,104 INFO  L93              Difference]: Finished difference Result 5241 states and 9711 transitions.
[2019-11-24 04:40:37,105 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-11-24 04:40:37,105 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 22
[2019-11-24 04:40:37,105 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:37,126 INFO  L225             Difference]: With dead ends: 5241
[2019-11-24 04:40:37,126 INFO  L226             Difference]: Without dead ends: 4050
[2019-11-24 04:40:37,130 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2019-11-24 04:40:37,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4050 states.
[2019-11-24 04:40:37,275 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 2584.
[2019-11-24 04:40:37,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2584 states.
[2019-11-24 04:40:37,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4704 transitions.
[2019-11-24 04:40:37,283 INFO  L78                 Accepts]: Start accepts. Automaton has 2584 states and 4704 transitions. Word has length 22
[2019-11-24 04:40:37,284 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:37,284 INFO  L462      AbstractCegarLoop]: Abstraction has 2584 states and 4704 transitions.
[2019-11-24 04:40:37,284 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:40:37,284 INFO  L276                IsEmpty]: Start isEmpty. Operand 2584 states and 4704 transitions.
[2019-11-24 04:40:37,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-11-24 04:40:37,285 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:37,285 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]
[2019-11-24 04:40:37,286 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:40:37,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:37,286 INFO  L82        PathProgramCache]: Analyzing trace with hash 2069193971, now seen corresponding path program 1 times
[2019-11-24 04:40:37,287 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:37,287 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752421700]
[2019-11-24 04:40:37,287 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:37,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:37,578 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:40:37,579 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752421700]
[2019-11-24 04:40:37,579 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:37,579 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-11-24 04:40:37,579 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820352530]
[2019-11-24 04:40:37,579 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-11-24 04:40:37,580 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:37,580 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-11-24 04:40:37,580 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2019-11-24 04:40:37,580 INFO  L87              Difference]: Start difference. First operand 2584 states and 4704 transitions. Second operand 6 states.
[2019-11-24 04:40:38,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:38,669 INFO  L93              Difference]: Finished difference Result 6620 states and 12031 transitions.
[2019-11-24 04:40:38,670 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-24 04:40:38,670 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 22
[2019-11-24 04:40:38,671 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:38,678 INFO  L225             Difference]: With dead ends: 6620
[2019-11-24 04:40:38,678 INFO  L226             Difference]: Without dead ends: 2597
[2019-11-24 04:40:38,684 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2019-11-24 04:40:38,688 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2597 states.
[2019-11-24 04:40:38,824 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2584.
[2019-11-24 04:40:38,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2584 states.
[2019-11-24 04:40:38,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4681 transitions.
[2019-11-24 04:40:38,831 INFO  L78                 Accepts]: Start accepts. Automaton has 2584 states and 4681 transitions. Word has length 22
[2019-11-24 04:40:38,831 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:38,831 INFO  L462      AbstractCegarLoop]: Abstraction has 2584 states and 4681 transitions.
[2019-11-24 04:40:38,831 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-11-24 04:40:38,831 INFO  L276                IsEmpty]: Start isEmpty. Operand 2584 states and 4681 transitions.
[2019-11-24 04:40:38,832 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-11-24 04:40:38,832 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:38,833 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:40:38,833 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:40:38,833 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:38,833 INFO  L82        PathProgramCache]: Analyzing trace with hash 104663325, now seen corresponding path program 1 times
[2019-11-24 04:40:38,833 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:38,834 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209791730]
[2019-11-24 04:40:38,834 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:38,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:38,918 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:40:38,919 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209791730]
[2019-11-24 04:40:38,919 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:38,919 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-24 04:40:38,919 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203684396]
[2019-11-24 04:40:38,920 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:40:38,920 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:38,920 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:40:38,920 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:38,920 INFO  L87              Difference]: Start difference. First operand 2584 states and 4681 transitions. Second operand 5 states.
[2019-11-24 04:40:39,398 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:39,398 INFO  L93              Difference]: Finished difference Result 6383 states and 11534 transitions.
[2019-11-24 04:40:39,399 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2019-11-24 04:40:39,399 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2019-11-24 04:40:39,400 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:39,408 INFO  L225             Difference]: With dead ends: 6383
[2019-11-24 04:40:39,409 INFO  L226             Difference]: Without dead ends: 4338
[2019-11-24 04:40:39,413 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-11-24 04:40:39,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4338 states.
[2019-11-24 04:40:39,570 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 2582.
[2019-11-24 04:40:39,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2582 states.
[2019-11-24 04:40:39,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 4677 transitions.
[2019-11-24 04:40:39,575 INFO  L78                 Accepts]: Start accepts. Automaton has 2582 states and 4677 transitions. Word has length 25
[2019-11-24 04:40:39,575 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:39,576 INFO  L462      AbstractCegarLoop]: Abstraction has 2582 states and 4677 transitions.
[2019-11-24 04:40:39,576 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:40:39,576 INFO  L276                IsEmpty]: Start isEmpty. Operand 2582 states and 4677 transitions.
[2019-11-24 04:40:39,576 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-11-24 04:40:39,577 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:39,577 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:40:39,577 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:40:39,577 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:39,577 INFO  L82        PathProgramCache]: Analyzing trace with hash 1845571166, now seen corresponding path program 1 times
[2019-11-24 04:40:39,578 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:39,578 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283992463]
[2019-11-24 04:40:39,578 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:39,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:39,664 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:40:39,664 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283992463]
[2019-11-24 04:40:39,665 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:39,665 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-11-24 04:40:39,665 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371262563]
[2019-11-24 04:40:39,665 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:40:39,665 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:39,666 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:40:39,666 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:39,667 INFO  L87              Difference]: Start difference. First operand 2582 states and 4677 transitions. Second operand 5 states.
[2019-11-24 04:40:40,074 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:40,074 INFO  L93              Difference]: Finished difference Result 5908 states and 10624 transitions.
[2019-11-24 04:40:40,075 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-11-24 04:40:40,075 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2019-11-24 04:40:40,075 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:40,087 INFO  L225             Difference]: With dead ends: 5908
[2019-11-24 04:40:40,087 INFO  L226             Difference]: Without dead ends: 3898
[2019-11-24 04:40:40,092 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:40:40,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3898 states.
[2019-11-24 04:40:40,262 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 2612.
[2019-11-24 04:40:40,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2612 states.
[2019-11-24 04:40:40,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 4704 transitions.
[2019-11-24 04:40:40,269 INFO  L78                 Accepts]: Start accepts. Automaton has 2612 states and 4704 transitions. Word has length 25
[2019-11-24 04:40:40,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:40,269 INFO  L462      AbstractCegarLoop]: Abstraction has 2612 states and 4704 transitions.
[2019-11-24 04:40:40,270 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:40:40,270 INFO  L276                IsEmpty]: Start isEmpty. Operand 2612 states and 4704 transitions.
[2019-11-24 04:40:40,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2019-11-24 04:40:40,272 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:40,272 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]
[2019-11-24 04:40:40,272 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:40:40,272 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:40,272 INFO  L82        PathProgramCache]: Analyzing trace with hash 1568074105, now seen corresponding path program 1 times
[2019-11-24 04:40:40,273 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:40,273 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570187914]
[2019-11-24 04:40:40,273 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:40,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:40,525 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:40:40,526 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570187914]
[2019-11-24 04:40:40,526 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:40,526 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:40:40,526 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297897814]
[2019-11-24 04:40:40,529 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-24 04:40:40,529 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:40,529 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-24 04:40:40,529 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-24 04:40:40,531 INFO  L87              Difference]: Start difference. First operand 2612 states and 4704 transitions. Second operand 4 states.
[2019-11-24 04:40:41,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:40:41,235 INFO  L93              Difference]: Finished difference Result 5858 states and 10529 transitions.
[2019-11-24 04:40:41,236 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-24 04:40:41,236 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 30
[2019-11-24 04:40:41,236 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:40:41,243 INFO  L225             Difference]: With dead ends: 5858
[2019-11-24 04:40:41,243 INFO  L226             Difference]: Without dead ends: 3791
[2019-11-24 04:40:41,247 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:41,252 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3791 states.
[2019-11-24 04:40:41,439 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 2609.
[2019-11-24 04:40:41,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2609 states.
[2019-11-24 04:40:41,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4694 transitions.
[2019-11-24 04:40:41,445 INFO  L78                 Accepts]: Start accepts. Automaton has 2609 states and 4694 transitions. Word has length 30
[2019-11-24 04:40:41,445 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:40:41,445 INFO  L462      AbstractCegarLoop]: Abstraction has 2609 states and 4694 transitions.
[2019-11-24 04:40:41,445 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-24 04:40:41,446 INFO  L276                IsEmpty]: Start isEmpty. Operand 2609 states and 4694 transitions.
[2019-11-24 04:40:41,446 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2019-11-24 04:40:41,447 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:40:41,447 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]
[2019-11-24 04:40:41,447 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:40:41,447 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:40:41,447 INFO  L82        PathProgramCache]: Analyzing trace with hash 1975198960, now seen corresponding path program 1 times
[2019-11-24 04:40:41,448 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:40:41,448 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550289287]
[2019-11-24 04:40:41,448 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:40:41,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:40:41,630 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:40:41,631 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550289287]
[2019-11-24 04:40:41,631 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:40:41,632 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-24 04:40:41,632 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392730309]
[2019-11-24 04:40:41,632 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:40:41,634 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:40:41,634 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:40:41,634 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:40:41,634 INFO  L87              Difference]: Start difference. First operand 2609 states and 4694 transitions. Second operand 5 states.