/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:37:06,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:37:06,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:37:06,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:37:06,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:37:06,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:37:06,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:37:06,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:37:06,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:37:06,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:37:06,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:37:06,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:37:06,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:37:06,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:37:06,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:37:06,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:37:06,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:37:06,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:37:06,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:37:06,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:37:06,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:37:06,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:37:06,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:37:06,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:37:06,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:37:06,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:37:06,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:37:06,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:37:06,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:37:06,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:37:06,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:37:06,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:37:06,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:37:06,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:37:06,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:37:06,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:37:06,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:37:06,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:37:06,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:37:06,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:37:06,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:37:06,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:37:06,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:37:06,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:37:06,261 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:37:06,261 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:37:06,261 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:37:06,261 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:37:06,262 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:37:06,262 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:37:06,262 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:37:06,262 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:37:06,263 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:37:06,263 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:37:06,263 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:37:06,263 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:37:06,263 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:37:06,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:37:06,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:37:06,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:37:06,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:37:06,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:37:06,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:37:06,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:37:06,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:37:06,266 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:37:06,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:37:06,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:37:06,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:37:06,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:37:06,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:37:06,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:37:06,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:37:06,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:37:06,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:37:06,268 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:37:06,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:37:06,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:37:06,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:37:06,269 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:37:06,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:37:06,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:37:06,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:37:06,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:37:06,587 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:37:06,587 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product17.cil.c [2019-11-24 04:37:06,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4389b00/24870bbf5703454f8081058d8fa16fb4/FLAG13ca410bf [2019-11-24 04:37:07,302 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:37:07,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product17.cil.c [2019-11-24 04:37:07,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4389b00/24870bbf5703454f8081058d8fa16fb4/FLAG13ca410bf [2019-11-24 04:37:07,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4389b00/24870bbf5703454f8081058d8fa16fb4 [2019-11-24 04:37:07,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:37:07,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:37:07,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:37:07,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:37:07,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:37:07,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:37:07" (1/1) ... [2019-11-24 04:37:07,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b3d8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:07, skipping insertion in model container [2019-11-24 04:37:07,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:37:07" (1/1) ... [2019-11-24 04:37:07,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:37:07,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:37:08,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:37:08,396 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:37:08,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:37:08,641 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:37:08,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08 WrapperNode [2019-11-24 04:37:08,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:37:08,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:37:08,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:37:08,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:37:08,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:08,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:08,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:37:08,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:37:08,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:37:08,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:37:08,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:08,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:08,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:08,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:08,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:09,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:09,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (1/1) ... [2019-11-24 04:37:09,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:37:09,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:37:09,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:37:09,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:37:09,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37: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 04:37:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:37:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:37:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:37:09,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:37:32,941 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:37:32,941 INFO L284 CfgBuilder]: Removed 541 assume(true) statements. [2019-11-24 04:37:32,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:32 BoogieIcfgContainer [2019-11-24 04:37:32,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:37:32,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:37:32,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:37:32,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:37:32,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:37:07" (1/3) ... [2019-11-24 04:37:32,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5924956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:32, skipping insertion in model container [2019-11-24 04:37:32,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:37:08" (2/3) ... [2019-11-24 04:37:32,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5924956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:32, skipping insertion in model container [2019-11-24 04:37:32,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:32" (3/3) ... [2019-11-24 04:37:32,951 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product17.cil.c [2019-11-24 04:37:32,960 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:37:32,968 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:37:32,978 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:37:33,007 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:37:33,008 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:37:33,008 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:37:33,008 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:37:33,008 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:37:33,008 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:37:33,008 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:37:33,008 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:37:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-11-24 04:37:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:37:33,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:33,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:33,050 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:33,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1915963361, now seen corresponding path program 1 times [2019-11-24 04:37:33,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:33,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109621030] [2019-11-24 04:37:33,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:33,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109621030] [2019-11-24 04:37:33,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:33,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:33,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128502866] [2019-11-24 04:37:33,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:33,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:33,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:33,596 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 4 states. [2019-11-24 04:37:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:33,832 INFO L93 Difference]: Finished difference Result 1843 states and 3518 transitions. [2019-11-24 04:37:33,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:33,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:37:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:33,868 INFO L225 Difference]: With dead ends: 1843 [2019-11-24 04:37:33,868 INFO L226 Difference]: Without dead ends: 1351 [2019-11-24 04:37:33,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-24 04:37:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 968. [2019-11-24 04:37:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-24 04:37:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1855 transitions. [2019-11-24 04:37:34,006 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1855 transitions. Word has length 15 [2019-11-24 04:37:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:34,007 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1855 transitions. [2019-11-24 04:37:34,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1855 transitions. [2019-11-24 04:37:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:37:34,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:34,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:34,013 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1375585920, now seen corresponding path program 1 times [2019-11-24 04:37:34,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:34,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213825167] [2019-11-24 04:37:34,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:34,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 04:37:34,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213825167] [2019-11-24 04:37:34,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:34,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:34,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015323941] [2019-11-24 04:37:34,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:34,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:34,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:34,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:34,146 INFO L87 Difference]: Start difference. First operand 968 states and 1855 transitions. Second operand 4 states. [2019-11-24 04:37:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:34,421 INFO L93 Difference]: Finished difference Result 1722 states and 3240 transitions. [2019-11-24 04:37:34,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:34,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:37:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:34,432 INFO L225 Difference]: With dead ends: 1722 [2019-11-24 04:37:34,433 INFO L226 Difference]: Without dead ends: 1329 [2019-11-24 04:37:34,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-11-24 04:37:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 972. [2019-11-24 04:37:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-24 04:37:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1859 transitions. [2019-11-24 04:37:34,487 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1859 transitions. Word has length 16 [2019-11-24 04:37:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:34,487 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1859 transitions. [2019-11-24 04:37:34,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1859 transitions. [2019-11-24 04:37:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:37:34,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:34,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:34,500 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1338847795, now seen corresponding path program 1 times [2019-11-24 04:37:34,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:34,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334625392] [2019-11-24 04:37:34,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:34,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334625392] [2019-11-24 04:37:34,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:34,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:34,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816368447] [2019-11-24 04:37:34,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:34,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:34,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:34,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:34,660 INFO L87 Difference]: Start difference. First operand 972 states and 1859 transitions. Second operand 5 states. [2019-11-24 04:37:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:36,467 INFO L93 Difference]: Finished difference Result 2059 states and 3891 transitions. [2019-11-24 04:37:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:36,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-24 04:37:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:36,480 INFO L225 Difference]: With dead ends: 2059 [2019-11-24 04:37:36,487 INFO L226 Difference]: Without dead ends: 1678 [2019-11-24 04:37:36,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-11-24 04:37:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 976. [2019-11-24 04:37:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-24 04:37:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1864 transitions. [2019-11-24 04:37:36,533 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1864 transitions. Word has length 19 [2019-11-24 04:37:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:36,534 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1864 transitions. [2019-11-24 04:37:36,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1864 transitions. [2019-11-24 04:37:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:37:36,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:36,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:36,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:36,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:36,536 INFO L82 PathProgramCache]: Analyzing trace with hash 737536084, now seen corresponding path program 1 times [2019-11-24 04:37:36,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:36,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60935250] [2019-11-24 04:37:36,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:36,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60935250] [2019-11-24 04:37:36,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:36,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:36,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022386434] [2019-11-24 04:37:36,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:36,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:36,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:36,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:36,736 INFO L87 Difference]: Start difference. First operand 976 states and 1864 transitions. Second operand 5 states. [2019-11-24 04:37:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:36,913 INFO L93 Difference]: Finished difference Result 1618 states and 3073 transitions. [2019-11-24 04:37:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:36,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-24 04:37:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:36,922 INFO L225 Difference]: With dead ends: 1618 [2019-11-24 04:37:36,922 INFO L226 Difference]: Without dead ends: 1603 [2019-11-24 04:37:36,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-24 04:37:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 980. [2019-11-24 04:37:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-11-24 04:37:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1868 transitions. [2019-11-24 04:37:36,966 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1868 transitions. Word has length 20 [2019-11-24 04:37:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:36,967 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1868 transitions. [2019-11-24 04:37:36,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1868 transitions. [2019-11-24 04:37:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:37:36,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:36,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:36,970 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:36,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1551021892, now seen corresponding path program 1 times [2019-11-24 04:37:36,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:36,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325239123] [2019-11-24 04:37:36,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:37,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325239123] [2019-11-24 04:37:37,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:37,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:37,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647153753] [2019-11-24 04:37:37,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:37,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:37,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:37,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:37,088 INFO L87 Difference]: Start difference. First operand 980 states and 1868 transitions. Second operand 3 states. [2019-11-24 04:37:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:37,138 INFO L93 Difference]: Finished difference Result 995 states and 1882 transitions. [2019-11-24 04:37:37,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:37,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:37:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:37,145 INFO L225 Difference]: With dead ends: 995 [2019-11-24 04:37:37,145 INFO L226 Difference]: Without dead ends: 980 [2019-11-24 04:37:37,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-11-24 04:37:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2019-11-24 04:37:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-11-24 04:37:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1866 transitions. [2019-11-24 04:37:37,185 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1866 transitions. Word has length 21 [2019-11-24 04:37:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:37,186 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1866 transitions. [2019-11-24 04:37:37,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1866 transitions. [2019-11-24 04:37:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:37:37,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:37,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:37,188 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1081482104, now seen corresponding path program 1 times [2019-11-24 04:37:37,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:37,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860675189] [2019-11-24 04:37:37,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:37,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860675189] [2019-11-24 04:37:37,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:37,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:37,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970709244] [2019-11-24 04:37:37,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:37,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:37,364 INFO L87 Difference]: Start difference. First operand 980 states and 1866 transitions. Second operand 3 states. [2019-11-24 04:37:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:37,431 INFO L93 Difference]: Finished difference Result 1628 states and 3097 transitions. [2019-11-24 04:37:37,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:37,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:37:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:37,437 INFO L225 Difference]: With dead ends: 1628 [2019-11-24 04:37:37,437 INFO L226 Difference]: Without dead ends: 973 [2019-11-24 04:37:37,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-11-24 04:37:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 970. [2019-11-24 04:37:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-11-24 04:37:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1847 transitions. [2019-11-24 04:37:37,474 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1847 transitions. Word has length 22 [2019-11-24 04:37:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:37,474 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1847 transitions. [2019-11-24 04:37:37,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1847 transitions. [2019-11-24 04:37:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:37:37,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:37,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:37,476 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash -833775654, now seen corresponding path program 1 times [2019-11-24 04:37:37,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:37,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757325416] [2019-11-24 04:37:37,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:37,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757325416] [2019-11-24 04:37:37,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:37,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:37,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910337938] [2019-11-24 04:37:37,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:37,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:37,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:37,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:37,565 INFO L87 Difference]: Start difference. First operand 970 states and 1847 transitions. Second operand 3 states. [2019-11-24 04:37:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:37,672 INFO L93 Difference]: Finished difference Result 2215 states and 4224 transitions. [2019-11-24 04:37:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:37,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:37:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:37,681 INFO L225 Difference]: With dead ends: 2215 [2019-11-24 04:37:37,681 INFO L226 Difference]: Without dead ends: 1596 [2019-11-24 04:37:37,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2019-11-24 04:37:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2019-11-24 04:37:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-11-24 04:37:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 3042 transitions. [2019-11-24 04:37:37,743 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 3042 transitions. Word has length 23 [2019-11-24 04:37:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:37,744 INFO L462 AbstractCegarLoop]: Abstraction has 1596 states and 3042 transitions. [2019-11-24 04:37:37,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 3042 transitions. [2019-11-24 04:37:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:37:37,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:37,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:37,746 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash -77223999, now seen corresponding path program 1 times [2019-11-24 04:37:37,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:37,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007099840] [2019-11-24 04:37:37,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:37,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007099840] [2019-11-24 04:37:37,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:37,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:37,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428011044] [2019-11-24 04:37:37,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:37,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:37,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:37,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:37,918 INFO L87 Difference]: Start difference. First operand 1596 states and 3042 transitions. Second operand 5 states. [2019-11-24 04:37:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:38,442 INFO L93 Difference]: Finished difference Result 2681 states and 5057 transitions. [2019-11-24 04:37:38,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:38,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 04:37:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:38,456 INFO L225 Difference]: With dead ends: 2681 [2019-11-24 04:37:38,457 INFO L226 Difference]: Without dead ends: 2304 [2019-11-24 04:37:38,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-11-24 04:37:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1602. [2019-11-24 04:37:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2019-11-24 04:37:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 3050 transitions. [2019-11-24 04:37:38,534 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 3050 transitions. Word has length 24 [2019-11-24 04:37:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:38,535 INFO L462 AbstractCegarLoop]: Abstraction has 1602 states and 3050 transitions. [2019-11-24 04:37:38,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 3050 transitions. [2019-11-24 04:37:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:37:38,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:38,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:38,536 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2104966265, now seen corresponding path program 1 times [2019-11-24 04:37:38,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:38,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368610414] [2019-11-24 04:37:38,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:38,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368610414] [2019-11-24 04:37:38,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:38,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:38,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475893519] [2019-11-24 04:37:38,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:38,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:38,643 INFO L87 Difference]: Start difference. First operand 1602 states and 3050 transitions. Second operand 5 states. [2019-11-24 04:37:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:39,184 INFO L93 Difference]: Finished difference Result 3662 states and 6921 transitions. [2019-11-24 04:37:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:39,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 04:37:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:39,207 INFO L225 Difference]: With dead ends: 3662 [2019-11-24 04:37:39,207 INFO L226 Difference]: Without dead ends: 2908 [2019-11-24 04:37:39,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-11-24 04:37:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1613. [2019-11-24 04:37:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2019-11-24 04:37:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 3065 transitions. [2019-11-24 04:37:39,319 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 3065 transitions. Word has length 24 [2019-11-24 04:37:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:39,319 INFO L462 AbstractCegarLoop]: Abstraction has 1613 states and 3065 transitions. [2019-11-24 04:37:39,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 3065 transitions. [2019-11-24 04:37:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:37:39,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:39,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:39,321 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1792186832, now seen corresponding path program 1 times [2019-11-24 04:37:39,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:39,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028579048] [2019-11-24 04:37:39,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:39,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028579048] [2019-11-24 04:37:39,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:39,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:39,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148729222] [2019-11-24 04:37:39,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:39,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:39,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:39,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:39,504 INFO L87 Difference]: Start difference. First operand 1613 states and 3065 transitions. Second operand 4 states. [2019-11-24 04:37:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:40,017 INFO L93 Difference]: Finished difference Result 3122 states and 5884 transitions. [2019-11-24 04:37:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:40,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-24 04:37:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:40,031 INFO L225 Difference]: With dead ends: 3122 [2019-11-24 04:37:40,031 INFO L226 Difference]: Without dead ends: 2246 [2019-11-24 04:37:40,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-11-24 04:37:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 1681. [2019-11-24 04:37:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1681 states. [2019-11-24 04:37:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 3133 transitions. [2019-11-24 04:37:40,114 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 3133 transitions. Word has length 24 [2019-11-24 04:37:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:40,115 INFO L462 AbstractCegarLoop]: Abstraction has 1681 states and 3133 transitions. [2019-11-24 04:37:40,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 3133 transitions. [2019-11-24 04:37:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:37:40,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:40,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:40,117 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 794723839, now seen corresponding path program 1 times [2019-11-24 04:37:40,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:40,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214836994] [2019-11-24 04:37:40,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:40,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214836994] [2019-11-24 04:37:40,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:40,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:40,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200276381] [2019-11-24 04:37:40,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:40,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:40,340 INFO L87 Difference]: Start difference. First operand 1681 states and 3133 transitions. Second operand 5 states. [2019-11-24 04:37:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:41,445 INFO L93 Difference]: Finished difference Result 5164 states and 9601 transitions. [2019-11-24 04:37:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:41,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-24 04:37:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:41,464 INFO L225 Difference]: With dead ends: 5164 [2019-11-24 04:37:41,465 INFO L226 Difference]: Without dead ends: 3774 [2019-11-24 04:37:41,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2019-11-24 04:37:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 2331. [2019-11-24 04:37:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2019-11-24 04:37:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 4270 transitions. [2019-11-24 04:37:41,582 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 4270 transitions. Word has length 26 [2019-11-24 04:37:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:41,583 INFO L462 AbstractCegarLoop]: Abstraction has 2331 states and 4270 transitions. [2019-11-24 04:37:41,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 4270 transitions. [2019-11-24 04:37:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:37:41,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:41,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:41,585 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 384019935, now seen corresponding path program 1 times [2019-11-24 04:37:41,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:41,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788764162] [2019-11-24 04:37:41,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:41,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788764162] [2019-11-24 04:37:41,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:41,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:41,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564048019] [2019-11-24 04:37:41,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:41,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:41,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:41,697 INFO L87 Difference]: Start difference. First operand 2331 states and 4270 transitions. Second operand 4 states. [2019-11-24 04:37:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:41,880 INFO L93 Difference]: Finished difference Result 3337 states and 6115 transitions. [2019-11-24 04:37:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:37:41,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 04:37:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:41,892 INFO L225 Difference]: With dead ends: 3337 [2019-11-24 04:37:41,892 INFO L226 Difference]: Without dead ends: 2322 [2019-11-24 04:37:41,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2019-11-24 04:37:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2019-11-24 04:37:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2019-11-24 04:37:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 4253 transitions. [2019-11-24 04:37:41,992 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 4253 transitions. Word has length 28 [2019-11-24 04:37:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:41,992 INFO L462 AbstractCegarLoop]: Abstraction has 2322 states and 4253 transitions. [2019-11-24 04:37:41,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 4253 transitions. [2019-11-24 04:37:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:37:41,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:41,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:41,994 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:41,994 INFO L82 PathProgramCache]: Analyzing trace with hash -137852301, now seen corresponding path program 1 times [2019-11-24 04:37:41,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:41,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810841062] [2019-11-24 04:37:41,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:42,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810841062] [2019-11-24 04:37:42,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:42,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:42,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650276302] [2019-11-24 04:37:42,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:42,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:42,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:42,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:42,163 INFO L87 Difference]: Start difference. First operand 2322 states and 4253 transitions. Second operand 6 states. [2019-11-24 04:37:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:42,921 INFO L93 Difference]: Finished difference Result 3488 states and 6361 transitions. [2019-11-24 04:37:42,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:42,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-24 04:37:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:42,934 INFO L225 Difference]: With dead ends: 3488 [2019-11-24 04:37:42,935 INFO L226 Difference]: Without dead ends: 2651 [2019-11-24 04:37:42,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2019-11-24 04:37:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2556. [2019-11-24 04:37:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2019-11-24 04:37:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 4642 transitions. [2019-11-24 04:37:43,053 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 4642 transitions. Word has length 28 [2019-11-24 04:37:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:43,053 INFO L462 AbstractCegarLoop]: Abstraction has 2556 states and 4642 transitions. [2019-11-24 04:37:43,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4642 transitions. [2019-11-24 04:37:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:37:43,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:43,055 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 04:37:43,055 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1385127521, now seen corresponding path program 1 times [2019-11-24 04:37:43,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:43,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684939458] [2019-11-24 04:37:43,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:43,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684939458] [2019-11-24 04:37:43,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:43,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:43,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101753019] [2019-11-24 04:37:43,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:43,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:43,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:43,207 INFO L87 Difference]: Start difference. First operand 2556 states and 4642 transitions. Second operand 4 states. [2019-11-24 04:37:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:44,364 INFO L93 Difference]: Finished difference Result 4753 states and 8668 transitions. [2019-11-24 04:37:44,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:37:44,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-24 04:37:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:44,371 INFO L225 Difference]: With dead ends: 4753 [2019-11-24 04:37:44,371 INFO L226 Difference]: Without dead ends: 2574 [2019-11-24 04:37:44,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-11-24 04:37:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2556. [2019-11-24 04:37:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2019-11-24 04:37:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 4467 transitions. [2019-11-24 04:37:44,497 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 4467 transitions. Word has length 35 [2019-11-24 04:37:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:44,497 INFO L462 AbstractCegarLoop]: Abstraction has 2556 states and 4467 transitions. [2019-11-24 04:37:44,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4467 transitions. [2019-11-24 04:37:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:37:44,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:44,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:44,499 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:44,500 INFO L82 PathProgramCache]: Analyzing trace with hash 617294389, now seen corresponding path program 1 times [2019-11-24 04:37:44,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:44,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679188924] [2019-11-24 04:37:44,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:44,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679188924] [2019-11-24 04:37:44,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:44,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:44,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42390163] [2019-11-24 04:37:44,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:44,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:44,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:44,643 INFO L87 Difference]: Start difference. First operand 2556 states and 4467 transitions. Second operand 3 states. [2019-11-24 04:37:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:45,582 INFO L93 Difference]: Finished difference Result 5342 states and 9223 transitions. [2019-11-24 04:37:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:45,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 04:37:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:45,590 INFO L225 Difference]: With dead ends: 5342 [2019-11-24 04:37:45,590 INFO L226 Difference]: Without dead ends: 3184 [2019-11-24 04:37:45,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-11-24 04:37:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2451. [2019-11-24 04:37:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2019-11-24 04:37:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4187 transitions. [2019-11-24 04:37:45,694 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4187 transitions. Word has length 40 [2019-11-24 04:37:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:45,694 INFO L462 AbstractCegarLoop]: Abstraction has 2451 states and 4187 transitions. [2019-11-24 04:37:45,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4187 transitions. [2019-11-24 04:37:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:37:45,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:45,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:45,696 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:45,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:45,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1649014159, now seen corresponding path program 1 times [2019-11-24 04:37:45,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:45,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658032876] [2019-11-24 04:37:45,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:45,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658032876] [2019-11-24 04:37:45,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:45,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:45,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827910039] [2019-11-24 04:37:45,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:45,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:45,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:45,879 INFO L87 Difference]: Start difference. First operand 2451 states and 4187 transitions. Second operand 3 states. [2019-11-24 04:37:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:46,743 INFO L93 Difference]: Finished difference Result 5133 states and 8689 transitions. [2019-11-24 04:37:46,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:46,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:37:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:46,750 INFO L225 Difference]: With dead ends: 5133 [2019-11-24 04:37:46,751 INFO L226 Difference]: Without dead ends: 3107 [2019-11-24 04:37:46,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2019-11-24 04:37:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2381. [2019-11-24 04:37:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-11-24 04:37:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3942 transitions. [2019-11-24 04:37:46,903 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3942 transitions. Word has length 41 [2019-11-24 04:37:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:46,903 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 3942 transitions. [2019-11-24 04:37:46,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3942 transitions. [2019-11-24 04:37:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:37:46,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:46,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:46,906 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:46,907 INFO L82 PathProgramCache]: Analyzing trace with hash 649262858, now seen corresponding path program 1 times [2019-11-24 04:37:46,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:46,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375256388] [2019-11-24 04:37:46,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:47,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375256388] [2019-11-24 04:37:47,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:47,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:47,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081585613] [2019-11-24 04:37:47,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:47,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:47,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:47,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:47,102 INFO L87 Difference]: Start difference. First operand 2381 states and 3942 transitions. Second operand 3 states. [2019-11-24 04:37:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:48,157 INFO L93 Difference]: Finished difference Result 4989 states and 8220 transitions. [2019-11-24 04:37:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:48,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 04:37:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:48,164 INFO L225 Difference]: With dead ends: 4989 [2019-11-24 04:37:48,164 INFO L226 Difference]: Without dead ends: 3065 [2019-11-24 04:37:48,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2019-11-24 04:37:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2346. [2019-11-24 04:37:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2346 states. [2019-11-24 04:37:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3732 transitions. [2019-11-24 04:37:48,318 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3732 transitions. Word has length 43 [2019-11-24 04:37:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:48,319 INFO L462 AbstractCegarLoop]: Abstraction has 2346 states and 3732 transitions. [2019-11-24 04:37:48,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3732 transitions. [2019-11-24 04:37:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:37:48,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:48,321 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:48,321 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1169659290, now seen corresponding path program 1 times [2019-11-24 04:37:48,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:48,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558588531] [2019-11-24 04:37:48,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:48,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558588531] [2019-11-24 04:37:48,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:48,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:37:48,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033250874] [2019-11-24 04:37:48,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:48,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:48,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:48,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:48,423 INFO L87 Difference]: Start difference. First operand 2346 states and 3732 transitions. Second operand 6 states. [2019-11-24 04:37:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:49,511 INFO L93 Difference]: Finished difference Result 5196 states and 8547 transitions. [2019-11-24 04:37:49,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:37:49,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-24 04:37:49,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:49,521 INFO L225 Difference]: With dead ends: 5196 [2019-11-24 04:37:49,521 INFO L226 Difference]: Without dead ends: 4161 [2019-11-24 04:37:49,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:37:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2019-11-24 04:37:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 3636. [2019-11-24 04:37:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2019-11-24 04:37:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5702 transitions. [2019-11-24 04:37:49,731 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5702 transitions. Word has length 45 [2019-11-24 04:37:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:49,731 INFO L462 AbstractCegarLoop]: Abstraction has 3636 states and 5702 transitions. [2019-11-24 04:37:49,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5702 transitions. [2019-11-24 04:37:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:37:49,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:49,733 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:49,734 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:49,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2036553214, now seen corresponding path program 1 times [2019-11-24 04:37:49,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:49,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600829056] [2019-11-24 04:37:49,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:49,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600829056] [2019-11-24 04:37:49,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:49,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:37:49,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780384244] [2019-11-24 04:37:49,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:49,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:49,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:49,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:49,848 INFO L87 Difference]: Start difference. First operand 3636 states and 5702 transitions. Second operand 6 states. [2019-11-24 04:37:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:50,376 INFO L93 Difference]: Finished difference Result 8453 states and 13213 transitions. [2019-11-24 04:37:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:37:50,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-24 04:37:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:50,382 INFO L225 Difference]: With dead ends: 8453 [2019-11-24 04:37:50,382 INFO L226 Difference]: Without dead ends: 5548 [2019-11-24 04:37:50,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:37:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-11-24 04:37:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 3534. [2019-11-24 04:37:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3534 states. [2019-11-24 04:37:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 5534 transitions. [2019-11-24 04:37:50,644 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 5534 transitions. Word has length 45 [2019-11-24 04:37:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:50,644 INFO L462 AbstractCegarLoop]: Abstraction has 3534 states and 5534 transitions. [2019-11-24 04:37:50,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 5534 transitions. [2019-11-24 04:37:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:37:50,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:50,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:50,646 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:50,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1536869119, now seen corresponding path program 1 times [2019-11-24 04:37:50,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:50,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186297266] [2019-11-24 04:37:50,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:50,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186297266] [2019-11-24 04:37:50,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:50,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:50,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133126758] [2019-11-24 04:37:50,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:50,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:50,846 INFO L87 Difference]: Start difference. First operand 3534 states and 5534 transitions. Second operand 3 states. [2019-11-24 04:37:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:51,635 INFO L93 Difference]: Finished difference Result 6470 states and 10123 transitions. [2019-11-24 04:37:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:51,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-24 04:37:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:51,640 INFO L225 Difference]: With dead ends: 6470 [2019-11-24 04:37:51,640 INFO L226 Difference]: Without dead ends: 3560 [2019-11-24 04:37:51,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2019-11-24 04:37:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3534. [2019-11-24 04:37:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3534 states. [2019-11-24 04:37:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 5259 transitions. [2019-11-24 04:37:51,939 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 5259 transitions. Word has length 46 [2019-11-24 04:37:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:51,939 INFO L462 AbstractCegarLoop]: Abstraction has 3534 states and 5259 transitions. [2019-11-24 04:37:51,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 5259 transitions. [2019-11-24 04:37:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:37:51,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:51,941 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:51,941 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash -460373318, now seen corresponding path program 1 times [2019-11-24 04:37:51,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:51,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820735292] [2019-11-24 04:37:51,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:52,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820735292] [2019-11-24 04:37:52,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:52,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:52,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826656372] [2019-11-24 04:37:52,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:52,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:52,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:52,094 INFO L87 Difference]: Start difference. First operand 3534 states and 5259 transitions. Second operand 6 states. [2019-11-24 04:37:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:53,384 INFO L93 Difference]: Finished difference Result 9200 states and 13832 transitions. [2019-11-24 04:37:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:53,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-24 04:37:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:53,390 INFO L225 Difference]: With dead ends: 9200 [2019-11-24 04:37:53,391 INFO L226 Difference]: Without dead ends: 4719 [2019-11-24 04:37:53,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2019-11-24 04:37:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 3534. [2019-11-24 04:37:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3534 states. [2019-11-24 04:37:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 5250 transitions. [2019-11-24 04:37:53,656 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 5250 transitions. Word has length 48 [2019-11-24 04:37:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:53,657 INFO L462 AbstractCegarLoop]: Abstraction has 3534 states and 5250 transitions. [2019-11-24 04:37:53,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 5250 transitions. [2019-11-24 04:37:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:37:53,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:53,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:53,661 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:53,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:53,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1226345604, now seen corresponding path program 1 times [2019-11-24 04:37:53,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:53,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120747364] [2019-11-24 04:37:53,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:53,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120747364] [2019-11-24 04:37:53,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:53,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:53,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146442961] [2019-11-24 04:37:53,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:53,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:53,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:53,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:53,982 INFO L87 Difference]: Start difference. First operand 3534 states and 5250 transitions. Second operand 5 states. [2019-11-24 04:37:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:55,079 INFO L93 Difference]: Finished difference Result 8088 states and 12110 transitions. [2019-11-24 04:37:55,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:55,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-24 04:37:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:55,086 INFO L225 Difference]: With dead ends: 8088 [2019-11-24 04:37:55,087 INFO L226 Difference]: Without dead ends: 4995 [2019-11-24 04:37:55,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-11-24 04:37:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 3090. [2019-11-24 04:37:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-11-24 04:37:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4584 transitions. [2019-11-24 04:37:55,256 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4584 transitions. Word has length 49 [2019-11-24 04:37:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:55,256 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 4584 transitions. [2019-11-24 04:37:55,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4584 transitions. [2019-11-24 04:37:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:37:55,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:55,257 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:55,257 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash -413014591, now seen corresponding path program 1 times [2019-11-24 04:37:55,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:55,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521931742] [2019-11-24 04:37:55,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:55,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521931742] [2019-11-24 04:37:55,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:55,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:37:55,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466438292] [2019-11-24 04:37:55,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:37:55,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:55,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:37:55,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:55,408 INFO L87 Difference]: Start difference. First operand 3090 states and 4584 transitions. Second operand 8 states. [2019-11-24 04:37:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:57,796 INFO L93 Difference]: Finished difference Result 9060 states and 13639 transitions. [2019-11-24 04:37:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 04:37:57,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-24 04:37:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:57,802 INFO L225 Difference]: With dead ends: 9060 [2019-11-24 04:37:57,803 INFO L226 Difference]: Without dead ends: 6211 [2019-11-24 04:37:57,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-11-24 04:37:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6211 states. [2019-11-24 04:37:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6211 to 3522. [2019-11-24 04:37:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-11-24 04:37:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 5214 transitions. [2019-11-24 04:37:58,037 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 5214 transitions. Word has length 49 [2019-11-24 04:37:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:58,037 INFO L462 AbstractCegarLoop]: Abstraction has 3522 states and 5214 transitions. [2019-11-24 04:37:58,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:37:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 5214 transitions. [2019-11-24 04:37:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:37:58,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:58,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:58,038 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1104259703, now seen corresponding path program 1 times [2019-11-24 04:37:58,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:58,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763211395] [2019-11-24 04:37:58,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:58,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763211395] [2019-11-24 04:37:58,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:58,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:58,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630816870] [2019-11-24 04:37:58,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:58,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:58,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:58,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:58,251 INFO L87 Difference]: Start difference. First operand 3522 states and 5214 transitions. Second operand 4 states. [2019-11-24 04:37:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:59,091 INFO L93 Difference]: Finished difference Result 9506 states and 14212 transitions. [2019-11-24 04:37:59,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:59,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 04:37:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:59,098 INFO L225 Difference]: With dead ends: 9506 [2019-11-24 04:37:59,099 INFO L226 Difference]: Without dead ends: 6081 [2019-11-24 04:37:59,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2019-11-24 04:37:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 3384. [2019-11-24 04:37:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2019-11-24 04:37:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 5018 transitions. [2019-11-24 04:37:59,337 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 5018 transitions. Word has length 50 [2019-11-24 04:37:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:59,337 INFO L462 AbstractCegarLoop]: Abstraction has 3384 states and 5018 transitions. [2019-11-24 04:37:59,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 5018 transitions. [2019-11-24 04:37:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:37:59,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:59,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:59,339 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1321296762, now seen corresponding path program 1 times [2019-11-24 04:37:59,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:59,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161150004] [2019-11-24 04:37:59,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:59,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161150004] [2019-11-24 04:37:59,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:59,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:59,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138668420] [2019-11-24 04:37:59,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:59,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:59,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:59,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:59,886 INFO L87 Difference]: Start difference. First operand 3384 states and 5018 transitions. Second operand 4 states. [2019-11-24 04:38:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:00,836 INFO L93 Difference]: Finished difference Result 9352 states and 13948 transitions. [2019-11-24 04:38:00,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:00,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 04:38:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:00,847 INFO L225 Difference]: With dead ends: 9352 [2019-11-24 04:38:00,847 INFO L226 Difference]: Without dead ends: 6063 [2019-11-24 04:38:00,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2019-11-24 04:38:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3384. [2019-11-24 04:38:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2019-11-24 04:38:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 5016 transitions. [2019-11-24 04:38:01,100 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 5016 transitions. Word has length 50 [2019-11-24 04:38:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:01,100 INFO L462 AbstractCegarLoop]: Abstraction has 3384 states and 5016 transitions. [2019-11-24 04:38:01,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:38:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 5016 transitions. [2019-11-24 04:38:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:38:01,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:01,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:01,101 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1473067259, now seen corresponding path program 1 times [2019-11-24 04:38:01,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:01,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277627731] [2019-11-24 04:38:01,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:38:02,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277627731] [2019-11-24 04:38:02,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:02,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-24 04:38:02,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036239241] [2019-11-24 04:38:02,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-24 04:38:02,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:02,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-24 04:38:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-11-24 04:38:02,096 INFO L87 Difference]: Start difference. First operand 3384 states and 5016 transitions. Second operand 20 states. [2019-11-24 04:38:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:05,996 INFO L93 Difference]: Finished difference Result 7002 states and 10565 transitions. [2019-11-24 04:38:05,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 04:38:05,996 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-11-24 04:38:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:06,001 INFO L225 Difference]: With dead ends: 7002 [2019-11-24 04:38:06,001 INFO L226 Difference]: Without dead ends: 4325 [2019-11-24 04:38:06,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:38:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4325 states. [2019-11-24 04:38:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4325 to 4150. [2019-11-24 04:38:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4150 states. [2019-11-24 04:38:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 6191 transitions. [2019-11-24 04:38:06,336 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 6191 transitions. Word has length 51 [2019-11-24 04:38:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:06,336 INFO L462 AbstractCegarLoop]: Abstraction has 4150 states and 6191 transitions. [2019-11-24 04:38:06,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-24 04:38:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 6191 transitions. [2019-11-24 04:38:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 04:38:06,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:06,337 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:06,337 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2014842650, now seen corresponding path program 1 times [2019-11-24 04:38:06,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:06,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135747405] [2019-11-24 04:38:06,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:38:06,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135747405] [2019-11-24 04:38:06,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:06,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:38:06,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522410215] [2019-11-24 04:38:06,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:38:06,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:06,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:38:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:38:06,483 INFO L87 Difference]: Start difference. First operand 4150 states and 6191 transitions. Second operand 6 states. [2019-11-24 04:38:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:07,988 INFO L93 Difference]: Finished difference Result 8023 states and 12180 transitions. [2019-11-24 04:38:07,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:38:07,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-24 04:38:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:07,993 INFO L225 Difference]: With dead ends: 8023 [2019-11-24 04:38:07,994 INFO L226 Difference]: Without dead ends: 4114 [2019-11-24 04:38:07,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:38:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4114 states. [2019-11-24 04:38:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4114 to 2935. [2019-11-24 04:38:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2935 states. [2019-11-24 04:38:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4374 transitions. [2019-11-24 04:38:08,315 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 4374 transitions. Word has length 70 [2019-11-24 04:38:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:08,315 INFO L462 AbstractCegarLoop]: Abstraction has 2935 states and 4374 transitions. [2019-11-24 04:38:08,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:38:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 4374 transitions. [2019-11-24 04:38:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 04:38:08,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:08,316 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:08,316 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:08,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1984760833, now seen corresponding path program 1 times [2019-11-24 04:38:08,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:08,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313008299] [2019-11-24 04:38:08,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:38:08,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313008299] [2019-11-24 04:38:08,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:08,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:38:08,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370913968] [2019-11-24 04:38:08,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:38:08,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:38:08,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:38:08,498 INFO L87 Difference]: Start difference. First operand 2935 states and 4374 transitions. Second operand 6 states. [2019-11-24 04:38:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:09,387 INFO L93 Difference]: Finished difference Result 6033 states and 9126 transitions. [2019-11-24 04:38:09,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:09,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-24 04:38:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:09,391 INFO L225 Difference]: With dead ends: 6033 [2019-11-24 04:38:09,391 INFO L226 Difference]: Without dead ends: 3825 [2019-11-24 04:38:09,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:38:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-11-24 04:38:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2863. [2019-11-24 04:38:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2863 states. [2019-11-24 04:38:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2863 states and 4262 transitions. [2019-11-24 04:38:09,646 INFO L78 Accepts]: Start accepts. Automaton has 2863 states and 4262 transitions. Word has length 71 [2019-11-24 04:38:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:09,646 INFO L462 AbstractCegarLoop]: Abstraction has 2863 states and 4262 transitions. [2019-11-24 04:38:09,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:38:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4262 transitions. [2019-11-24 04:38:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 04:38:09,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:09,648 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:09,648 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:09,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1273572009, now seen corresponding path program 1 times [2019-11-24 04:38:09,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:09,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939331730] [2019-11-24 04:38:09,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:38:09,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939331730] [2019-11-24 04:38:09,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978920022] [2019-11-24 04:38:09,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:38:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:10,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:38:10,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:38:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:38:10,415 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:38:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:38:10,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1511778076] [2019-11-24 04:38:10,519 INFO L159 IcfgInterpreter]: Started Sifa with 71 locations of interest [2019-11-24 04:38:10,520 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:38:10,526 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:38:10,533 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:38:10,533 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs