/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/Problem02_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:58,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:58,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:58,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:58,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:58,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:58,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:58,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:58,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:58,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:58,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:58,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:58,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:58,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:58,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:58,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:58,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:58,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:58,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:58,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:58,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:58,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:58,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:58,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:58,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:58,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:58,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:58,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:58,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:58,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:58,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:58,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:58,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:58,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:58,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:58,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:58,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:58,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:58,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:58,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:58,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:58,306 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:31:58,334 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:58,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:58,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:58,335 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:58,335 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:58,336 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:58,336 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:58,336 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:58,337 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:58,337 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:58,338 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:58,338 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:58,338 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:58,339 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:58,339 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:58,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:58,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:58,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:58,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:58,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:58,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:58,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:58,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:58,343 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:58,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:58,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:58,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:58,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:58,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:58,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:58,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:58,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:58,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:58,346 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:58,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:58,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:58,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:58,347 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:58,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:58,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:58,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:58,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:58,708 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:58,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06.c [2019-11-23 23:31:58,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78b809f2/3998f9f0ec6b43299abee9488b91dbc1/FLAG4acce5d04 [2019-11-23 23:31:59,319 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:59,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06.c [2019-11-23 23:31:59,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78b809f2/3998f9f0ec6b43299abee9488b91dbc1/FLAG4acce5d04 [2019-11-23 23:31:59,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78b809f2/3998f9f0ec6b43299abee9488b91dbc1 [2019-11-23 23:31:59,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:59,624 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:59,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:59,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:59,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:59,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:59" (1/1) ... [2019-11-23 23:31:59,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@657855ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:59, skipping insertion in model container [2019-11-23 23:31:59,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:59" (1/1) ... [2019-11-23 23:31:59,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:59,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:00,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:00,214 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:00,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:00,380 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:00,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00 WrapperNode [2019-11-23 23:32:00,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:00,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:00,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:00,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:00,389 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:32:00" (1/1) ... [2019-11-23 23:32:00,406 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:32:00" (1/1) ... [2019-11-23 23:32:00,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:00,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:00,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:00,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:00,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2019-11-23 23:32:00,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2019-11-23 23:32:00,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2019-11-23 23:32:00,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2019-11-23 23:32:00,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2019-11-23 23:32:00,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2019-11-23 23:32:00,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2019-11-23 23:32:00,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:00,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:00,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:00,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:00,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (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:32:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:02,622 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:02,623 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:02,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:02 BoogieIcfgContainer [2019-11-23 23:32:02,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:02,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:02,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:02,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:02,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:59" (1/3) ... [2019-11-23 23:32:02,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b16616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:02, skipping insertion in model container [2019-11-23 23:32:02,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (2/3) ... [2019-11-23 23:32:02,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b16616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:02, skipping insertion in model container [2019-11-23 23:32:02,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:02" (3/3) ... [2019-11-23 23:32:02,635 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label06.c [2019-11-23 23:32:02,646 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:02,658 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:02,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:02,712 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:02,713 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:02,713 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:02,713 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:02,714 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:02,714 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:02,714 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:02,714 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:02,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:02,752 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] [2019-11-23 23:32:02,752 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:02,757 INFO L82 PathProgramCache]: Analyzing trace with hash 925963535, now seen corresponding path program 1 times [2019-11-23 23:32:02,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:02,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517388654] [2019-11-23 23:32:02,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:03,189 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:32:03,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517388654] [2019-11-23 23:32:03,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:03,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:03,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123074929] [2019-11-23 23:32:03,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:03,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:03,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:03,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:03,219 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:04,221 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:04,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:04,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:04,252 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:04,253 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:04,260 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:32:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 398 transitions. [2019-11-23 23:32:04,375 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 398 transitions. Word has length 80 [2019-11-23 23:32:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:04,378 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 398 transitions. [2019-11-23 23:32:04,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 398 transitions. [2019-11-23 23:32:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 23:32:04,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:04,387 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] [2019-11-23 23:32:04,388 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:04,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:04,388 INFO L82 PathProgramCache]: Analyzing trace with hash -859408152, now seen corresponding path program 1 times [2019-11-23 23:32:04,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:04,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463847871] [2019-11-23 23:32:04,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:04,562 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:32:04,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463847871] [2019-11-23 23:32:04,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:04,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:04,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990032896] [2019-11-23 23:32:04,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:04,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:04,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:04,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:04,568 INFO L87 Difference]: Start difference. First operand 243 states and 398 transitions. Second operand 3 states. [2019-11-23 23:32:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:04,998 INFO L93 Difference]: Finished difference Result 725 states and 1191 transitions. [2019-11-23 23:32:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:04,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 23:32:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:05,002 INFO L225 Difference]: With dead ends: 725 [2019-11-23 23:32:05,002 INFO L226 Difference]: Without dead ends: 483 [2019-11-23 23:32:05,005 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:32:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-23 23:32:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-23 23:32:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-23 23:32:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 758 transitions. [2019-11-23 23:32:05,041 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 758 transitions. Word has length 85 [2019-11-23 23:32:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:05,042 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 758 transitions. [2019-11-23 23:32:05,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 758 transitions. [2019-11-23 23:32:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 23:32:05,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:05,047 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-23 23:32:05,048 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2134419129, now seen corresponding path program 1 times [2019-11-23 23:32:05,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:05,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644215772] [2019-11-23 23:32:05,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:05,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644215772] [2019-11-23 23:32:05,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:05,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:05,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478561922] [2019-11-23 23:32:05,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:05,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:05,111 INFO L87 Difference]: Start difference. First operand 483 states and 758 transitions. Second operand 3 states. [2019-11-23 23:32:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:05,512 INFO L93 Difference]: Finished difference Result 1445 states and 2271 transitions. [2019-11-23 23:32:05,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:05,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-23 23:32:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:05,519 INFO L225 Difference]: With dead ends: 1445 [2019-11-23 23:32:05,519 INFO L226 Difference]: Without dead ends: 963 [2019-11-23 23:32:05,521 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:32:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-23 23:32:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 803. [2019-11-23 23:32:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-23 23:32:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1279 transitions. [2019-11-23 23:32:05,555 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1279 transitions. Word has length 103 [2019-11-23 23:32:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:05,557 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1279 transitions. [2019-11-23 23:32:05,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1279 transitions. [2019-11-23 23:32:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 23:32:05,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:05,564 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-23 23:32:05,564 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash -911070836, now seen corresponding path program 1 times [2019-11-23 23:32:05,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:05,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747726066] [2019-11-23 23:32:05,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 23:32:05,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747726066] [2019-11-23 23:32:05,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:05,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:05,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282422729] [2019-11-23 23:32:05,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:05,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:05,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:05,643 INFO L87 Difference]: Start difference. First operand 803 states and 1279 transitions. Second operand 3 states. [2019-11-23 23:32:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:06,076 INFO L93 Difference]: Finished difference Result 2085 states and 3288 transitions. [2019-11-23 23:32:06,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:06,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 23:32:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:06,085 INFO L225 Difference]: With dead ends: 2085 [2019-11-23 23:32:06,085 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:06,088 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:32:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-23 23:32:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1830 transitions. [2019-11-23 23:32:06,130 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1830 transitions. Word has length 105 [2019-11-23 23:32:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:06,131 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1830 transitions. [2019-11-23 23:32:06,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1830 transitions. [2019-11-23 23:32:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 23:32:06,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:06,134 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-11-23 23:32:06,135 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:06,135 INFO L82 PathProgramCache]: Analyzing trace with hash -436611460, now seen corresponding path program 1 times [2019-11-23 23:32:06,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:06,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936461550] [2019-11-23 23:32:06,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 23:32:06,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936461550] [2019-11-23 23:32:06,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:06,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:06,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250605348] [2019-11-23 23:32:06,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:06,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:06,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:06,195 INFO L87 Difference]: Start difference. First operand 1283 states and 1830 transitions. Second operand 3 states. [2019-11-23 23:32:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:06,708 INFO L93 Difference]: Finished difference Result 2805 states and 3994 transitions. [2019-11-23 23:32:06,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:06,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-23 23:32:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:06,716 INFO L225 Difference]: With dead ends: 2805 [2019-11-23 23:32:06,716 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:32:06,718 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:32:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:32:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1443. [2019-11-23 23:32:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-11-23 23:32:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1915 transitions. [2019-11-23 23:32:06,754 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1915 transitions. Word has length 107 [2019-11-23 23:32:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:06,755 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 1915 transitions. [2019-11-23 23:32:06,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1915 transitions. [2019-11-23 23:32:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 23:32:06,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:06,759 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 23:32:06,759 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2118161647, now seen corresponding path program 1 times [2019-11-23 23:32:06,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:06,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333930774] [2019-11-23 23:32:06,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:06,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333930774] [2019-11-23 23:32:06,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:06,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:06,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968198259] [2019-11-23 23:32:06,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:06,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:06,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:06,913 INFO L87 Difference]: Start difference. First operand 1443 states and 1915 transitions. Second operand 4 states. [2019-11-23 23:32:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:07,708 INFO L93 Difference]: Finished difference Result 3365 states and 4564 transitions. [2019-11-23 23:32:07,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:07,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-23 23:32:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:07,721 INFO L225 Difference]: With dead ends: 3365 [2019-11-23 23:32:07,721 INFO L226 Difference]: Without dead ends: 1923 [2019-11-23 23:32:07,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-11-23 23:32:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1363. [2019-11-23 23:32:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-23 23:32:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1749 transitions. [2019-11-23 23:32:07,767 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1749 transitions. Word has length 107 [2019-11-23 23:32:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:07,769 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1749 transitions. [2019-11-23 23:32:07,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1749 transitions. [2019-11-23 23:32:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-23 23:32:07,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:07,773 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:32:07,774 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -617264641, now seen corresponding path program 1 times [2019-11-23 23:32:07,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:07,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510299929] [2019-11-23 23:32:07,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-23 23:32:07,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510299929] [2019-11-23 23:32:07,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:07,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:07,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109646128] [2019-11-23 23:32:07,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:07,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:07,884 INFO L87 Difference]: Start difference. First operand 1363 states and 1749 transitions. Second operand 4 states. [2019-11-23 23:32:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:08,517 INFO L93 Difference]: Finished difference Result 2885 states and 3692 transitions. [2019-11-23 23:32:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:08,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-23 23:32:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:08,523 INFO L225 Difference]: With dead ends: 2885 [2019-11-23 23:32:08,524 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:32:08,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:32:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1203. [2019-11-23 23:32:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1420 transitions. [2019-11-23 23:32:08,554 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1420 transitions. Word has length 136 [2019-11-23 23:32:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:08,555 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1420 transitions. [2019-11-23 23:32:08,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1420 transitions. [2019-11-23 23:32:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 23:32:08,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:08,559 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:32:08,559 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:08,559 INFO L82 PathProgramCache]: Analyzing trace with hash 810817909, now seen corresponding path program 1 times [2019-11-23 23:32:08,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:08,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928672627] [2019-11-23 23:32:08,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-23 23:32:08,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928672627] [2019-11-23 23:32:08,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:08,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:08,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165621661] [2019-11-23 23:32:08,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:08,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:08,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:08,632 INFO L87 Difference]: Start difference. First operand 1203 states and 1420 transitions. Second operand 3 states. [2019-11-23 23:32:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:08,978 INFO L93 Difference]: Finished difference Result 2725 states and 3187 transitions. [2019-11-23 23:32:08,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:08,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-23 23:32:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:08,986 INFO L225 Difference]: With dead ends: 2725 [2019-11-23 23:32:08,986 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:32:08,988 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:32:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:32:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1283. [2019-11-23 23:32:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1440 transitions. [2019-11-23 23:32:09,018 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1440 transitions. Word has length 140 [2019-11-23 23:32:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:09,018 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1440 transitions. [2019-11-23 23:32:09,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1440 transitions. [2019-11-23 23:32:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 23:32:09,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:09,025 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 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:32:09,025 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash 97838356, now seen corresponding path program 1 times [2019-11-23 23:32:09,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:09,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692800864] [2019-11-23 23:32:09,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:09,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692800864] [2019-11-23 23:32:09,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:09,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:09,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619754756] [2019-11-23 23:32:09,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:09,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:09,147 INFO L87 Difference]: Start difference. First operand 1283 states and 1440 transitions. Second operand 3 states. [2019-11-23 23:32:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:09,465 INFO L93 Difference]: Finished difference Result 2725 states and 3047 transitions. [2019-11-23 23:32:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:09,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 23:32:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:09,471 INFO L225 Difference]: With dead ends: 2725 [2019-11-23 23:32:09,471 INFO L226 Difference]: Without dead ends: 1123 [2019-11-23 23:32:09,473 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:32:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-23 23:32:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-11-23 23:32:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1233 transitions. [2019-11-23 23:32:09,496 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1233 transitions. Word has length 171 [2019-11-23 23:32:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:09,496 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1233 transitions. [2019-11-23 23:32:09,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1233 transitions. [2019-11-23 23:32:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-23 23:32:09,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:09,500 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 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:32:09,500 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1680993731, now seen corresponding path program 1 times [2019-11-23 23:32:09,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:09,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109286203] [2019-11-23 23:32:09,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-23 23:32:09,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109286203] [2019-11-23 23:32:09,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:09,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:09,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568594847] [2019-11-23 23:32:09,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:09,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:09,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:09,552 INFO L87 Difference]: Start difference. First operand 1123 states and 1233 transitions. Second operand 3 states. [2019-11-23 23:32:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:09,849 INFO L93 Difference]: Finished difference Result 2245 states and 2465 transitions. [2019-11-23 23:32:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:09,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-23 23:32:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:09,855 INFO L225 Difference]: With dead ends: 2245 [2019-11-23 23:32:09,855 INFO L226 Difference]: Without dead ends: 1123 [2019-11-23 23:32:09,857 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:32:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-23 23:32:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-11-23 23:32:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1227 transitions. [2019-11-23 23:32:09,879 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1227 transitions. Word has length 176 [2019-11-23 23:32:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:09,880 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1227 transitions. [2019-11-23 23:32:09,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1227 transitions. [2019-11-23 23:32:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-23 23:32:09,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:09,884 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:32:09,885 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash -486299293, now seen corresponding path program 1 times [2019-11-23 23:32:09,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:09,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691834233] [2019-11-23 23:32:09,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-23 23:32:09,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691834233] [2019-11-23 23:32:09,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238865702] [2019-11-23 23:32:09,974 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:32:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:10,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:10,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 23:32:10,209 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 23:32:10,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:10,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-11-23 23:32:10,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096743011] [2019-11-23 23:32:10,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:10,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:10,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:32:10,331 INFO L87 Difference]: Start difference. First operand 1123 states and 1227 transitions. Second operand 3 states. [2019-11-23 23:32:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:10,497 INFO L93 Difference]: Finished difference Result 2085 states and 2269 transitions. [2019-11-23 23:32:10,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:10,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-23 23:32:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:10,501 INFO L225 Difference]: With dead ends: 2085 [2019-11-23 23:32:10,501 INFO L226 Difference]: Without dead ends: 643 [2019-11-23 23:32:10,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:32:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-11-23 23:32:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 563. [2019-11-23 23:32:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-23 23:32:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 592 transitions. [2019-11-23 23:32:10,515 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 592 transitions. Word has length 197 [2019-11-23 23:32:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:10,515 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 592 transitions. [2019-11-23 23:32:10,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 592 transitions. [2019-11-23 23:32:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-23 23:32:10,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:10,518 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:32:10,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:10,722 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1984496367, now seen corresponding path program 1 times [2019-11-23 23:32:10,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:10,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556743167] [2019-11-23 23:32:10,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:32:10,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556743167] [2019-11-23 23:32:10,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:10,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:10,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069034894] [2019-11-23 23:32:10,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:10,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:10,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:10,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:10,884 INFO L87 Difference]: Start difference. First operand 563 states and 592 transitions. Second operand 4 states. [2019-11-23 23:32:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:11,320 INFO L93 Difference]: Finished difference Result 1205 states and 1270 transitions. [2019-11-23 23:32:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:11,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-23 23:32:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:11,323 INFO L225 Difference]: With dead ends: 1205 [2019-11-23 23:32:11,323 INFO L226 Difference]: Without dead ends: 643 [2019-11-23 23:32:11,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-11-23 23:32:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-11-23 23:32:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-23 23:32:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 668 transitions. [2019-11-23 23:32:11,340 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 668 transitions. Word has length 206 [2019-11-23 23:32:11,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:11,341 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 668 transitions. [2019-11-23 23:32:11,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 668 transitions. [2019-11-23 23:32:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-23 23:32:11,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:11,347 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 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, 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:32:11,347 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1331261140, now seen corresponding path program 1 times [2019-11-23 23:32:11,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:11,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680485661] [2019-11-23 23:32:11,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:11,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680485661] [2019-11-23 23:32:11,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:11,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 23:32:11,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122946985] [2019-11-23 23:32:11,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:32:11,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:11,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:32:11,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:32:11,626 INFO L87 Difference]: Start difference. First operand 643 states and 668 transitions. Second operand 5 states. [2019-11-23 23:32:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:12,075 INFO L93 Difference]: Finished difference Result 1125 states and 1165 transitions. [2019-11-23 23:32:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:12,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-11-23 23:32:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:12,079 INFO L225 Difference]: With dead ends: 1125 [2019-11-23 23:32:12,079 INFO L226 Difference]: Without dead ends: 563 [2019-11-23 23:32:12,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:32:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-23 23:32:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 483. [2019-11-23 23:32:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-23 23:32:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 498 transitions. [2019-11-23 23:32:12,091 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 498 transitions. Word has length 229 [2019-11-23 23:32:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:12,091 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 498 transitions. [2019-11-23 23:32:12,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:32:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 498 transitions. [2019-11-23 23:32:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-23 23:32:12,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:12,096 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:12,096 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash -955876154, now seen corresponding path program 1 times [2019-11-23 23:32:12,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:12,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218092385] [2019-11-23 23:32:12,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 344 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 23:32:12,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218092385] [2019-11-23 23:32:12,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137121595] [2019-11-23 23:32:12,511 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:32:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:12,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 23:32:12,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:12,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 383 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:13,201 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:13,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-23 23:32:13,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:13,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:13,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:13,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:13,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 259 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-23 23:32:13,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [598858006] [2019-11-23 23:32:13,797 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2019-11-23 23:32:13,800 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:32:13,811 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:32:13,823 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:32:13,824 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:32:19,874 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-11-23 23:32:20,243 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-11-23 23:32:20,546 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-11-23 23:32:22,316 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-23 23:32:23,447 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2019-11-23 23:32:24,523 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 122 DAG size of output: 111 [2019-11-23 23:32:25,496 WARN L192 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-23 23:32:26,507 WARN L192 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2019-11-23 23:32:26,681 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 23:32:27,122 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-23 23:32:27,473 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-23 23:32:27,950 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-11-23 23:32:28,301 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-23 23:32:28,704 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-11-23 23:32:29,070 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-23 23:32:29,422 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:32:30,005 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2019-11-23 23:32:30,374 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:32:31,748 WARN L192 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-11-23 23:32:32,653 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:32:33,023 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-11-23 23:32:33,382 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:32:33,746 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:32:36,603 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:32:36,987 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:32:37,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-23 23:32:37,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [6, 5, 6] total 35 [2019-11-23 23:32:37,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820875013] [2019-11-23 23:32:37,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 23:32:37,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:37,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 23:32:37,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 23:32:37,062 INFO L87 Difference]: Start difference. First operand 483 states and 498 transitions. Second operand 23 states. [2019-11-23 23:32:38,249 WARN L192 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 110 [2019-11-23 23:32:39,488 WARN L192 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 114 [2019-11-23 23:32:40,532 WARN L192 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 117 [2019-11-23 23:32:41,729 WARN L192 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 120 [2019-11-23 23:32:42,833 WARN L192 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2019-11-23 23:32:44,085 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 137 DAG size of output: 125 [2019-11-23 23:32:45,466 WARN L192 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2019-11-23 23:32:47,112 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 144 DAG size of output: 90 [2019-11-23 23:32:48,238 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 139 DAG size of output: 124 [2019-11-23 23:32:49,400 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 140 DAG size of output: 126 [2019-11-23 23:32:50,583 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 141 DAG size of output: 127 [2019-11-23 23:32:52,841 WARN L192 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 142 DAG size of output: 127 [2019-11-23 23:32:54,411 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 143 DAG size of output: 122 [2019-11-23 23:32:56,029 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2019-11-23 23:32:57,681 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2019-11-23 23:32:58,613 WARN L192 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-11-23 23:32:59,896 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 147 DAG size of output: 83 [2019-11-23 23:33:01,530 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 149 DAG size of output: 81 [2019-11-23 23:33:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:01,605 INFO L93 Difference]: Finished difference Result 1213 states and 1255 transitions. [2019-11-23 23:33:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 23:33:01,605 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 279 [2019-11-23 23:33:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:01,612 INFO L225 Difference]: With dead ends: 1213 [2019-11-23 23:33:01,612 INFO L226 Difference]: Without dead ends: 811 [2019-11-23 23:33:01,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 732 SyntacticMatches, 78 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=760, Invalid=1996, Unknown=0, NotChecked=0, Total=2756 [2019-11-23 23:33:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-23 23:33:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 691. [2019-11-23 23:33:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-11-23 23:33:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 714 transitions. [2019-11-23 23:33:01,630 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 714 transitions. Word has length 279 [2019-11-23 23:33:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:01,631 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 714 transitions. [2019-11-23 23:33:01,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 23:33:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 714 transitions. [2019-11-23 23:33:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-11-23 23:33:01,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:01,636 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:01,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:33:01,840 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:01,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1846056577, now seen corresponding path program 1 times [2019-11-23 23:33:01,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:01,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18057745] [2019-11-23 23:33:01,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 429 proven. 8 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-23 23:33:02,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18057745] [2019-11-23 23:33:02,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842448087] [2019-11-23 23:33:02,156 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:33:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:02,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 23:33:02,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:33:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 502 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 23:33:02,591 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:33:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 329 proven. 64 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-23 23:33:02,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1542076719] [2019-11-23 23:33:02,964 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2019-11-23 23:33:02,965 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:33:02,965 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:33:02,966 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:33:02,966 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:33:05,969 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-11-23 23:33:06,165 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-11-23 23:33:06,369 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-11-23 23:33:07,690 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-23 23:33:09,011 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-11-23 23:33:10,304 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2019-11-23 23:33:11,496 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2019-11-23 23:33:11,907 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-23 23:33:12,080 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 23:33:12,522 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-23 23:33:12,863 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-23 23:33:13,340 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-11-23 23:33:13,685 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-23 23:33:14,077 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-11-23 23:33:14,432 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-23 23:33:14,793 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:33:15,267 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:33:16,842 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-11-23 23:33:18,220 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:33:18,585 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-11-23 23:33:18,945 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:33:19,314 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-23 23:33:22,220 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87