/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:40:53,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:40:53,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:40:53,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:40:53,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:40:53,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:40:53,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:40:53,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:40:53,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:40:53,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:40:53,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:40:53,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:40:53,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:40:53,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:40:53,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:40:53,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:40:53,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:40:53,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:40:53,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:40:53,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:40:53,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:40:53,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:40:53,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:40:53,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:40:53,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:40:53,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:40:53,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:40:53,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:40:53,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:40:53,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:40:53,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:40:53,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:40:53,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:40:53,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:40:53,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:40:53,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:40:53,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:40:53,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:40:53,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:40:53,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:40:53,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:40:53,482 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:40:53,515 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:40:53,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:40:53,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:40:53,517 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:40:53,517 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:40:53,517 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:40:53,518 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:40:53,518 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:40:53,518 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:40:53,518 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:40:53,518 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:40:53,519 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:40:53,522 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:40:53,522 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:40:53,522 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:40:53,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:40:53,523 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:40:53,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:40:53,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:40:53,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:40:53,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:40:53,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:40:53,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:40:53,525 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:40:53,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:40:53,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:40:53,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:40:53,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:40:53,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:40:53,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:40:53,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:40:53,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:40:53,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:40:53,529 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:40:53,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:40:53,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:40:53,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:40:53,531 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:40:53,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:40:53,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:40:53,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:40:53,859 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:40:53,859 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:40:53,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-11-24 04:40:53,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513d07795/1c68986c8d3d4c8ca096fc9f24269191/FLAG7dac7e400 [2019-11-24 04:40:54,535 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:40:54,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-11-24 04:40:54,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513d07795/1c68986c8d3d4c8ca096fc9f24269191/FLAG7dac7e400 [2019-11-24 04:40:54,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513d07795/1c68986c8d3d4c8ca096fc9f24269191 [2019-11-24 04:40:54,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:40:54,747 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:40:54,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:40:54,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:40:54,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:40:54,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:40:54" (1/1) ... [2019-11-24 04:40:54,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c564f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:54, skipping insertion in model container [2019-11-24 04:40:54,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:40:54" (1/1) ... [2019-11-24 04:40:54,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:40:54,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:40:55,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:40:55,527 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:40:55,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:40:55,710 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:40:55,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55 WrapperNode [2019-11-24 04:40:55,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:40:55,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:40:55,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:40:55,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:40:55,718 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:40:55" (1/1) ... [2019-11-24 04:40:55,765 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:40:55" (1/1) ... [2019-11-24 04:40:55,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:40:55,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:40:55,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:40:55,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:40:55,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (1/1) ... [2019-11-24 04:40:55,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (1/1) ... [2019-11-24 04:40:55,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (1/1) ... [2019-11-24 04:40:55,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (1/1) ... [2019-11-24 04:40:56,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (1/1) ... [2019-11-24 04:40:56,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (1/1) ... [2019-11-24 04:40:56,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (1/1) ... [2019-11-24 04:40:56,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:40:56,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:40:56,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:40:56,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:40:56,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (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:40:56,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:40:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:40:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:40:56,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:41:21,179 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:41:21,180 INFO L284 CfgBuilder]: Removed 553 assume(true) statements. [2019-11-24 04:41:21,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:21 BoogieIcfgContainer [2019-11-24 04:41:21,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:41:21,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:41:21,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:41:21,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:41:21,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:40:54" (1/3) ... [2019-11-24 04:41:21,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a931588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:21, skipping insertion in model container [2019-11-24 04:41:21,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:55" (2/3) ... [2019-11-24 04:41:21,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a931588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:21, skipping insertion in model container [2019-11-24 04:41:21,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:21" (3/3) ... [2019-11-24 04:41:21,198 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2019-11-24 04:41:21,208 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:41:21,220 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:41:21,233 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:41:21,294 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:41:21,294 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:41:21,294 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:41:21,295 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:41:21,295 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:41:21,295 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:41:21,296 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:41:21,296 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:41:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-11-24 04:41:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:41:21,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:21,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:21,384 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2128216520, now seen corresponding path program 1 times [2019-11-24 04:41:21,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:21,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181471400] [2019-11-24 04:41:21,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:22,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181471400] [2019-11-24 04:41:22,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:22,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:22,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388593002] [2019-11-24 04:41:22,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:22,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:22,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:22,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:22,111 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 4 states. [2019-11-24 04:41:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:22,818 INFO L93 Difference]: Finished difference Result 1843 states and 3518 transitions. [2019-11-24 04:41:22,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:22,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:41:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:22,871 INFO L225 Difference]: With dead ends: 1843 [2019-11-24 04:41:22,872 INFO L226 Difference]: Without dead ends: 1351 [2019-11-24 04:41:22,891 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:41:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-24 04:41:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 968. [2019-11-24 04:41:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-24 04:41:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1855 transitions. [2019-11-24 04:41:23,091 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1855 transitions. Word has length 15 [2019-11-24 04:41:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:23,092 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1855 transitions. [2019-11-24 04:41:23,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1855 transitions. [2019-11-24 04:41:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:41:23,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:23,103 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:41:23,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:23,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1337605241, now seen corresponding path program 1 times [2019-11-24 04:41:23,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:23,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498773760] [2019-11-24 04:41:23,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:23,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498773760] [2019-11-24 04:41:23,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:23,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:23,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434331661] [2019-11-24 04:41:23,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:23,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:23,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:23,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:23,358 INFO L87 Difference]: Start difference. First operand 968 states and 1855 transitions. Second operand 4 states. [2019-11-24 04:41:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:23,694 INFO L93 Difference]: Finished difference Result 1722 states and 3240 transitions. [2019-11-24 04:41:23,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:23,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:41:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:23,705 INFO L225 Difference]: With dead ends: 1722 [2019-11-24 04:41:23,706 INFO L226 Difference]: Without dead ends: 1329 [2019-11-24 04:41:23,708 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:41:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-11-24 04:41:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 972. [2019-11-24 04:41:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-24 04:41:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1859 transitions. [2019-11-24 04:41:23,755 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1859 transitions. Word has length 16 [2019-11-24 04:41:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:23,755 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1859 transitions. [2019-11-24 04:41:23,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1859 transitions. [2019-11-24 04:41:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:41:23,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:23,758 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:41:23,758 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:23,759 INFO L82 PathProgramCache]: Analyzing trace with hash 61617441, now seen corresponding path program 1 times [2019-11-24 04:41:23,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:23,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857030356] [2019-11-24 04:41:23,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:23,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857030356] [2019-11-24 04:41:23,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:23,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:23,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996288024] [2019-11-24 04:41:23,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:23,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:23,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:23,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:23,895 INFO L87 Difference]: Start difference. First operand 972 states and 1859 transitions. Second operand 3 states. [2019-11-24 04:41:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:24,323 INFO L93 Difference]: Finished difference Result 1608 states and 3067 transitions. [2019-11-24 04:41:24,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:24,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:41:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:24,342 INFO L225 Difference]: With dead ends: 1608 [2019-11-24 04:41:24,351 INFO L226 Difference]: Without dead ends: 1216 [2019-11-24 04:41:24,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-11-24 04:41:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1142. [2019-11-24 04:41:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-11-24 04:41:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 2178 transitions. [2019-11-24 04:41:24,421 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 2178 transitions. Word has length 19 [2019-11-24 04:41:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:24,422 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 2178 transitions. [2019-11-24 04:41:24,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 2178 transitions. [2019-11-24 04:41:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:41:24,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:24,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:24,426 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:24,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:24,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1316453003, now seen corresponding path program 1 times [2019-11-24 04:41:24,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:24,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106302583] [2019-11-24 04:41:24,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:24,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106302583] [2019-11-24 04:41:24,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:24,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:24,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653600581] [2019-11-24 04:41:24,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:24,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:24,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:24,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:24,613 INFO L87 Difference]: Start difference. First operand 1142 states and 2178 transitions. Second operand 3 states. [2019-11-24 04:41:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:25,111 INFO L93 Difference]: Finished difference Result 2227 states and 4239 transitions. [2019-11-24 04:41:25,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:25,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:41:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:25,127 INFO L225 Difference]: With dead ends: 2227 [2019-11-24 04:41:25,128 INFO L226 Difference]: Without dead ends: 1695 [2019-11-24 04:41:25,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-11-24 04:41:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1471. [2019-11-24 04:41:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-24 04:41:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2794 transitions. [2019-11-24 04:41:25,234 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2794 transitions. Word has length 21 [2019-11-24 04:41:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:25,234 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2794 transitions. [2019-11-24 04:41:25,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2794 transitions. [2019-11-24 04:41:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:41:25,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:25,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:25,239 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:25,240 INFO L82 PathProgramCache]: Analyzing trace with hash 424554401, now seen corresponding path program 1 times [2019-11-24 04:41:25,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:25,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778005317] [2019-11-24 04:41:25,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:25,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778005317] [2019-11-24 04:41:25,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:25,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:25,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409348424] [2019-11-24 04:41:25,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:25,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:25,481 INFO L87 Difference]: Start difference. First operand 1471 states and 2794 transitions. Second operand 5 states. [2019-11-24 04:41:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:25,831 INFO L93 Difference]: Finished difference Result 2919 states and 5486 transitions. [2019-11-24 04:41:25,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:25,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:41:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:25,846 INFO L225 Difference]: With dead ends: 2919 [2019-11-24 04:41:25,846 INFO L226 Difference]: Without dead ends: 2067 [2019-11-24 04:41:25,849 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:41:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-11-24 04:41:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1578. [2019-11-24 04:41:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2019-11-24 04:41:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2988 transitions. [2019-11-24 04:41:25,982 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2988 transitions. Word has length 23 [2019-11-24 04:41:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:25,983 INFO L462 AbstractCegarLoop]: Abstraction has 1578 states and 2988 transitions. [2019-11-24 04:41:25,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2988 transitions. [2019-11-24 04:41:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:41:25,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:25,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:25,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:25,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash 318916221, now seen corresponding path program 1 times [2019-11-24 04:41:25,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:25,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501768590] [2019-11-24 04:41:25,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:26,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501768590] [2019-11-24 04:41:26,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:26,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:26,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33087063] [2019-11-24 04:41:26,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:26,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:26,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:26,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:26,160 INFO L87 Difference]: Start difference. First operand 1578 states and 2988 transitions. Second operand 3 states. [2019-11-24 04:41:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:26,549 INFO L93 Difference]: Finished difference Result 2826 states and 5345 transitions. [2019-11-24 04:41:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:26,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:41:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:26,560 INFO L225 Difference]: With dead ends: 2826 [2019-11-24 04:41:26,560 INFO L226 Difference]: Without dead ends: 1563 [2019-11-24 04:41:26,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-11-24 04:41:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2019-11-24 04:41:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-11-24 04:41:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2947 transitions. [2019-11-24 04:41:26,643 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2947 transitions. Word has length 23 [2019-11-24 04:41:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:26,643 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2947 transitions. [2019-11-24 04:41:26,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2947 transitions. [2019-11-24 04:41:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:41:26,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:26,645 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:41:26,645 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:26,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1553696217, now seen corresponding path program 1 times [2019-11-24 04:41:26,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:26,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813661757] [2019-11-24 04:41:26,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:26,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813661757] [2019-11-24 04:41:26,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:26,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:26,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859949788] [2019-11-24 04:41:26,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:26,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:26,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:26,738 INFO L87 Difference]: Start difference. First operand 1563 states and 2947 transitions. Second operand 3 states. [2019-11-24 04:41:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:27,108 INFO L93 Difference]: Finished difference Result 3412 states and 6432 transitions. [2019-11-24 04:41:27,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:27,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:41:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:27,123 INFO L225 Difference]: With dead ends: 3412 [2019-11-24 04:41:27,123 INFO L226 Difference]: Without dead ends: 2606 [2019-11-24 04:41:27,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-11-24 04:41:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2306. [2019-11-24 04:41:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-11-24 04:41:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 4323 transitions. [2019-11-24 04:41:27,248 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 4323 transitions. Word has length 24 [2019-11-24 04:41:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:27,248 INFO L462 AbstractCegarLoop]: Abstraction has 2306 states and 4323 transitions. [2019-11-24 04:41:27,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 4323 transitions. [2019-11-24 04:41:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:41:27,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:27,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:27,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash -919924928, now seen corresponding path program 1 times [2019-11-24 04:41:27,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:27,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717171882] [2019-11-24 04:41:27,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:27,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717171882] [2019-11-24 04:41:27,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:27,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:27,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277196557] [2019-11-24 04:41:27,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:27,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:27,334 INFO L87 Difference]: Start difference. First operand 2306 states and 4323 transitions. Second operand 3 states. [2019-11-24 04:41:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:27,621 INFO L93 Difference]: Finished difference Result 2306 states and 4323 transitions. [2019-11-24 04:41:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:27,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:41:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:27,637 INFO L225 Difference]: With dead ends: 2306 [2019-11-24 04:41:27,637 INFO L226 Difference]: Without dead ends: 2299 [2019-11-24 04:41:27,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-11-24 04:41:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2019-11-24 04:41:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-11-24 04:41:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 4308 transitions. [2019-11-24 04:41:27,747 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 4308 transitions. Word has length 25 [2019-11-24 04:41:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:27,749 INFO L462 AbstractCegarLoop]: Abstraction has 2299 states and 4308 transitions. [2019-11-24 04:41:27,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 4308 transitions. [2019-11-24 04:41:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:41:27,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:27,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:27,753 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:27,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash 151678828, now seen corresponding path program 1 times [2019-11-24 04:41:27,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:27,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611894119] [2019-11-24 04:41:27,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:28,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611894119] [2019-11-24 04:41:28,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:28,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:28,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639107650] [2019-11-24 04:41:28,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:28,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:28,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:28,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:28,041 INFO L87 Difference]: Start difference. First operand 2299 states and 4308 transitions. Second operand 4 states. [2019-11-24 04:41:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:29,177 INFO L93 Difference]: Finished difference Result 4591 states and 8597 transitions. [2019-11-24 04:41:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:29,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-24 04:41:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:29,191 INFO L225 Difference]: With dead ends: 4591 [2019-11-24 04:41:29,191 INFO L226 Difference]: Without dead ends: 2444 [2019-11-24 04:41:29,195 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:41:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2019-11-24 04:41:29,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2299. [2019-11-24 04:41:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-11-24 04:41:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 4233 transitions. [2019-11-24 04:41:29,310 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 4233 transitions. Word has length 31 [2019-11-24 04:41:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:29,310 INFO L462 AbstractCegarLoop]: Abstraction has 2299 states and 4233 transitions. [2019-11-24 04:41:29,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 4233 transitions. [2019-11-24 04:41:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:41:29,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:29,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:29,313 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:29,313 INFO L82 PathProgramCache]: Analyzing trace with hash 737998423, now seen corresponding path program 1 times [2019-11-24 04:41:29,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:29,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418421376] [2019-11-24 04:41:29,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:29,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418421376] [2019-11-24 04:41:29,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:29,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:29,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046768238] [2019-11-24 04:41:29,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:29,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:29,507 INFO L87 Difference]: Start difference. First operand 2299 states and 4233 transitions. Second operand 3 states. [2019-11-24 04:41:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:30,582 INFO L93 Difference]: Finished difference Result 5949 states and 10947 transitions. [2019-11-24 04:41:30,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:30,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:41:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:30,603 INFO L225 Difference]: With dead ends: 5949 [2019-11-24 04:41:30,603 INFO L226 Difference]: Without dead ends: 3823 [2019-11-24 04:41:30,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2019-11-24 04:41:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 2254. [2019-11-24 04:41:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-11-24 04:41:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 4113 transitions. [2019-11-24 04:41:30,754 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 4113 transitions. Word has length 36 [2019-11-24 04:41:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:30,754 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 4113 transitions. [2019-11-24 04:41:30,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 4113 transitions. [2019-11-24 04:41:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:41:30,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:30,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:30,758 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:41:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1610428651, now seen corresponding path program 1 times [2019-11-24 04:41:30,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:30,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436411515] [2019-11-24 04:41:30,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:30,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436411515] [2019-11-24 04:41:30,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:30,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:30,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689354391] [2019-11-24 04:41:30,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:30,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:30,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:30,991 INFO L87 Difference]: Start difference. First operand 2254 states and 4113 transitions. Second operand 3 states. [2019-11-24 04:41:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:32,036 INFO L93 Difference]: Finished difference Result 5844 states and 10697 transitions. [2019-11-24 04:41:32,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:32,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:41:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:32,070 INFO L225 Difference]: With dead ends: 5844 [2019-11-24 04:41:32,074 INFO L226 Difference]: Without dead ends: 3790 [2019-11-24 04:41:32,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2019-11-24 04:41:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 2224. [2019-11-24 04:41:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2019-11-24 04:41:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 4008 transitions. [2019-11-24 04:41:32,237 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 4008 transitions. Word has length 37 [2019-11-24 04:41:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:32,238 INFO L462 AbstractCegarLoop]: Abstraction has 2224 states and 4008 transitions. [2019-11-24 04:41:32,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 4008 transitions. [2019-11-24 04:41:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:41:32,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:32,241 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:32,241 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:41:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1668206032, now seen corresponding path program 1 times [2019-11-24 04:41:32,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:32,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428059520] [2019-11-24 04:41:32,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:32,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428059520] [2019-11-24 04:41:32,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:32,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:32,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743530639] [2019-11-24 04:41:32,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:32,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:32,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:32,542 INFO L87 Difference]: Start difference. First operand 2224 states and 4008 transitions. Second operand 3 states. [2019-11-24 04:41:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:33,407 INFO L93 Difference]: Finished difference Result 5764 states and 10472 transitions. [2019-11-24 04:41:33,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:33,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:41:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:33,417 INFO L225 Difference]: With dead ends: 5764 [2019-11-24 04:41:33,418 INFO L226 Difference]: Without dead ends: 3772 [2019-11-24 04:41:33,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2019-11-24 04:41:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 2209. [2019-11-24 04:41:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2019-11-24 04:41:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3918 transitions. [2019-11-24 04:41:33,559 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3918 transitions. Word has length 39 [2019-11-24 04:41:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:33,559 INFO L462 AbstractCegarLoop]: Abstraction has 2209 states and 3918 transitions. [2019-11-24 04:41:33,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3918 transitions. [2019-11-24 04:41:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 04:41:33,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:33,561 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] [2019-11-24 04:41:33,562 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:41:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash 373429069, now seen corresponding path program 1 times [2019-11-24 04:41:33,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:33,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065864665] [2019-11-24 04:41:33,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:33,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065864665] [2019-11-24 04:41:33,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:33,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:33,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400673776] [2019-11-24 04:41:33,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:33,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:33,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:33,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:33,787 INFO L87 Difference]: Start difference. First operand 2209 states and 3918 transitions. Second operand 3 states. [2019-11-24 04:41:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:34,573 INFO L93 Difference]: Finished difference Result 4294 states and 7660 transitions. [2019-11-24 04:41:34,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:34,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 04:41:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:34,579 INFO L225 Difference]: With dead ends: 4294 [2019-11-24 04:41:34,580 INFO L226 Difference]: Without dead ends: 2354 [2019-11-24 04:41:34,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2019-11-24 04:41:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2209. [2019-11-24 04:41:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2019-11-24 04:41:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3843 transitions. [2019-11-24 04:41:34,716 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3843 transitions. Word has length 42 [2019-11-24 04:41:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:34,717 INFO L462 AbstractCegarLoop]: Abstraction has 2209 states and 3843 transitions. [2019-11-24 04:41:34,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3843 transitions. [2019-11-24 04:41:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:41:34,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:34,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:34,719 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:41:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1447335075, now seen corresponding path program 1 times [2019-11-24 04:41:34,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:34,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228062457] [2019-11-24 04:41:34,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:35,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228062457] [2019-11-24 04:41:35,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:35,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:35,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367216711] [2019-11-24 04:41:35,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:35,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:35,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:35,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:35,090 INFO L87 Difference]: Start difference. First operand 2209 states and 3843 transitions. Second operand 5 states. [2019-11-24 04:41:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:36,231 INFO L93 Difference]: Finished difference Result 7073 states and 12769 transitions. [2019-11-24 04:41:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:41:36,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:41:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:36,242 INFO L225 Difference]: With dead ends: 7073 [2019-11-24 04:41:36,243 INFO L226 Difference]: Without dead ends: 4879 [2019-11-24 04:41:36,247 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:41:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-11-24 04:41:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 2057. [2019-11-24 04:41:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2019-11-24 04:41:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3510 transitions. [2019-11-24 04:41:36,449 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3510 transitions. Word has length 45 [2019-11-24 04:41:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:36,450 INFO L462 AbstractCegarLoop]: Abstraction has 2057 states and 3510 transitions. [2019-11-24 04:41:36,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3510 transitions. [2019-11-24 04:41:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:41:36,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:36,451 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:41:36,452 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:41:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1269595517, now seen corresponding path program 1 times [2019-11-24 04:41:36,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:36,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993609380] [2019-11-24 04:41:36,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:37,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993609380] [2019-11-24 04:41:37,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:37,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:37,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722440737] [2019-11-24 04:41:37,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:37,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:37,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:37,301 INFO L87 Difference]: Start difference. First operand 2057 states and 3510 transitions. Second operand 21 states. [2019-11-24 04:41:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:41,132 INFO L93 Difference]: Finished difference Result 6205 states and 10817 transitions. [2019-11-24 04:41:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:41,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-11-24 04:41:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:41,144 INFO L225 Difference]: With dead ends: 6205 [2019-11-24 04:41:41,144 INFO L226 Difference]: Without dead ends: 4260 [2019-11-24 04:41:41,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2019-11-24 04:41:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 2011. [2019-11-24 04:41:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-11-24 04:41:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 3397 transitions. [2019-11-24 04:41:41,364 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 3397 transitions. Word has length 46 [2019-11-24 04:41:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:41,366 INFO L462 AbstractCegarLoop]: Abstraction has 2011 states and 3397 transitions. [2019-11-24 04:41:41,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 3397 transitions. [2019-11-24 04:41:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:41:41,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:41,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:41,368 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:41:41,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1493073522, now seen corresponding path program 1 times [2019-11-24 04:41:41,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:41,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061271793] [2019-11-24 04:41:41,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:42,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061271793] [2019-11-24 04:41:42,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:42,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:42,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764746008] [2019-11-24 04:41:42,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:42,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:42,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:42,094 INFO L87 Difference]: Start difference. First operand 2011 states and 3397 transitions. Second operand 21 states. [2019-11-24 04:41:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:45,468 INFO L93 Difference]: Finished difference Result 6280 states and 10802 transitions. [2019-11-24 04:41:45,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:45,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2019-11-24 04:41:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:45,478 INFO L225 Difference]: With dead ends: 6280 [2019-11-24 04:41:45,478 INFO L226 Difference]: Without dead ends: 4369 [2019-11-24 04:41:45,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2019-11-24 04:41:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 2179. [2019-11-24 04:41:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2179 states. [2019-11-24 04:41:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3627 transitions. [2019-11-24 04:41:45,773 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3627 transitions. Word has length 48 [2019-11-24 04:41:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:45,774 INFO L462 AbstractCegarLoop]: Abstraction has 2179 states and 3627 transitions. [2019-11-24 04:41:45,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3627 transitions. [2019-11-24 04:41:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:41:45,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:45,775 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:41:45,776 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:41:45,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:45,776 INFO L82 PathProgramCache]: Analyzing trace with hash 325138587, now seen corresponding path program 1 times [2019-11-24 04:41:45,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:45,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449283526] [2019-11-24 04:41:45,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:46,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449283526] [2019-11-24 04:41:46,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:46,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:46,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026258264] [2019-11-24 04:41:46,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:46,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:46,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:46,513 INFO L87 Difference]: Start difference. First operand 2179 states and 3627 transitions. Second operand 21 states. [2019-11-24 04:41:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:49,218 INFO L93 Difference]: Finished difference Result 6231 states and 10429 transitions. [2019-11-24 04:41:49,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:49,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-11-24 04:41:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:49,222 INFO L225 Difference]: With dead ends: 6231 [2019-11-24 04:41:49,223 INFO L226 Difference]: Without dead ends: 4149 [2019-11-24 04:41:49,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2019-11-24 04:41:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 2561. [2019-11-24 04:41:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2561 states. [2019-11-24 04:41:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4213 transitions. [2019-11-24 04:41:49,516 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4213 transitions. Word has length 50 [2019-11-24 04:41:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:49,516 INFO L462 AbstractCegarLoop]: Abstraction has 2561 states and 4213 transitions. [2019-11-24 04:41:49,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4213 transitions. [2019-11-24 04:41:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 04:41:49,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:49,519 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] [2019-11-24 04:41:49,520 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:41:49,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:49,520 INFO L82 PathProgramCache]: Analyzing trace with hash -792265697, now seen corresponding path program 1 times [2019-11-24 04:41:49,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:49,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211002430] [2019-11-24 04:41:49,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:49,687 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:41:49,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211002430] [2019-11-24 04:41:49,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:49,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:49,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007735929] [2019-11-24 04:41:49,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:49,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:49,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:49,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:49,690 INFO L87 Difference]: Start difference. First operand 2561 states and 4213 transitions. Second operand 5 states. [2019-11-24 04:41:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:50,597 INFO L93 Difference]: Finished difference Result 6534 states and 11062 transitions. [2019-11-24 04:41:50,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:50,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-24 04:41:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:50,602 INFO L225 Difference]: With dead ends: 6534 [2019-11-24 04:41:50,603 INFO L226 Difference]: Without dead ends: 4166 [2019-11-24 04:41:50,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-11-24 04:41:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 2643. [2019-11-24 04:41:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-11-24 04:41:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4295 transitions. [2019-11-24 04:41:51,080 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4295 transitions. Word has length 66 [2019-11-24 04:41:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:51,080 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 4295 transitions. [2019-11-24 04:41:51,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4295 transitions. [2019-11-24 04:41:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:41:51,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:51,085 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] [2019-11-24 04:41:51,085 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:41:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:51,086 INFO L82 PathProgramCache]: Analyzing trace with hash -462021932, now seen corresponding path program 1 times [2019-11-24 04:41:51,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:51,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914296687] [2019-11-24 04:41:51,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:51,289 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:41:51,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914296687] [2019-11-24 04:41:51,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:51,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:41:51,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486963331] [2019-11-24 04:41:51,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:41:51,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:51,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:41:51,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:51,293 INFO L87 Difference]: Start difference. First operand 2643 states and 4295 transitions. Second operand 6 states. [2019-11-24 04:41:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:52,168 INFO L93 Difference]: Finished difference Result 6616 states and 11104 transitions. [2019-11-24 04:41:52,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:52,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-24 04:41:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:52,174 INFO L225 Difference]: With dead ends: 6616 [2019-11-24 04:41:52,174 INFO L226 Difference]: Without dead ends: 4166 [2019-11-24 04:41:52,177 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:41:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-11-24 04:41:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 2643. [2019-11-24 04:41:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-11-24 04:41:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4255 transitions. [2019-11-24 04:41:52,418 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4255 transitions. Word has length 67 [2019-11-24 04:41:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:52,418 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 4255 transitions. [2019-11-24 04:41:52,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:41:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4255 transitions. [2019-11-24 04:41:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 04:41:52,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:52,421 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] [2019-11-24 04:41:52,421 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:41:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1394193332, now seen corresponding path program 1 times [2019-11-24 04:41:52,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:52,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754763928] [2019-11-24 04:41:52,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:52,651 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:41:52,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754763928] [2019-11-24 04:41:52,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:52,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:52,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66897580] [2019-11-24 04:41:52,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:52,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:52,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:52,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:52,653 INFO L87 Difference]: Start difference. First operand 2643 states and 4255 transitions. Second operand 5 states. [2019-11-24 04:41:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:53,671 INFO L93 Difference]: Finished difference Result 6680 states and 11110 transitions. [2019-11-24 04:41:53,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:53,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-24 04:41:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:53,678 INFO L225 Difference]: With dead ends: 6680 [2019-11-24 04:41:53,678 INFO L226 Difference]: Without dead ends: 4230 [2019-11-24 04:41:53,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2019-11-24 04:41:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 2618. [2019-11-24 04:41:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2618 states. [2019-11-24 04:41:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 4203 transitions. [2019-11-24 04:41:53,995 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 4203 transitions. Word has length 68 [2019-11-24 04:41:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:53,996 INFO L462 AbstractCegarLoop]: Abstraction has 2618 states and 4203 transitions. [2019-11-24 04:41:53,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 4203 transitions. [2019-11-24 04:41:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 04:41:53,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:53,998 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:41:53,998 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:41:53,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1166899198, now seen corresponding path program 1 times [2019-11-24 04:41:53,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:53,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095122078] [2019-11-24 04:41:53,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:54,253 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:41:54,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095122078] [2019-11-24 04:41:54,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:54,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:41:54,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809395263] [2019-11-24 04:41:54,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:41:54,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:54,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:41:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:54,259 INFO L87 Difference]: Start difference. First operand 2618 states and 4203 transitions. Second operand 6 states. [2019-11-24 04:41:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:55,898 INFO L93 Difference]: Finished difference Result 8586 states and 14112 transitions. [2019-11-24 04:41:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:55,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-24 04:41:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:55,904 INFO L225 Difference]: With dead ends: 8586 [2019-11-24 04:41:55,904 INFO L226 Difference]: Without dead ends: 6161 [2019-11-24 04:41:55,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:41:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6161 states. [2019-11-24 04:41:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6161 to 3026. [2019-11-24 04:41:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3026 states. [2019-11-24 04:41:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 4896 transitions. [2019-11-24 04:41:56,254 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 4896 transitions. Word has length 71 [2019-11-24 04:41:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:56,254 INFO L462 AbstractCegarLoop]: Abstraction has 3026 states and 4896 transitions. [2019-11-24 04:41:56,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:41:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 4896 transitions. [2019-11-24 04:41:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 04:41:56,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:56,256 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:41:56,257 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:41:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash 845661076, now seen corresponding path program 1 times [2019-11-24 04:41:56,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:56,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543406341] [2019-11-24 04:41:56,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:56,983 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:41:56,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543406341] [2019-11-24 04:41:56,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:56,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:41:56,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326820540] [2019-11-24 04:41:56,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:41:56,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:41:56,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:41:56,986 INFO L87 Difference]: Start difference. First operand 3026 states and 4896 transitions. Second operand 22 states. [2019-11-24 04:42:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:04,188 INFO L93 Difference]: Finished difference Result 10884 states and 17999 transitions. [2019-11-24 04:42:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-24 04:42:04,188 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2019-11-24 04:42:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:04,197 INFO L225 Difference]: With dead ends: 10884 [2019-11-24 04:42:04,197 INFO L226 Difference]: Without dead ends: 8049 [2019-11-24 04:42:04,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=571, Invalid=1591, Unknown=0, NotChecked=0, Total=2162 [2019-11-24 04:42:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8049 states. [2019-11-24 04:42:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8049 to 5048. [2019-11-24 04:42:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5048 states. [2019-11-24 04:42:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 8455 transitions. [2019-11-24 04:42:04,901 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 8455 transitions. Word has length 71 [2019-11-24 04:42:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:04,901 INFO L462 AbstractCegarLoop]: Abstraction has 5048 states and 8455 transitions. [2019-11-24 04:42:04,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:42:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 8455 transitions. [2019-11-24 04:42:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 04:42:04,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:04,904 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:04,904 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:42:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:04,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1677544174, now seen corresponding path program 1 times [2019-11-24 04:42:04,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:04,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129645720] [2019-11-24 04:42:04,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:42:05,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129645720] [2019-11-24 04:42:05,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:05,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:05,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319370023] [2019-11-24 04:42:05,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:05,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:05,131 INFO L87 Difference]: Start difference. First operand 5048 states and 8455 transitions. Second operand 5 states. [2019-11-24 04:42:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:06,744 INFO L93 Difference]: Finished difference Result 11921 states and 20268 transitions. [2019-11-24 04:42:06,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:42:06,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-24 04:42:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:06,754 INFO L225 Difference]: With dead ends: 11921 [2019-11-24 04:42:06,754 INFO L226 Difference]: Without dead ends: 7066 [2019-11-24 04:42:06,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:42:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7066 states. [2019-11-24 04:42:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7066 to 5004. [2019-11-24 04:42:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5004 states. [2019-11-24 04:42:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 8366 transitions. [2019-11-24 04:42:07,457 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 8366 transitions. Word has length 71 [2019-11-24 04:42:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:07,457 INFO L462 AbstractCegarLoop]: Abstraction has 5004 states and 8366 transitions. [2019-11-24 04:42:07,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 8366 transitions. [2019-11-24 04:42:07,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 04:42:07,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:07,460 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:07,460 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:42:07,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:07,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1380563112, now seen corresponding path program 1 times [2019-11-24 04:42:07,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:07,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92243255] [2019-11-24 04:42:07,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:42:07,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92243255] [2019-11-24 04:42:07,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:07,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:07,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553300354] [2019-11-24 04:42:07,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:07,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:07,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:07,710 INFO L87 Difference]: Start difference. First operand 5004 states and 8366 transitions. Second operand 5 states.