/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/systemc/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:04:06,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:04:06,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:04:06,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:04:06,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:04:06,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:04:06,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:04:06,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:04:06,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:04:06,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:04:06,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:04:06,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:04:06,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:04:06,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:04:06,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:04:06,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:04:06,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:04:06,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:04:06,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:04:06,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:04:06,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:04:06,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:04:06,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:04:06,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:04:06,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:04:06,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:04:06,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:04:06,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:04:06,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:04:06,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:04:06,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:04:06,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:04:06,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:04:06,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:04:06,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:04:06,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:04:06,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:04:06,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:04:06,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:04:06,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:04:06,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:04:06,406 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 06:04:06,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:04:06,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:04:06,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:04:06,429 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:04:06,429 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:04:06,429 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:04:06,429 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:04:06,430 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:04:06,430 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:04:06,430 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:04:06,431 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:04:06,431 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:04:06,431 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:04:06,432 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:04:06,432 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:04:06,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:04:06,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:04:06,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:04:06,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:04:06,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:04:06,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:04:06,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:04:06,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:04:06,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:04:06,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:04:06,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:04:06,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:04:06,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:04:06,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:04:06,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:04:06,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:04:06,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:04:06,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:04:06,438 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:04:06,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:04:06,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:04:06,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:04:06,439 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:04:06,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:04:06,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:04:06,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:04:06,717 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:04:06,718 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:04:06,718 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2019-11-24 06:04:06,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb968a12/b602715bfbd64922ab68fd79bcc87783/FLAG9a60c2e60 [2019-11-24 06:04:07,290 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:04:07,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2019-11-24 06:04:07,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb968a12/b602715bfbd64922ab68fd79bcc87783/FLAG9a60c2e60 [2019-11-24 06:04:07,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb968a12/b602715bfbd64922ab68fd79bcc87783 [2019-11-24 06:04:07,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:04:07,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:04:07,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:04:07,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:04:07,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:04:07,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:04:07" (1/1) ... [2019-11-24 06:04:07,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2158fff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:07, skipping insertion in model container [2019-11-24 06:04:07,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:04:07" (1/1) ... [2019-11-24 06:04:07,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:04:07,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:04:07,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:04:07,927 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:04:08,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:04:08,084 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:04:08,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08 WrapperNode [2019-11-24 06:04:08,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:04:08,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:04:08,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:04:08,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:04:08,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:04:08,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:04:08,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:04:08,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:04:08,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (1/1) ... [2019-11-24 06:04:08,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:04:08,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:04:08,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:04:08,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:04:08,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (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 06:04:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:04:08,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:04:09,513 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:04:09,514 INFO L284 CfgBuilder]: Removed 95 assume(true) statements. [2019-11-24 06:04:09,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:04:09 BoogieIcfgContainer [2019-11-24 06:04:09,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:04:09,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:04:09,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:04:09,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:04:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:04:07" (1/3) ... [2019-11-24 06:04:09,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a994193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:04:09, skipping insertion in model container [2019-11-24 06:04:09,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:08" (2/3) ... [2019-11-24 06:04:09,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a994193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:04:09, skipping insertion in model container [2019-11-24 06:04:09,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:04:09" (3/3) ... [2019-11-24 06:04:09,526 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-11-24 06:04:09,538 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:04:09,546 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-24 06:04:09,557 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-24 06:04:09,590 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:04:09,591 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:04:09,591 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:04:09,591 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:04:09,591 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:04:09,591 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:04:09,592 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:04:09,592 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:04:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-11-24 06:04:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 06:04:09,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:09,627 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 06:04:09,628 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:09,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:09,636 INFO L82 PathProgramCache]: Analyzing trace with hash 146133789, now seen corresponding path program 1 times [2019-11-24 06:04:09,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:09,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733408824] [2019-11-24 06:04:09,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:09,868 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 06:04:09,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733408824] [2019-11-24 06:04:09,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:09,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:09,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639743371] [2019-11-24 06:04:09,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:09,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:09,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:09,896 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2019-11-24 06:04:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:10,010 INFO L93 Difference]: Finished difference Result 275 states and 428 transitions. [2019-11-24 06:04:10,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:10,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 06:04:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:10,037 INFO L225 Difference]: With dead ends: 275 [2019-11-24 06:04:10,037 INFO L226 Difference]: Without dead ends: 177 [2019-11-24 06:04:10,043 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 06:04:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-24 06:04:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-11-24 06:04:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-24 06:04:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 244 transitions. [2019-11-24 06:04:10,103 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 244 transitions. Word has length 19 [2019-11-24 06:04:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:10,103 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 244 transitions. [2019-11-24 06:04:10,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2019-11-24 06:04:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 06:04:10,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:10,105 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 06:04:10,105 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash -924289890, now seen corresponding path program 1 times [2019-11-24 06:04:10,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:10,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793162962] [2019-11-24 06:04:10,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:10,186 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 06:04:10,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793162962] [2019-11-24 06:04:10,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:10,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:10,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360768273] [2019-11-24 06:04:10,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:10,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:10,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:10,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:10,196 INFO L87 Difference]: Start difference. First operand 160 states and 244 transitions. Second operand 3 states. [2019-11-24 06:04:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:10,288 INFO L93 Difference]: Finished difference Result 445 states and 676 transitions. [2019-11-24 06:04:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:10,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 06:04:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:10,295 INFO L225 Difference]: With dead ends: 445 [2019-11-24 06:04:10,295 INFO L226 Difference]: Without dead ends: 294 [2019-11-24 06:04:10,299 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 06:04:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-24 06:04:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-11-24 06:04:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-24 06:04:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 404 transitions. [2019-11-24 06:04:10,326 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 404 transitions. Word has length 19 [2019-11-24 06:04:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:10,327 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 404 transitions. [2019-11-24 06:04:10,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 404 transitions. [2019-11-24 06:04:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 06:04:10,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:10,329 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 06:04:10,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:10,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash -732877369, now seen corresponding path program 1 times [2019-11-24 06:04:10,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:10,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355943448] [2019-11-24 06:04:10,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:10,481 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 06:04:10,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355943448] [2019-11-24 06:04:10,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:10,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:10,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163769696] [2019-11-24 06:04:10,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:04:10,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:04:10,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:04:10,483 INFO L87 Difference]: Start difference. First operand 272 states and 404 transitions. Second operand 5 states. [2019-11-24 06:04:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:10,678 INFO L93 Difference]: Finished difference Result 1337 states and 2000 transitions. [2019-11-24 06:04:10,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 06:04:10,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-24 06:04:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:10,686 INFO L225 Difference]: With dead ends: 1337 [2019-11-24 06:04:10,686 INFO L226 Difference]: Without dead ends: 1077 [2019-11-24 06:04:10,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:04:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-11-24 06:04:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 462. [2019-11-24 06:04:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-24 06:04:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 692 transitions. [2019-11-24 06:04:10,751 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 692 transitions. Word has length 20 [2019-11-24 06:04:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:10,752 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 692 transitions. [2019-11-24 06:04:10,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:04:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 692 transitions. [2019-11-24 06:04:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 06:04:10,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:10,754 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 06:04:10,754 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1209496291, now seen corresponding path program 1 times [2019-11-24 06:04:10,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:10,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372988988] [2019-11-24 06:04:10,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:10,850 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 06:04:10,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372988988] [2019-11-24 06:04:10,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:10,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:10,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241657913] [2019-11-24 06:04:10,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:04:10,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:10,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:04:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:04:10,853 INFO L87 Difference]: Start difference. First operand 462 states and 692 transitions. Second operand 5 states. [2019-11-24 06:04:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:11,118 INFO L93 Difference]: Finished difference Result 2198 states and 3310 transitions. [2019-11-24 06:04:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 06:04:11,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 06:04:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:11,128 INFO L225 Difference]: With dead ends: 2198 [2019-11-24 06:04:11,128 INFO L226 Difference]: Without dead ends: 1748 [2019-11-24 06:04:11,131 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 06:04:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-11-24 06:04:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 902. [2019-11-24 06:04:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-11-24 06:04:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1352 transitions. [2019-11-24 06:04:11,201 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1352 transitions. Word has length 25 [2019-11-24 06:04:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:11,201 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1352 transitions. [2019-11-24 06:04:11,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:04:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1352 transitions. [2019-11-24 06:04:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 06:04:11,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:11,208 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 06:04:11,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash -901042847, now seen corresponding path program 1 times [2019-11-24 06:04:11,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:11,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236181600] [2019-11-24 06:04:11,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:11,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236181600] [2019-11-24 06:04:11,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:11,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:11,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008732128] [2019-11-24 06:04:11,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:11,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:11,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:11,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:11,310 INFO L87 Difference]: Start difference. First operand 902 states and 1352 transitions. Second operand 3 states. [2019-11-24 06:04:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:11,421 INFO L93 Difference]: Finished difference Result 2524 states and 3779 transitions. [2019-11-24 06:04:11,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:11,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 06:04:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:11,431 INFO L225 Difference]: With dead ends: 2524 [2019-11-24 06:04:11,431 INFO L226 Difference]: Without dead ends: 1634 [2019-11-24 06:04:11,433 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 06:04:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-11-24 06:04:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1628. [2019-11-24 06:04:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-11-24 06:04:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2422 transitions. [2019-11-24 06:04:11,544 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2422 transitions. Word has length 31 [2019-11-24 06:04:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:11,544 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 2422 transitions. [2019-11-24 06:04:11,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2422 transitions. [2019-11-24 06:04:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 06:04:11,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:11,546 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 06:04:11,546 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash -419757452, now seen corresponding path program 1 times [2019-11-24 06:04:11,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:11,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537998074] [2019-11-24 06:04:11,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:11,653 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 06:04:11,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537998074] [2019-11-24 06:04:11,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:11,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:04:11,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133555502] [2019-11-24 06:04:11,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 06:04:11,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:11,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 06:04:11,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:04:11,656 INFO L87 Difference]: Start difference. First operand 1628 states and 2422 transitions. Second operand 7 states. [2019-11-24 06:04:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:12,190 INFO L93 Difference]: Finished difference Result 6372 states and 9539 transitions. [2019-11-24 06:04:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 06:04:12,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-11-24 06:04:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:12,214 INFO L225 Difference]: With dead ends: 6372 [2019-11-24 06:04:12,215 INFO L226 Difference]: Without dead ends: 4756 [2019-11-24 06:04:12,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-24 06:04:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2019-11-24 06:04:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2398. [2019-11-24 06:04:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-11-24 06:04:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3572 transitions. [2019-11-24 06:04:12,394 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3572 transitions. Word has length 32 [2019-11-24 06:04:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:12,395 INFO L462 AbstractCegarLoop]: Abstraction has 2398 states and 3572 transitions. [2019-11-24 06:04:12,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 06:04:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3572 transitions. [2019-11-24 06:04:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 06:04:12,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:12,397 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:12,397 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1765703740, now seen corresponding path program 1 times [2019-11-24 06:04:12,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:12,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809153336] [2019-11-24 06:04:12,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:12,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809153336] [2019-11-24 06:04:12,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:12,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:12,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481113695] [2019-11-24 06:04:12,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:12,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:12,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:12,442 INFO L87 Difference]: Start difference. First operand 2398 states and 3572 transitions. Second operand 4 states. [2019-11-24 06:04:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:12,790 INFO L93 Difference]: Finished difference Result 7420 states and 11154 transitions. [2019-11-24 06:04:12,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:12,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-24 06:04:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:12,814 INFO L225 Difference]: With dead ends: 7420 [2019-11-24 06:04:12,814 INFO L226 Difference]: Without dead ends: 5034 [2019-11-24 06:04:12,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-11-24 06:04:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 2956. [2019-11-24 06:04:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-11-24 06:04:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4490 transitions. [2019-11-24 06:04:13,098 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4490 transitions. Word has length 34 [2019-11-24 06:04:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:13,099 INFO L462 AbstractCegarLoop]: Abstraction has 2956 states and 4490 transitions. [2019-11-24 06:04:13,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4490 transitions. [2019-11-24 06:04:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 06:04:13,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:13,102 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] [2019-11-24 06:04:13,103 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1116955560, now seen corresponding path program 1 times [2019-11-24 06:04:13,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:13,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783860898] [2019-11-24 06:04:13,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:13,190 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 06:04:13,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783860898] [2019-11-24 06:04:13,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:13,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:13,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097083867] [2019-11-24 06:04:13,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:04:13,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:04:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:04:13,193 INFO L87 Difference]: Start difference. First operand 2956 states and 4490 transitions. Second operand 5 states. [2019-11-24 06:04:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:13,541 INFO L93 Difference]: Finished difference Result 6950 states and 10583 transitions. [2019-11-24 06:04:13,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:04:13,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-24 06:04:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:13,563 INFO L225 Difference]: With dead ends: 6950 [2019-11-24 06:04:13,563 INFO L226 Difference]: Without dead ends: 4006 [2019-11-24 06:04:13,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:04:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2019-11-24 06:04:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 3924. [2019-11-24 06:04:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3924 states. [2019-11-24 06:04:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5958 transitions. [2019-11-24 06:04:13,908 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5958 transitions. Word has length 35 [2019-11-24 06:04:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:13,908 INFO L462 AbstractCegarLoop]: Abstraction has 3924 states and 5958 transitions. [2019-11-24 06:04:13,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:04:13,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5958 transitions. [2019-11-24 06:04:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:04:13,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:13,911 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:13,912 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:13,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1911060133, now seen corresponding path program 1 times [2019-11-24 06:04:13,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:13,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531651793] [2019-11-24 06:04:13,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:13,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531651793] [2019-11-24 06:04:13,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:13,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:13,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005444875] [2019-11-24 06:04:13,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:13,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:13,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:13,980 INFO L87 Difference]: Start difference. First operand 3924 states and 5958 transitions. Second operand 4 states. [2019-11-24 06:04:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:14,502 INFO L93 Difference]: Finished difference Result 11272 states and 17388 transitions. [2019-11-24 06:04:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:14,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-24 06:04:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:14,556 INFO L225 Difference]: With dead ends: 11272 [2019-11-24 06:04:14,556 INFO L226 Difference]: Without dead ends: 7360 [2019-11-24 06:04:14,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2019-11-24 06:04:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 5252. [2019-11-24 06:04:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-11-24 06:04:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8026 transitions. [2019-11-24 06:04:14,975 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8026 transitions. Word has length 36 [2019-11-24 06:04:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:14,977 INFO L462 AbstractCegarLoop]: Abstraction has 5252 states and 8026 transitions. [2019-11-24 06:04:14,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8026 transitions. [2019-11-24 06:04:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 06:04:14,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:14,979 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:14,980 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2059367407, now seen corresponding path program 1 times [2019-11-24 06:04:14,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:14,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554783792] [2019-11-24 06:04:14,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:15,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554783792] [2019-11-24 06:04:15,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:15,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:15,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495625444] [2019-11-24 06:04:15,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:15,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:15,033 INFO L87 Difference]: Start difference. First operand 5252 states and 8026 transitions. Second operand 4 states. [2019-11-24 06:04:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:15,548 INFO L93 Difference]: Finished difference Result 12624 states and 19420 transitions. [2019-11-24 06:04:15,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:15,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-24 06:04:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:15,575 INFO L225 Difference]: With dead ends: 12624 [2019-11-24 06:04:15,575 INFO L226 Difference]: Without dead ends: 7384 [2019-11-24 06:04:15,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7384 states. [2019-11-24 06:04:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7384 to 5540. [2019-11-24 06:04:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5540 states. [2019-11-24 06:04:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5540 states to 5540 states and 8414 transitions. [2019-11-24 06:04:16,064 INFO L78 Accepts]: Start accepts. Automaton has 5540 states and 8414 transitions. Word has length 37 [2019-11-24 06:04:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:16,064 INFO L462 AbstractCegarLoop]: Abstraction has 5540 states and 8414 transitions. [2019-11-24 06:04:16,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5540 states and 8414 transitions. [2019-11-24 06:04:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 06:04:16,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:16,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:16,066 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2117574998, now seen corresponding path program 1 times [2019-11-24 06:04:16,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:16,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257799886] [2019-11-24 06:04:16,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:16,142 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 06:04:16,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257799886] [2019-11-24 06:04:16,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:16,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:04:16,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149376782] [2019-11-24 06:04:16,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 06:04:16,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:16,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 06:04:16,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:04:16,144 INFO L87 Difference]: Start difference. First operand 5540 states and 8414 transitions. Second operand 7 states. [2019-11-24 06:04:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:17,457 INFO L93 Difference]: Finished difference Result 20028 states and 30323 transitions. [2019-11-24 06:04:17,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 06:04:17,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-24 06:04:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:17,490 INFO L225 Difference]: With dead ends: 20028 [2019-11-24 06:04:17,490 INFO L226 Difference]: Without dead ends: 14500 [2019-11-24 06:04:17,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-24 06:04:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14500 states. [2019-11-24 06:04:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14500 to 7656. [2019-11-24 06:04:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7656 states. [2019-11-24 06:04:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 11642 transitions. [2019-11-24 06:04:18,301 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 11642 transitions. Word has length 38 [2019-11-24 06:04:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:18,301 INFO L462 AbstractCegarLoop]: Abstraction has 7656 states and 11642 transitions. [2019-11-24 06:04:18,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 06:04:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 11642 transitions. [2019-11-24 06:04:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 06:04:18,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:18,303 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-11-24 06:04:18,304 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1747634684, now seen corresponding path program 1 times [2019-11-24 06:04:18,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:18,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956475768] [2019-11-24 06:04:18,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:18,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956475768] [2019-11-24 06:04:18,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:18,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:04:18,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898450649] [2019-11-24 06:04:18,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:04:18,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:18,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:04:18,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:04:18,343 INFO L87 Difference]: Start difference. First operand 7656 states and 11642 transitions. Second operand 5 states. [2019-11-24 06:04:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:19,872 INFO L93 Difference]: Finished difference Result 26902 states and 40750 transitions. [2019-11-24 06:04:19,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 06:04:19,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-24 06:04:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:19,932 INFO L225 Difference]: With dead ends: 26902 [2019-11-24 06:04:19,932 INFO L226 Difference]: Without dead ends: 19242 [2019-11-24 06:04:19,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 06:04:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19242 states. [2019-11-24 06:04:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19242 to 8756. [2019-11-24 06:04:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8756 states. [2019-11-24 06:04:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8756 states to 8756 states and 13138 transitions. [2019-11-24 06:04:20,878 INFO L78 Accepts]: Start accepts. Automaton has 8756 states and 13138 transitions. Word has length 40 [2019-11-24 06:04:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:20,878 INFO L462 AbstractCegarLoop]: Abstraction has 8756 states and 13138 transitions. [2019-11-24 06:04:20,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:04:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 8756 states and 13138 transitions. [2019-11-24 06:04:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 06:04:20,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:20,881 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-11-24 06:04:20,881 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:20,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1805104947, now seen corresponding path program 1 times [2019-11-24 06:04:20,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:20,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323448691] [2019-11-24 06:04:20,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:20,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323448691] [2019-11-24 06:04:20,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:20,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:20,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153352235] [2019-11-24 06:04:20,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:20,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:20,908 INFO L87 Difference]: Start difference. First operand 8756 states and 13138 transitions. Second operand 3 states. [2019-11-24 06:04:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:21,964 INFO L93 Difference]: Finished difference Result 21796 states and 32802 transitions. [2019-11-24 06:04:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:21,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-24 06:04:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:21,996 INFO L225 Difference]: With dead ends: 21796 [2019-11-24 06:04:21,997 INFO L226 Difference]: Without dead ends: 17236 [2019-11-24 06:04:22,007 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 06:04:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17236 states. [2019-11-24 06:04:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17236 to 17004. [2019-11-24 06:04:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17004 states. [2019-11-24 06:04:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17004 states to 17004 states and 25514 transitions. [2019-11-24 06:04:23,068 INFO L78 Accepts]: Start accepts. Automaton has 17004 states and 25514 transitions. Word has length 46 [2019-11-24 06:04:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:23,068 INFO L462 AbstractCegarLoop]: Abstraction has 17004 states and 25514 transitions. [2019-11-24 06:04:23,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 17004 states and 25514 transitions. [2019-11-24 06:04:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:04:23,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:23,071 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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] [2019-11-24 06:04:23,071 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1356200331, now seen corresponding path program 1 times [2019-11-24 06:04:23,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:23,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689120515] [2019-11-24 06:04:23,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:23,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689120515] [2019-11-24 06:04:23,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:23,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:04:23,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287029031] [2019-11-24 06:04:23,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:23,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:23,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:23,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:23,116 INFO L87 Difference]: Start difference. First operand 17004 states and 25514 transitions. Second operand 4 states. [2019-11-24 06:04:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:24,870 INFO L93 Difference]: Finished difference Result 56300 states and 84158 transitions. [2019-11-24 06:04:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:24,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 06:04:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:24,956 INFO L225 Difference]: With dead ends: 56300 [2019-11-24 06:04:24,956 INFO L226 Difference]: Without dead ends: 39298 [2019-11-24 06:04:24,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39298 states. [2019-11-24 06:04:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39298 to 32707. [2019-11-24 06:04:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32707 states. [2019-11-24 06:04:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32707 states to 32707 states and 48527 transitions. [2019-11-24 06:04:27,259 INFO L78 Accepts]: Start accepts. Automaton has 32707 states and 48527 transitions. Word has length 50 [2019-11-24 06:04:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:27,260 INFO L462 AbstractCegarLoop]: Abstraction has 32707 states and 48527 transitions. [2019-11-24 06:04:27,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 32707 states and 48527 transitions. [2019-11-24 06:04:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:04:27,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:27,263 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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] [2019-11-24 06:04:27,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:27,264 INFO L82 PathProgramCache]: Analyzing trace with hash 881162934, now seen corresponding path program 1 times [2019-11-24 06:04:27,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:27,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603791298] [2019-11-24 06:04:27,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:27,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603791298] [2019-11-24 06:04:27,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:27,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:27,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716350950] [2019-11-24 06:04:27,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:27,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:27,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:27,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:27,306 INFO L87 Difference]: Start difference. First operand 32707 states and 48527 transitions. Second operand 3 states. [2019-11-24 06:04:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:29,616 INFO L93 Difference]: Finished difference Result 82023 states and 121979 transitions. [2019-11-24 06:04:29,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:29,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 06:04:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:29,691 INFO L225 Difference]: With dead ends: 82023 [2019-11-24 06:04:29,691 INFO L226 Difference]: Without dead ends: 49327 [2019-11-24 06:04:29,723 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 06:04:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49327 states. [2019-11-24 06:04:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49327 to 49319. [2019-11-24 06:04:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49319 states. [2019-11-24 06:04:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49319 states to 49319 states and 73043 transitions. [2019-11-24 06:04:32,116 INFO L78 Accepts]: Start accepts. Automaton has 49319 states and 73043 transitions. Word has length 50 [2019-11-24 06:04:32,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:32,117 INFO L462 AbstractCegarLoop]: Abstraction has 49319 states and 73043 transitions. [2019-11-24 06:04:32,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 49319 states and 73043 transitions. [2019-11-24 06:04:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 06:04:32,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:32,121 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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] [2019-11-24 06:04:32,121 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash -58461633, now seen corresponding path program 1 times [2019-11-24 06:04:32,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:32,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359830082] [2019-11-24 06:04:32,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:32,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359830082] [2019-11-24 06:04:32,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:32,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:04:32,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318446264] [2019-11-24 06:04:32,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:32,151 INFO L87 Difference]: Start difference. First operand 49319 states and 73043 transitions. Second operand 3 states. [2019-11-24 06:04:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:35,935 INFO L93 Difference]: Finished difference Result 122635 states and 181960 transitions. [2019-11-24 06:04:35,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:35,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-24 06:04:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:36,016 INFO L225 Difference]: With dead ends: 122635 [2019-11-24 06:04:36,016 INFO L226 Difference]: Without dead ends: 73327 [2019-11-24 06:04:36,055 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 06:04:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73327 states. [2019-11-24 06:04:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73327 to 71065. [2019-11-24 06:04:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71065 states. [2019-11-24 06:04:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71065 states to 71065 states and 103861 transitions. [2019-11-24 06:04:40,930 INFO L78 Accepts]: Start accepts. Automaton has 71065 states and 103861 transitions. Word has length 51 [2019-11-24 06:04:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:40,931 INFO L462 AbstractCegarLoop]: Abstraction has 71065 states and 103861 transitions. [2019-11-24 06:04:40,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 71065 states and 103861 transitions. [2019-11-24 06:04:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 06:04:40,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:40,934 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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] [2019-11-24 06:04:40,934 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash 456161298, now seen corresponding path program 1 times [2019-11-24 06:04:40,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:40,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779853798] [2019-11-24 06:04:40,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:41,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779853798] [2019-11-24 06:04:41,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:41,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:04:41,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358286913] [2019-11-24 06:04:41,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:04:41,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:41,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:04:41,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:04:41,005 INFO L87 Difference]: Start difference. First operand 71065 states and 103861 transitions. Second operand 5 states. [2019-11-24 06:04:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:44,550 INFO L93 Difference]: Finished difference Result 145891 states and 212018 transitions. [2019-11-24 06:04:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 06:04:44,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-24 06:04:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:44,632 INFO L225 Difference]: With dead ends: 145891 [2019-11-24 06:04:44,633 INFO L226 Difference]: Without dead ends: 74837 [2019-11-24 06:04:44,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 06:04:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74837 states. [2019-11-24 06:04:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74837 to 71065. [2019-11-24 06:04:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71065 states. [2019-11-24 06:04:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71065 states to 71065 states and 102925 transitions. [2019-11-24 06:04:50,298 INFO L78 Accepts]: Start accepts. Automaton has 71065 states and 102925 transitions. Word has length 52 [2019-11-24 06:04:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:50,298 INFO L462 AbstractCegarLoop]: Abstraction has 71065 states and 102925 transitions. [2019-11-24 06:04:50,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:04:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 71065 states and 102925 transitions. [2019-11-24 06:04:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 06:04:50,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:50,302 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2019-11-24 06:04:50,302 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash 580716263, now seen corresponding path program 1 times [2019-11-24 06:04:50,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:50,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623776618] [2019-11-24 06:04:50,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 06:04:50,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623776618] [2019-11-24 06:04:50,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:50,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:50,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283447198] [2019-11-24 06:04:50,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:50,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:50,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:50,342 INFO L87 Difference]: Start difference. First operand 71065 states and 102925 transitions. Second operand 3 states. [2019-11-24 06:04:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:53,574 INFO L93 Difference]: Finished difference Result 143153 states and 207251 transitions. [2019-11-24 06:04:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:53,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 06:04:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:53,651 INFO L225 Difference]: With dead ends: 143153 [2019-11-24 06:04:53,651 INFO L226 Difference]: Without dead ends: 72099 [2019-11-24 06:04:53,685 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 06:04:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72099 states. [2019-11-24 06:04:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72099 to 71905. [2019-11-24 06:04:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71905 states. [2019-11-24 06:04:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71905 states to 71905 states and 104052 transitions. [2019-11-24 06:04:57,109 INFO L78 Accepts]: Start accepts. Automaton has 71905 states and 104052 transitions. Word has length 52 [2019-11-24 06:04:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:57,109 INFO L462 AbstractCegarLoop]: Abstraction has 71905 states and 104052 transitions. [2019-11-24 06:04:57,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 71905 states and 104052 transitions. [2019-11-24 06:04:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 06:04:57,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:57,112 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2019-11-24 06:04:57,112 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:57,113 INFO L82 PathProgramCache]: Analyzing trace with hash 771753252, now seen corresponding path program 1 times [2019-11-24 06:04:57,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:57,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845891233] [2019-11-24 06:04:57,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:57,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845891233] [2019-11-24 06:04:57,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:57,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:57,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97878204] [2019-11-24 06:04:57,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:57,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:57,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:57,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:57,143 INFO L87 Difference]: Start difference. First operand 71905 states and 104052 transitions. Second operand 3 states. [2019-11-24 06:05:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:04,330 INFO L93 Difference]: Finished difference Result 204213 states and 297335 transitions. [2019-11-24 06:05:04,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:04,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 06:05:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:04,509 INFO L225 Difference]: With dead ends: 204213 [2019-11-24 06:05:04,509 INFO L226 Difference]: Without dead ends: 132599 [2019-11-24 06:05:04,556 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 06:05:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132599 states. [2019-11-24 06:05:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132599 to 132591. [2019-11-24 06:05:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132591 states. [2019-11-24 06:05:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132591 states to 132591 states and 193129 transitions. [2019-11-24 06:05:11,574 INFO L78 Accepts]: Start accepts. Automaton has 132591 states and 193129 transitions. Word has length 53 [2019-11-24 06:05:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:11,574 INFO L462 AbstractCegarLoop]: Abstraction has 132591 states and 193129 transitions. [2019-11-24 06:05:11,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 132591 states and 193129 transitions. [2019-11-24 06:05:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 06:05:11,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:11,577 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2019-11-24 06:05:11,577 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:11,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash 658366595, now seen corresponding path program 1 times [2019-11-24 06:05:11,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:11,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668992578] [2019-11-24 06:05:11,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:11,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668992578] [2019-11-24 06:05:11,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:11,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:11,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20259131] [2019-11-24 06:05:11,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:11,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:11,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:11,614 INFO L87 Difference]: Start difference. First operand 132591 states and 193129 transitions. Second operand 3 states. [2019-11-24 06:05:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,127 INFO L93 Difference]: Finished difference Result 227839 states and 332137 transitions. [2019-11-24 06:05:18,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:18,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 06:05:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,248 INFO L225 Difference]: With dead ends: 227839 [2019-11-24 06:05:18,248 INFO L226 Difference]: Without dead ends: 96007 [2019-11-24 06:05:18,315 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 06:05:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96007 states. [2019-11-24 06:05:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96007 to 94459. [2019-11-24 06:05:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94459 states. [2019-11-24 06:05:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94459 states to 94459 states and 136459 transitions. [2019-11-24 06:05:23,348 INFO L78 Accepts]: Start accepts. Automaton has 94459 states and 136459 transitions. Word has length 53 [2019-11-24 06:05:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:23,348 INFO L462 AbstractCegarLoop]: Abstraction has 94459 states and 136459 transitions. [2019-11-24 06:05:23,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 94459 states and 136459 transitions. [2019-11-24 06:05:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 06:05:23,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:23,351 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2019-11-24 06:05:23,351 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash 165795650, now seen corresponding path program 1 times [2019-11-24 06:05:23,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:23,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576295360] [2019-11-24 06:05:23,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:23,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576295360] [2019-11-24 06:05:23,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:23,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:23,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625485076] [2019-11-24 06:05:23,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:23,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:23,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:23,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:23,389 INFO L87 Difference]: Start difference. First operand 94459 states and 136459 transitions. Second operand 4 states. [2019-11-24 06:05:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,743 INFO L93 Difference]: Finished difference Result 174290 states and 254886 transitions. [2019-11-24 06:05:29,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:29,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-24 06:05:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,847 INFO L225 Difference]: With dead ends: 174290 [2019-11-24 06:05:29,847 INFO L226 Difference]: Without dead ends: 79842 [2019-11-24 06:05:29,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 06:05:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79842 states.