/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/eca-rers2012/Problem03_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:35:45,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:35:45,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:35:45,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:35:45,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:35:45,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:35:45,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:35:45,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:35:45,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:35:45,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:35:45,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:35:45,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:35:45,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:35:45,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:35:45,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:35:45,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:35:45,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:35:45,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:35:45,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:35:45,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:35:45,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:35:45,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:35:45,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:35:45,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:35:45,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:35:45,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:35:45,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:35:45,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:35:45,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:35:45,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:35:45,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:35:45,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:35:45,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:35:45,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:35:45,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:35:45,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:35:45,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:35:45,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:35:45,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:35:45,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:35:45,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:35:45,288 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-23 23:35:45,303 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:35:45,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:35:45,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:35:45,305 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:35:45,305 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:35:45,305 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:35:45,305 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:35:45,306 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:35:45,306 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:35:45,306 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:35:45,306 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:35:45,306 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:35:45,307 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:35:45,307 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:35:45,307 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:35:45,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:35:45,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:35:45,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:35:45,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:35:45,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:35:45,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:35:45,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:35:45,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:35:45,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:35:45,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:35:45,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:35:45,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:35:45,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:35:45,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:35:45,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:35:45,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:35:45,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:35:45,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:35:45,311 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:35:45,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:35:45,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:35:45,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:35:45,312 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:35:45,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:35:45,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:35:45,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:35:45,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:35:45,632 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:35:45,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label43.c [2019-11-23 23:35:45,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9979bba0c/a4fe4cd19c2e424b8d17c8028b46de67/FLAGc7f5807de [2019-11-23 23:35:46,406 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:35:46,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label43.c [2019-11-23 23:35:46,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9979bba0c/a4fe4cd19c2e424b8d17c8028b46de67/FLAGc7f5807de [2019-11-23 23:35:46,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9979bba0c/a4fe4cd19c2e424b8d17c8028b46de67 [2019-11-23 23:35:46,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:35:46,585 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:35:46,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:46,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:35:46,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:35:46,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:46" (1/1) ... [2019-11-23 23:35:46,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1aceb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:46, skipping insertion in model container [2019-11-23 23:35:46,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:46" (1/1) ... [2019-11-23 23:35:46,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:35:46,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:35:47,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:47,444 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:35:47,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:47,741 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:35:47,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47 WrapperNode [2019-11-23 23:35:47,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:47,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:47,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:35:47,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:35:47,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:47,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:35:47,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:35:47,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:35:47,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (1/1) ... [2019-11-23 23:35:47,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:35:48,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:35:48,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:35:48,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:35:48,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (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-23 23:35:48,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:35:48,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:35:51,031 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:35:51,031 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:35:51,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:51 BoogieIcfgContainer [2019-11-23 23:35:51,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:35:51,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:35:51,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:35:51,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:35:51,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:35:46" (1/3) ... [2019-11-23 23:35:51,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c0a9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:51, skipping insertion in model container [2019-11-23 23:35:51,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:47" (2/3) ... [2019-11-23 23:35:51,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c0a9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:51, skipping insertion in model container [2019-11-23 23:35:51,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:51" (3/3) ... [2019-11-23 23:35:51,049 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label43.c [2019-11-23 23:35:51,060 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:35:51,070 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:35:51,084 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:35:51,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:35:51,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:35:51,132 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:35:51,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:35:51,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:35:51,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:35:51,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:35:51,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:35:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:35:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:35:51,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:51,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:51,168 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1467462891, now seen corresponding path program 1 times [2019-11-23 23:35:51,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:51,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345663119] [2019-11-23 23:35:51,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:51,840 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-23 23:35:51,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345663119] [2019-11-23 23:35:51,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:51,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:51,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803946155] [2019-11-23 23:35:51,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:51,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:51,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:51,870 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:35:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:53,460 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:35:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:53,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:35:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:53,481 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:35:53,481 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:35:53,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:35:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:35:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:35:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 555 transitions. [2019-11-23 23:35:53,550 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 555 transitions. Word has length 143 [2019-11-23 23:35:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:53,551 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 555 transitions. [2019-11-23 23:35:53,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 555 transitions. [2019-11-23 23:35:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 23:35:53,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:53,556 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:53,556 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1495663655, now seen corresponding path program 1 times [2019-11-23 23:35:53,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:53,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36431259] [2019-11-23 23:35:53,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:53,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36431259] [2019-11-23 23:35:53,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:53,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:53,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122312771] [2019-11-23 23:35:53,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:53,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:53,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:53,634 INFO L87 Difference]: Start difference. First operand 289 states and 555 transitions. Second operand 3 states. [2019-11-23 23:35:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:54,627 INFO L93 Difference]: Finished difference Result 863 states and 1662 transitions. [2019-11-23 23:35:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:54,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 23:35:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:54,631 INFO L225 Difference]: With dead ends: 863 [2019-11-23 23:35:54,631 INFO L226 Difference]: Without dead ends: 575 [2019-11-23 23:35:54,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-23 23:35:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-23 23:35:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:35:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1022 transitions. [2019-11-23 23:35:54,666 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1022 transitions. Word has length 147 [2019-11-23 23:35:54,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:54,667 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1022 transitions. [2019-11-23 23:35:54,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1022 transitions. [2019-11-23 23:35:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:35:54,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:54,681 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:54,681 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash 732706231, now seen corresponding path program 1 times [2019-11-23 23:35:54,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:54,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301611497] [2019-11-23 23:35:54,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:54,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301611497] [2019-11-23 23:35:54,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:54,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:54,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87315738] [2019-11-23 23:35:54,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:54,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:54,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:54,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:54,813 INFO L87 Difference]: Start difference. First operand 575 states and 1022 transitions. Second operand 4 states. [2019-11-23 23:35:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:56,390 INFO L93 Difference]: Finished difference Result 2295 states and 4084 transitions. [2019-11-23 23:35:56,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:56,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 23:35:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:56,400 INFO L225 Difference]: With dead ends: 2295 [2019-11-23 23:35:56,400 INFO L226 Difference]: Without dead ends: 1721 [2019-11-23 23:35:56,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-23 23:35:56,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1147. [2019-11-23 23:35:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:35:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1898 transitions. [2019-11-23 23:35:56,439 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1898 transitions. Word has length 148 [2019-11-23 23:35:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:56,440 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1898 transitions. [2019-11-23 23:35:56,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1898 transitions. [2019-11-23 23:35:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:35:56,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:56,444 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:56,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1977889868, now seen corresponding path program 1 times [2019-11-23 23:35:56,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:56,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299223400] [2019-11-23 23:35:56,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:56,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299223400] [2019-11-23 23:35:56,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:56,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:56,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382260640] [2019-11-23 23:35:56,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:56,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:56,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:56,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:56,505 INFO L87 Difference]: Start difference. First operand 1147 states and 1898 transitions. Second operand 3 states. [2019-11-23 23:35:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:57,420 INFO L93 Difference]: Finished difference Result 3437 states and 5691 transitions. [2019-11-23 23:35:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:57,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:35:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:57,481 INFO L225 Difference]: With dead ends: 3437 [2019-11-23 23:35:57,482 INFO L226 Difference]: Without dead ends: 2291 [2019-11-23 23:35:57,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-11-23 23:35:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-11-23 23:35:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-11-23 23:35:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3712 transitions. [2019-11-23 23:35:57,551 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3712 transitions. Word has length 151 [2019-11-23 23:35:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:57,551 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 3712 transitions. [2019-11-23 23:35:57,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3712 transitions. [2019-11-23 23:35:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:35:57,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:57,558 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:57,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash 351567601, now seen corresponding path program 1 times [2019-11-23 23:35:57,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:57,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214682867] [2019-11-23 23:35:57,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:57,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214682867] [2019-11-23 23:35:57,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:57,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:57,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565810015] [2019-11-23 23:35:57,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:57,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:57,761 INFO L87 Difference]: Start difference. First operand 2291 states and 3712 transitions. Second operand 3 states. [2019-11-23 23:35:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:58,680 INFO L93 Difference]: Finished difference Result 5439 states and 8930 transitions. [2019-11-23 23:35:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:58,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:35:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:58,698 INFO L225 Difference]: With dead ends: 5439 [2019-11-23 23:35:58,698 INFO L226 Difference]: Without dead ends: 3149 [2019-11-23 23:35:58,702 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-23 23:35:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2019-11-23 23:35:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2019-11-23 23:35:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3149 states. [2019-11-23 23:35:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4987 transitions. [2019-11-23 23:35:58,768 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4987 transitions. Word has length 158 [2019-11-23 23:35:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:58,768 INFO L462 AbstractCegarLoop]: Abstraction has 3149 states and 4987 transitions. [2019-11-23 23:35:58,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4987 transitions. [2019-11-23 23:35:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:35:58,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:58,776 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:58,776 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash -531793474, now seen corresponding path program 1 times [2019-11-23 23:35:58,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:58,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566544625] [2019-11-23 23:35:58,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:58,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566544625] [2019-11-23 23:35:58,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:58,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:58,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559917681] [2019-11-23 23:35:58,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:58,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:58,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:58,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:58,963 INFO L87 Difference]: Start difference. First operand 3149 states and 4987 transitions. Second operand 4 states. [2019-11-23 23:36:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:00,359 INFO L93 Difference]: Finished difference Result 11447 states and 17996 transitions. [2019-11-23 23:36:00,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:00,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-23 23:36:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:00,395 INFO L225 Difference]: With dead ends: 11447 [2019-11-23 23:36:00,396 INFO L226 Difference]: Without dead ends: 8299 [2019-11-23 23:36:00,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2019-11-23 23:36:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 5723. [2019-11-23 23:36:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5723 states. [2019-11-23 23:36:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 8495 transitions. [2019-11-23 23:36:00,544 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 8495 transitions. Word has length 158 [2019-11-23 23:36:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:00,544 INFO L462 AbstractCegarLoop]: Abstraction has 5723 states and 8495 transitions. [2019-11-23 23:36:00,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 8495 transitions. [2019-11-23 23:36:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-23 23:36:00,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:00,560 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:36:00,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:00,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1468850568, now seen corresponding path program 1 times [2019-11-23 23:36:00,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:00,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174515626] [2019-11-23 23:36:00,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:36:00,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174515626] [2019-11-23 23:36:00,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:00,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:00,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254603974] [2019-11-23 23:36:00,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:00,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:00,745 INFO L87 Difference]: Start difference. First operand 5723 states and 8495 transitions. Second operand 3 states. [2019-11-23 23:36:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:01,235 INFO L93 Difference]: Finished difference Result 11016 states and 16378 transitions. [2019-11-23 23:36:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:01,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-23 23:36:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:01,253 INFO L225 Difference]: With dead ends: 11016 [2019-11-23 23:36:01,253 INFO L226 Difference]: Without dead ends: 5294 [2019-11-23 23:36:01,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2019-11-23 23:36:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 5294. [2019-11-23 23:36:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5294 states. [2019-11-23 23:36:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 7702 transitions. [2019-11-23 23:36:01,352 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 7702 transitions. Word has length 176 [2019-11-23 23:36:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:01,352 INFO L462 AbstractCegarLoop]: Abstraction has 5294 states and 7702 transitions. [2019-11-23 23:36:01,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 7702 transitions. [2019-11-23 23:36:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 23:36:01,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:01,362 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:36:01,362 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1485136144, now seen corresponding path program 1 times [2019-11-23 23:36:01,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:01,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069136785] [2019-11-23 23:36:01,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-23 23:36:01,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069136785] [2019-11-23 23:36:01,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:01,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:01,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035066439] [2019-11-23 23:36:01,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:01,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:01,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:01,440 INFO L87 Difference]: Start difference. First operand 5294 states and 7702 transitions. Second operand 3 states. [2019-11-23 23:36:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:02,367 INFO L93 Difference]: Finished difference Result 14305 states and 20721 transitions. [2019-11-23 23:36:02,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:02,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-23 23:36:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:02,406 INFO L225 Difference]: With dead ends: 14305 [2019-11-23 23:36:02,406 INFO L226 Difference]: Without dead ends: 9012 [2019-11-23 23:36:02,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9012 states. [2019-11-23 23:36:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9012 to 8011. [2019-11-23 23:36:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-11-23 23:36:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 10680 transitions. [2019-11-23 23:36:02,621 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 10680 transitions. Word has length 177 [2019-11-23 23:36:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:02,621 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 10680 transitions. [2019-11-23 23:36:02,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 10680 transitions. [2019-11-23 23:36:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-23 23:36:02,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:02,636 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:36:02,637 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1117153086, now seen corresponding path program 1 times [2019-11-23 23:36:02,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:02,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919439805] [2019-11-23 23:36:02,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:02,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919439805] [2019-11-23 23:36:02,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:02,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:02,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120280413] [2019-11-23 23:36:02,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:02,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:02,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:02,789 INFO L87 Difference]: Start difference. First operand 8011 states and 10680 transitions. Second operand 4 states. [2019-11-23 23:36:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:04,134 INFO L93 Difference]: Finished difference Result 18452 states and 24817 transitions. [2019-11-23 23:36:04,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:04,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-23 23:36:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:04,154 INFO L225 Difference]: With dead ends: 18452 [2019-11-23 23:36:04,154 INFO L226 Difference]: Without dead ends: 10442 [2019-11-23 23:36:04,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10442 states. [2019-11-23 23:36:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10442 to 10442. [2019-11-23 23:36:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10442 states. [2019-11-23 23:36:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10442 states to 10442 states and 13054 transitions. [2019-11-23 23:36:04,431 INFO L78 Accepts]: Start accepts. Automaton has 10442 states and 13054 transitions. Word has length 202 [2019-11-23 23:36:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:04,432 INFO L462 AbstractCegarLoop]: Abstraction has 10442 states and 13054 transitions. [2019-11-23 23:36:04,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10442 states and 13054 transitions. [2019-11-23 23:36:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-23 23:36:04,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:04,454 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:04,454 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1788063177, now seen corresponding path program 1 times [2019-11-23 23:36:04,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:04,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152995879] [2019-11-23 23:36:04,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 23:36:04,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152995879] [2019-11-23 23:36:04,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:04,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:04,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711512504] [2019-11-23 23:36:04,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:04,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:04,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:04,652 INFO L87 Difference]: Start difference. First operand 10442 states and 13054 transitions. Second operand 4 states. [2019-11-23 23:36:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:05,843 INFO L93 Difference]: Finished difference Result 21598 states and 27001 transitions. [2019-11-23 23:36:05,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:05,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-11-23 23:36:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:05,870 INFO L225 Difference]: With dead ends: 21598 [2019-11-23 23:36:05,872 INFO L226 Difference]: Without dead ends: 11157 [2019-11-23 23:36:05,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2019-11-23 23:36:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 11157. [2019-11-23 23:36:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2019-11-23 23:36:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 13882 transitions. [2019-11-23 23:36:06,065 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 13882 transitions. Word has length 258 [2019-11-23 23:36:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:06,066 INFO L462 AbstractCegarLoop]: Abstraction has 11157 states and 13882 transitions. [2019-11-23 23:36:06,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 13882 transitions. [2019-11-23 23:36:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-23 23:36:06,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:06,099 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:06,099 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1981131528, now seen corresponding path program 1 times [2019-11-23 23:36:06,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:06,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003730629] [2019-11-23 23:36:06,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-23 23:36:06,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003730629] [2019-11-23 23:36:06,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:06,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:06,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041774540] [2019-11-23 23:36:06,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:06,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:06,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:06,516 INFO L87 Difference]: Start difference. First operand 11157 states and 13882 transitions. Second operand 4 states. [2019-11-23 23:36:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:07,646 INFO L93 Difference]: Finished difference Result 24458 states and 30613 transitions. [2019-11-23 23:36:07,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:07,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-11-23 23:36:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:07,665 INFO L225 Difference]: With dead ends: 24458 [2019-11-23 23:36:07,666 INFO L226 Difference]: Without dead ends: 13302 [2019-11-23 23:36:07,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13302 states. [2019-11-23 23:36:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13302 to 13302. [2019-11-23 23:36:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13302 states. [2019-11-23 23:36:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13302 states to 13302 states and 16285 transitions. [2019-11-23 23:36:07,858 INFO L78 Accepts]: Start accepts. Automaton has 13302 states and 16285 transitions. Word has length 267 [2019-11-23 23:36:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:07,858 INFO L462 AbstractCegarLoop]: Abstraction has 13302 states and 16285 transitions. [2019-11-23 23:36:07,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13302 states and 16285 transitions. [2019-11-23 23:36:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 23:36:07,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:07,890 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:07,891 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:07,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1458371427, now seen corresponding path program 1 times [2019-11-23 23:36:07,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:07,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533281199] [2019-11-23 23:36:07,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:08,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533281199] [2019-11-23 23:36:08,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:08,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:08,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487895935] [2019-11-23 23:36:08,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:08,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:08,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:08,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:08,374 INFO L87 Difference]: Start difference. First operand 13302 states and 16285 transitions. Second operand 3 states. [2019-11-23 23:36:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:09,421 INFO L93 Difference]: Finished difference Result 27604 states and 33734 transitions. [2019-11-23 23:36:09,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:09,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-11-23 23:36:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:09,438 INFO L225 Difference]: With dead ends: 27604 [2019-11-23 23:36:09,438 INFO L226 Difference]: Without dead ends: 14303 [2019-11-23 23:36:09,453 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-23 23:36:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14303 states. [2019-11-23 23:36:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14303 to 14160. [2019-11-23 23:36:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14160 states. [2019-11-23 23:36:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14160 states to 14160 states and 17034 transitions. [2019-11-23 23:36:09,633 INFO L78 Accepts]: Start accepts. Automaton has 14160 states and 17034 transitions. Word has length 271 [2019-11-23 23:36:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:09,634 INFO L462 AbstractCegarLoop]: Abstraction has 14160 states and 17034 transitions. [2019-11-23 23:36:09,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 14160 states and 17034 transitions. [2019-11-23 23:36:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-23 23:36:09,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:09,656 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:09,656 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash 189474959, now seen corresponding path program 1 times [2019-11-23 23:36:09,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:09,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275420613] [2019-11-23 23:36:09,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 23:36:09,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275420613] [2019-11-23 23:36:09,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300325601] [2019-11-23 23:36:09,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:11,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:11,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-23 23:36:11,323 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-23 23:36:11,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:11,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-11-23 23:36:11,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094681662] [2019-11-23 23:36:11,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:11,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:11,446 INFO L87 Difference]: Start difference. First operand 14160 states and 17034 transitions. Second operand 3 states. [2019-11-23 23:36:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:11,926 INFO L93 Difference]: Finished difference Result 41191 states and 49597 transitions. [2019-11-23 23:36:11,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:11,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-23 23:36:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:11,956 INFO L225 Difference]: With dead ends: 41191 [2019-11-23 23:36:11,956 INFO L226 Difference]: Without dead ends: 27032 [2019-11-23 23:36:11,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 542 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27032 states. [2019-11-23 23:36:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27032 to 27030. [2019-11-23 23:36:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27030 states. [2019-11-23 23:36:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27030 states to 27030 states and 32506 transitions. [2019-11-23 23:36:12,467 INFO L78 Accepts]: Start accepts. Automaton has 27030 states and 32506 transitions. Word has length 272 [2019-11-23 23:36:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:12,472 INFO L462 AbstractCegarLoop]: Abstraction has 27030 states and 32506 transitions. [2019-11-23 23:36:12,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 27030 states and 32506 transitions. [2019-11-23 23:36:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-23 23:36:12,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:12,488 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:12,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:12,694 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash -123143192, now seen corresponding path program 1 times [2019-11-23 23:36:12,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:12,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072511214] [2019-11-23 23:36:12,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:12,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072511214] [2019-11-23 23:36:12,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:12,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:12,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278811201] [2019-11-23 23:36:12,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:12,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:12,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:12,900 INFO L87 Difference]: Start difference. First operand 27030 states and 32506 transitions. Second operand 3 states. [2019-11-23 23:36:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:14,044 INFO L93 Difference]: Finished difference Result 52486 states and 63118 transitions. [2019-11-23 23:36:14,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:14,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-23 23:36:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:14,076 INFO L225 Difference]: With dead ends: 52486 [2019-11-23 23:36:14,077 INFO L226 Difference]: Without dead ends: 25457 [2019-11-23 23:36:14,095 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-23 23:36:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25457 states. [2019-11-23 23:36:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25457 to 24313. [2019-11-23 23:36:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24313 states. [2019-11-23 23:36:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24313 states to 24313 states and 28596 transitions. [2019-11-23 23:36:14,388 INFO L78 Accepts]: Start accepts. Automaton has 24313 states and 28596 transitions. Word has length 283 [2019-11-23 23:36:14,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:14,388 INFO L462 AbstractCegarLoop]: Abstraction has 24313 states and 28596 transitions. [2019-11-23 23:36:14,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24313 states and 28596 transitions. [2019-11-23 23:36:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-23 23:36:14,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:14,400 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:14,400 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:14,400 INFO L82 PathProgramCache]: Analyzing trace with hash 543450032, now seen corresponding path program 1 times [2019-11-23 23:36:14,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:14,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332157824] [2019-11-23 23:36:14,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 147 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:14,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332157824] [2019-11-23 23:36:14,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703237358] [2019-11-23 23:36:14,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:14,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:36:14,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-23 23:36:15,101 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-23 23:36:15,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:15,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:36:15,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235743153] [2019-11-23 23:36:15,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:15,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:36:15,226 INFO L87 Difference]: Start difference. First operand 24313 states and 28596 transitions. Second operand 3 states. [2019-11-23 23:36:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:16,228 INFO L93 Difference]: Finished difference Result 50627 states and 59982 transitions. [2019-11-23 23:36:16,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:16,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-11-23 23:36:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:16,291 INFO L225 Difference]: With dead ends: 50627 [2019-11-23 23:36:16,291 INFO L226 Difference]: Without dead ends: 26315 [2019-11-23 23:36:16,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 569 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:36:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26315 states. [2019-11-23 23:36:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26315 to 24885. [2019-11-23 23:36:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24885 states. [2019-11-23 23:36:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24885 states to 24885 states and 29415 transitions. [2019-11-23 23:36:16,845 INFO L78 Accepts]: Start accepts. Automaton has 24885 states and 29415 transitions. Word has length 286 [2019-11-23 23:36:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:16,846 INFO L462 AbstractCegarLoop]: Abstraction has 24885 states and 29415 transitions. [2019-11-23 23:36:16,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 24885 states and 29415 transitions. [2019-11-23 23:36:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-23 23:36:16,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:16,885 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:17,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:17,091 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1199973114, now seen corresponding path program 1 times [2019-11-23 23:36:17,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:17,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855814063] [2019-11-23 23:36:17,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:17,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855814063] [2019-11-23 23:36:17,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:17,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:17,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786251810] [2019-11-23 23:36:17,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:17,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:17,287 INFO L87 Difference]: Start difference. First operand 24885 states and 29415 transitions. Second operand 3 states. [2019-11-23 23:36:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:18,372 INFO L93 Difference]: Finished difference Result 53487 states and 63123 transitions. [2019-11-23 23:36:18,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:18,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-11-23 23:36:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:18,434 INFO L225 Difference]: With dead ends: 53487 [2019-11-23 23:36:18,434 INFO L226 Difference]: Without dead ends: 28603 [2019-11-23 23:36:18,453 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-23 23:36:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28603 states. [2019-11-23 23:36:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28603 to 28174. [2019-11-23 23:36:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28174 states. [2019-11-23 23:36:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28174 states to 28174 states and 32929 transitions. [2019-11-23 23:36:18,918 INFO L78 Accepts]: Start accepts. Automaton has 28174 states and 32929 transitions. Word has length 290 [2019-11-23 23:36:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:18,918 INFO L462 AbstractCegarLoop]: Abstraction has 28174 states and 32929 transitions. [2019-11-23 23:36:18,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28174 states and 32929 transitions. [2019-11-23 23:36:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-23 23:36:18,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:18,936 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:18,936 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:18,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1643329139, now seen corresponding path program 1 times [2019-11-23 23:36:18,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:18,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852784268] [2019-11-23 23:36:18,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 154 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:20,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852784268] [2019-11-23 23:36:20,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023080111] [2019-11-23 23:36:20,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:20,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:36:20,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:20,681 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:20,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:36:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:20,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:20,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-11-23 23:36:20,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764116546] [2019-11-23 23:36:20,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:20,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-23 23:36:20,808 INFO L87 Difference]: Start difference. First operand 28174 states and 32929 transitions. Second operand 4 states. [2019-11-23 23:36:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:22,371 INFO L93 Difference]: Finished difference Result 60208 states and 70299 transitions. [2019-11-23 23:36:22,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:22,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-11-23 23:36:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:22,416 INFO L225 Difference]: With dead ends: 60208 [2019-11-23 23:36:22,416 INFO L226 Difference]: Without dead ends: 32035 [2019-11-23 23:36:22,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 592 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-23 23:36:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32035 states. [2019-11-23 23:36:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32035 to 30176. [2019-11-23 23:36:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30176 states. [2019-11-23 23:36:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30176 states to 30176 states and 34674 transitions. [2019-11-23 23:36:22,890 INFO L78 Accepts]: Start accepts. Automaton has 30176 states and 34674 transitions. Word has length 298 [2019-11-23 23:36:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:22,890 INFO L462 AbstractCegarLoop]: Abstraction has 30176 states and 34674 transitions. [2019-11-23 23:36:22,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 30176 states and 34674 transitions. [2019-11-23 23:36:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-11-23 23:36:22,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:22,911 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:23,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:23,115 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:23,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1012552627, now seen corresponding path program 1 times [2019-11-23 23:36:23,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:23,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785126425] [2019-11-23 23:36:23,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-23 23:36:23,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785126425] [2019-11-23 23:36:23,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:23,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:23,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737592556] [2019-11-23 23:36:23,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:23,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:23,313 INFO L87 Difference]: Start difference. First operand 30176 states and 34674 transitions. Second operand 3 states. [2019-11-23 23:36:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:24,214 INFO L93 Difference]: Finished difference Result 64784 states and 74223 transitions. [2019-11-23 23:36:24,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:24,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-11-23 23:36:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:24,249 INFO L225 Difference]: With dead ends: 64784 [2019-11-23 23:36:24,250 INFO L226 Difference]: Without dead ends: 34609 [2019-11-23 23:36:24,270 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-23 23:36:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34609 states. [2019-11-23 23:36:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34609 to 33465. [2019-11-23 23:36:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33465 states. [2019-11-23 23:36:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33465 states to 33465 states and 37922 transitions. [2019-11-23 23:36:24,699 INFO L78 Accepts]: Start accepts. Automaton has 33465 states and 37922 transitions. Word has length 328 [2019-11-23 23:36:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:24,700 INFO L462 AbstractCegarLoop]: Abstraction has 33465 states and 37922 transitions. [2019-11-23 23:36:24,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 33465 states and 37922 transitions. [2019-11-23 23:36:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-23 23:36:24,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:24,724 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:24,725 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash 830398388, now seen corresponding path program 1 times [2019-11-23 23:36:24,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:24,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688154630] [2019-11-23 23:36:24,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:25,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688154630] [2019-11-23 23:36:25,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:25,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:25,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195076552] [2019-11-23 23:36:25,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:25,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:25,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:25,176 INFO L87 Difference]: Start difference. First operand 33465 states and 37922 transitions. Second operand 3 states. [2019-11-23 23:36:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:26,200 INFO L93 Difference]: Finished difference Result 82375 states and 92871 transitions. [2019-11-23 23:36:26,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:26,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-11-23 23:36:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:26,241 INFO L225 Difference]: With dead ends: 82375 [2019-11-23 23:36:26,241 INFO L226 Difference]: Without dead ends: 48911 [2019-11-23 23:36:26,264 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-23 23:36:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48911 states. [2019-11-23 23:36:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48911 to 44047. [2019-11-23 23:36:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44047 states. [2019-11-23 23:36:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44047 states to 44047 states and 49646 transitions. [2019-11-23 23:36:26,681 INFO L78 Accepts]: Start accepts. Automaton has 44047 states and 49646 transitions. Word has length 330 [2019-11-23 23:36:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:26,682 INFO L462 AbstractCegarLoop]: Abstraction has 44047 states and 49646 transitions. [2019-11-23 23:36:26,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 44047 states and 49646 transitions. [2019-11-23 23:36:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-23 23:36:26,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:26,709 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:26,709 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:26,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash 977078882, now seen corresponding path program 1 times [2019-11-23 23:36:26,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:26,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679186770] [2019-11-23 23:36:26,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 194 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:26,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679186770] [2019-11-23 23:36:26,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736579167] [2019-11-23 23:36:26,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:27,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:27,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:27,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:36:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:36:27,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:36:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:27,503 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:27,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:27,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-11-23 23:36:27,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062862753] [2019-11-23 23:36:27,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:36:27,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:27,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:36:27,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:36:27,612 INFO L87 Difference]: Start difference. First operand 44047 states and 49646 transitions. Second operand 5 states. [2019-11-23 23:36:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:29,662 INFO L93 Difference]: Finished difference Result 124846 states and 140736 transitions. [2019-11-23 23:36:29,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:36:29,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 334 [2019-11-23 23:36:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:29,751 INFO L225 Difference]: With dead ends: 124846 [2019-11-23 23:36:29,752 INFO L226 Difference]: Without dead ends: 80800 [2019-11-23 23:36:29,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 663 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:36:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80800 states. [2019-11-23 23:36:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80800 to 66069. [2019-11-23 23:36:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66069 states. [2019-11-23 23:36:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66069 states to 66069 states and 74186 transitions. [2019-11-23 23:36:30,698 INFO L78 Accepts]: Start accepts. Automaton has 66069 states and 74186 transitions. Word has length 334 [2019-11-23 23:36:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:30,699 INFO L462 AbstractCegarLoop]: Abstraction has 66069 states and 74186 transitions. [2019-11-23 23:36:30,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:36:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 66069 states and 74186 transitions. [2019-11-23 23:36:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-11-23 23:36:30,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:30,724 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:30,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:30,926 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1419074745, now seen corresponding path program 1 times [2019-11-23 23:36:30,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:30,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969938385] [2019-11-23 23:36:30,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-23 23:36:31,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969938385] [2019-11-23 23:36:31,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:31,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:31,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531330572] [2019-11-23 23:36:31,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:31,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:31,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:31,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:31,182 INFO L87 Difference]: Start difference. First operand 66069 states and 74186 transitions. Second operand 3 states. [2019-11-23 23:36:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:32,151 INFO L93 Difference]: Finished difference Result 136284 states and 152824 transitions. [2019-11-23 23:36:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:32,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2019-11-23 23:36:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:32,208 INFO L225 Difference]: With dead ends: 136284 [2019-11-23 23:36:32,208 INFO L226 Difference]: Without dead ends: 69072 [2019-11-23 23:36:32,237 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-23 23:36:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69072 states. [2019-11-23 23:36:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69072 to 64639. [2019-11-23 23:36:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64639 states. [2019-11-23 23:36:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64639 states to 64639 states and 72377 transitions. [2019-11-23 23:36:34,592 INFO L78 Accepts]: Start accepts. Automaton has 64639 states and 72377 transitions. Word has length 345 [2019-11-23 23:36:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:34,593 INFO L462 AbstractCegarLoop]: Abstraction has 64639 states and 72377 transitions. [2019-11-23 23:36:34,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 64639 states and 72377 transitions. [2019-11-23 23:36:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-11-23 23:36:34,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:34,628 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:34,628 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:34,628 INFO L82 PathProgramCache]: Analyzing trace with hash -421656995, now seen corresponding path program 1 times [2019-11-23 23:36:34,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:34,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889659315] [2019-11-23 23:36:34,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 203 proven. 82 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 23:36:34,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889659315] [2019-11-23 23:36:34,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207333949] [2019-11-23 23:36:34,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:35,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:36:35,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 203 proven. 82 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 23:36:35,132 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:35,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:36:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 203 proven. 82 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 23:36:35,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [499039635] [2019-11-23 23:36:35,352 INFO L159 IcfgInterpreter]: Started Sifa with 145 locations of interest [2019-11-23 23:36:35,353 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:36:35,363 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:36:35,379 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:36:35,380 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:36:37,432 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 156