/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:47,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:47,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:47,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:47,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:47,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:47,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:47,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:47,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:47,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:47,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:47,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:47,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:47,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:47,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:47,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:47,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:47,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:47,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:47,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:47,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:47,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:47,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:47,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:47,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:47,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:47,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:47,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:47,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:47,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:47,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:47,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:47,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:47,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:47,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:47,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:47,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:47,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:47,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:47,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:47,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:47,339 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:33:47,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:47,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:47,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:47,355 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:47,356 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:47,356 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:47,356 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:47,356 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:47,356 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:47,357 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:47,357 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:47,357 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:47,357 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:47,357 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:47,358 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:47,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:47,359 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:47,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:47,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:47,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:47,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:47,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:47,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:47,360 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:47,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:47,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:47,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:47,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:47,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:47,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:47,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:47,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:47,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:47,362 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:47,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:47,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:47,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:47,363 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:47,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:47,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:47,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:47,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:47,677 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:47,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label10.c [2019-11-23 23:33:47,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a90e705/1daca7296ab44198a8d33e9616c53e9f/FLAG930ad9d80 [2019-11-23 23:33:48,393 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:48,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label10.c [2019-11-23 23:33:48,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a90e705/1daca7296ab44198a8d33e9616c53e9f/FLAG930ad9d80 [2019-11-23 23:33:48,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a90e705/1daca7296ab44198a8d33e9616c53e9f [2019-11-23 23:33:48,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:48,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:48,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:48,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:48,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:48,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bc442c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48, skipping insertion in model container [2019-11-23 23:33:48,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:48,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:49,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:49,618 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:50,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:50,123 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:50,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50 WrapperNode [2019-11-23 23:33:50,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:50,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:50,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:50,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:50,134 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:33:50" (1/1) ... [2019-11-23 23:33:50,176 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:33:50" (1/1) ... [2019-11-23 23:33:50,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:50,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:50,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:50,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:50,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (1/1) ... [2019-11-23 23:33:50,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (1/1) ... [2019-11-23 23:33:50,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (1/1) ... [2019-11-23 23:33:50,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (1/1) ... [2019-11-23 23:33:50,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (1/1) ... [2019-11-23 23:33:50,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (1/1) ... [2019-11-23 23:33:50,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (1/1) ... [2019-11-23 23:33:50,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:50,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:50,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:50,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:50,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (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:33:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:53,548 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:53,548 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:53,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:53 BoogieIcfgContainer [2019-11-23 23:33:53,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:53,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:53,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:53,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:53,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:48" (1/3) ... [2019-11-23 23:33:53,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c794c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:53, skipping insertion in model container [2019-11-23 23:33:53,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:50" (2/3) ... [2019-11-23 23:33:53,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c794c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:53, skipping insertion in model container [2019-11-23 23:33:53,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:53" (3/3) ... [2019-11-23 23:33:53,558 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label10.c [2019-11-23 23:33:53,569 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:53,577 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:53,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:53,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:53,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:53,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:53,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:53,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:53,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:53,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:53,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:33:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:33:53,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:53,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:53,660 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:53,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1467443423, now seen corresponding path program 1 times [2019-11-23 23:33:53,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:53,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828393866] [2019-11-23 23:33:53,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:54,360 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:33:54,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828393866] [2019-11-23 23:33:54,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:54,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:54,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826187150] [2019-11-23 23:33:54,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:54,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:54,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:54,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:54,392 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:33:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:56,183 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:33:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:56,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:33:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:56,212 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:33:56,212 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:33:56,218 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:33:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:33:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:33:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:33:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 521 transitions. [2019-11-23 23:33:56,286 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 521 transitions. Word has length 143 [2019-11-23 23:33:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:56,287 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 521 transitions. [2019-11-23 23:33:56,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 521 transitions. [2019-11-23 23:33:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:33:56,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:56,292 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:56,292 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:56,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:56,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1977870400, now seen corresponding path program 1 times [2019-11-23 23:33:56,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:56,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153846809] [2019-11-23 23:33:56,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:56,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153846809] [2019-11-23 23:33:56,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:56,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:56,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719336429] [2019-11-23 23:33:56,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:56,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:56,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:56,480 INFO L87 Difference]: Start difference. First operand 289 states and 521 transitions. Second operand 3 states. [2019-11-23 23:33:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:57,472 INFO L93 Difference]: Finished difference Result 863 states and 1560 transitions. [2019-11-23 23:33:57,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:57,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:33:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:57,482 INFO L225 Difference]: With dead ends: 863 [2019-11-23 23:33:57,482 INFO L226 Difference]: Without dead ends: 575 [2019-11-23 23:33:57,486 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:33:57,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-23 23:33:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-23 23:33:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:33:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1014 transitions. [2019-11-23 23:33:57,543 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1014 transitions. Word has length 151 [2019-11-23 23:33:57,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:57,544 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1014 transitions. [2019-11-23 23:33:57,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1014 transitions. [2019-11-23 23:33:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 23:33:57,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:57,549 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:57,550 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1458044975, now seen corresponding path program 1 times [2019-11-23 23:33:57,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:57,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439577264] [2019-11-23 23:33:57,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:57,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439577264] [2019-11-23 23:33:57,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:57,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:57,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882442880] [2019-11-23 23:33:57,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:57,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:57,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:57,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:57,645 INFO L87 Difference]: Start difference. First operand 575 states and 1014 transitions. Second operand 3 states. [2019-11-23 23:33:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:58,190 INFO L93 Difference]: Finished difference Result 1149 states and 2027 transitions. [2019-11-23 23:33:58,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:58,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 23:33:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:58,195 INFO L225 Difference]: With dead ends: 1149 [2019-11-23 23:33:58,195 INFO L226 Difference]: Without dead ends: 575 [2019-11-23 23:33:58,196 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:33:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-23 23:33:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-23 23:33:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:33:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 964 transitions. [2019-11-23 23:33:58,212 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 964 transitions. Word has length 156 [2019-11-23 23:33:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:58,212 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 964 transitions. [2019-11-23 23:33:58,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 964 transitions. [2019-11-23 23:33:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 23:33:58,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:58,217 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:58,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:58,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1273563413, now seen corresponding path program 1 times [2019-11-23 23:33:58,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:58,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311489019] [2019-11-23 23:33:58,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 23:33:58,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311489019] [2019-11-23 23:33:58,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:58,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:58,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020734916] [2019-11-23 23:33:58,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:58,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:58,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:58,303 INFO L87 Difference]: Start difference. First operand 575 states and 964 transitions. Second operand 4 states. [2019-11-23 23:33:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:59,823 INFO L93 Difference]: Finished difference Result 2295 states and 3852 transitions. [2019-11-23 23:33:59,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:59,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 23:33:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:59,832 INFO L225 Difference]: With dead ends: 2295 [2019-11-23 23:33:59,833 INFO L226 Difference]: Without dead ends: 1721 [2019-11-23 23:33:59,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-23 23:33:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1147. [2019-11-23 23:33:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:33:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1820 transitions. [2019-11-23 23:33:59,878 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1820 transitions. Word has length 157 [2019-11-23 23:33:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:59,879 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1820 transitions. [2019-11-23 23:33:59,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1820 transitions. [2019-11-23 23:33:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 23:33:59,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:59,886 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:59,886 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash 210139396, now seen corresponding path program 1 times [2019-11-23 23:33:59,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:59,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802400182] [2019-11-23 23:33:59,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 23:34:00,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802400182] [2019-11-23 23:34:00,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:00,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:00,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490710776] [2019-11-23 23:34:00,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:00,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:00,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:00,020 INFO L87 Difference]: Start difference. First operand 1147 states and 1820 transitions. Second operand 3 states. [2019-11-23 23:34:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:00,845 INFO L93 Difference]: Finished difference Result 2865 states and 4524 transitions. [2019-11-23 23:34:00,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:00,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-23 23:34:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:00,854 INFO L225 Difference]: With dead ends: 2865 [2019-11-23 23:34:00,855 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:34:00,857 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:34:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:34:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:34:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:34:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2681 transitions. [2019-11-23 23:34:00,897 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2681 transitions. Word has length 160 [2019-11-23 23:34:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:00,897 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2681 transitions. [2019-11-23 23:34:00,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2681 transitions. [2019-11-23 23:34:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:34:00,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:00,903 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:00,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash 559044455, now seen corresponding path program 1 times [2019-11-23 23:34:00,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:00,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978295396] [2019-11-23 23:34:00,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 23:34:00,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978295396] [2019-11-23 23:34:00,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:00,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:00,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552373893] [2019-11-23 23:34:00,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:00,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:00,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:00,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:00,972 INFO L87 Difference]: Start difference. First operand 1719 states and 2681 transitions. Second operand 3 states. [2019-11-23 23:34:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:01,435 INFO L93 Difference]: Finished difference Result 5012 states and 7825 transitions. [2019-11-23 23:34:01,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:01,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 23:34:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:01,453 INFO L225 Difference]: With dead ends: 5012 [2019-11-23 23:34:01,454 INFO L226 Difference]: Without dead ends: 3294 [2019-11-23 23:34:01,457 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:34:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-11-23 23:34:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3292. [2019-11-23 23:34:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2019-11-23 23:34:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5135 transitions. [2019-11-23 23:34:01,525 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5135 transitions. Word has length 163 [2019-11-23 23:34:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:01,525 INFO L462 AbstractCegarLoop]: Abstraction has 3292 states and 5135 transitions. [2019-11-23 23:34:01,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5135 transitions. [2019-11-23 23:34:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 23:34:01,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:01,532 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:01,532 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:01,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1356452866, now seen corresponding path program 1 times [2019-11-23 23:34:01,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:01,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851322005] [2019-11-23 23:34:01,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:01,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851322005] [2019-11-23 23:34:01,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:01,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:01,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911204973] [2019-11-23 23:34:01,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:01,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:01,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:01,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:01,630 INFO L87 Difference]: Start difference. First operand 3292 states and 5135 transitions. Second operand 3 states. [2019-11-23 23:34:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:02,579 INFO L93 Difference]: Finished difference Result 9872 states and 15402 transitions. [2019-11-23 23:34:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:02,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-23 23:34:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:02,608 INFO L225 Difference]: With dead ends: 9872 [2019-11-23 23:34:02,608 INFO L226 Difference]: Without dead ends: 6581 [2019-11-23 23:34:02,614 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:34:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-11-23 23:34:02,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-11-23 23:34:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-11-23 23:34:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 9398 transitions. [2019-11-23 23:34:02,748 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 9398 transitions. Word has length 165 [2019-11-23 23:34:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:02,748 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 9398 transitions. [2019-11-23 23:34:02,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 9398 transitions. [2019-11-23 23:34:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 23:34:02,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:02,759 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:02,760 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1001973145, now seen corresponding path program 2 times [2019-11-23 23:34:02,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:02,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134555566] [2019-11-23 23:34:02,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:02,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134555566] [2019-11-23 23:34:02,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:02,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:02,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561778898] [2019-11-23 23:34:02,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:02,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:02,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:02,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:02,842 INFO L87 Difference]: Start difference. First operand 6581 states and 9398 transitions. Second operand 3 states. [2019-11-23 23:34:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:03,811 INFO L93 Difference]: Finished difference Result 17737 states and 25338 transitions. [2019-11-23 23:34:03,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:03,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-23 23:34:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:03,857 INFO L225 Difference]: With dead ends: 17737 [2019-11-23 23:34:03,857 INFO L226 Difference]: Without dead ends: 11157 [2019-11-23 23:34:03,866 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:34:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2019-11-23 23:34:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 11157. [2019-11-23 23:34:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2019-11-23 23:34:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 14000 transitions. [2019-11-23 23:34:04,047 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 14000 transitions. Word has length 167 [2019-11-23 23:34:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:04,047 INFO L462 AbstractCegarLoop]: Abstraction has 11157 states and 14000 transitions. [2019-11-23 23:34:04,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 14000 transitions. [2019-11-23 23:34:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:34:04,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:04,060 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:04,060 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1690900315, now seen corresponding path program 1 times [2019-11-23 23:34:04,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:04,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009274515] [2019-11-23 23:34:04,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:04,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009274515] [2019-11-23 23:34:04,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:04,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:34:04,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845561338] [2019-11-23 23:34:04,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:34:04,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:34:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:04,195 INFO L87 Difference]: Start difference. First operand 11157 states and 14000 transitions. Second operand 5 states. [2019-11-23 23:34:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:05,744 INFO L93 Difference]: Finished difference Result 23604 states and 29695 transitions. [2019-11-23 23:34:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:34:05,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 23:34:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:05,775 INFO L225 Difference]: With dead ends: 23604 [2019-11-23 23:34:05,775 INFO L226 Difference]: Without dead ends: 12448 [2019-11-23 23:34:05,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:34:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12448 states. [2019-11-23 23:34:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12448 to 12015. [2019-11-23 23:34:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-11-23 23:34:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 15018 transitions. [2019-11-23 23:34:05,934 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 15018 transitions. Word has length 181 [2019-11-23 23:34:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:05,934 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 15018 transitions. [2019-11-23 23:34:05,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:34:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 15018 transitions. [2019-11-23 23:34:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 23:34:05,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:05,948 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,948 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 908780436, now seen corresponding path program 1 times [2019-11-23 23:34:05,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:05,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042420566] [2019-11-23 23:34:05,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 23:34:06,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042420566] [2019-11-23 23:34:06,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:06,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:06,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256220514] [2019-11-23 23:34:06,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:06,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:06,036 INFO L87 Difference]: Start difference. First operand 12015 states and 15018 transitions. Second operand 4 states. [2019-11-23 23:34:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:07,267 INFO L93 Difference]: Finished difference Result 32323 states and 40863 transitions. [2019-11-23 23:34:07,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:07,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-23 23:34:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:07,306 INFO L225 Difference]: With dead ends: 32323 [2019-11-23 23:34:07,306 INFO L226 Difference]: Without dead ends: 20309 [2019-11-23 23:34:07,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20309 states. [2019-11-23 23:34:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20309 to 15733. [2019-11-23 23:34:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15733 states. [2019-11-23 23:34:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15733 states to 15733 states and 19484 transitions. [2019-11-23 23:34:07,553 INFO L78 Accepts]: Start accepts. Automaton has 15733 states and 19484 transitions. Word has length 185 [2019-11-23 23:34:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:07,553 INFO L462 AbstractCegarLoop]: Abstraction has 15733 states and 19484 transitions. [2019-11-23 23:34:07,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 15733 states and 19484 transitions. [2019-11-23 23:34:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-23 23:34:07,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:07,565 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:07,565 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2078782619, now seen corresponding path program 1 times [2019-11-23 23:34:07,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:07,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749626437] [2019-11-23 23:34:07,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:07,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749626437] [2019-11-23 23:34:07,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680754165] [2019-11-23 23:34:07,734 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:34:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:07,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:34:07,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:08,025 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:08,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:08,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:34:08,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166971561] [2019-11-23 23:34:08,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:08,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:08,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:08,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:08,092 INFO L87 Difference]: Start difference. First operand 15733 states and 19484 transitions. Second operand 3 states. [2019-11-23 23:34:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:09,006 INFO L93 Difference]: Finished difference Result 32609 states and 40357 transitions. [2019-11-23 23:34:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:09,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-11-23 23:34:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:09,039 INFO L225 Difference]: With dead ends: 32609 [2019-11-23 23:34:09,040 INFO L226 Difference]: Without dead ends: 16877 [2019-11-23 23:34:09,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16877 states. [2019-11-23 23:34:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16877 to 16448. [2019-11-23 23:34:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16448 states. [2019-11-23 23:34:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16448 states to 16448 states and 19863 transitions. [2019-11-23 23:34:09,277 INFO L78 Accepts]: Start accepts. Automaton has 16448 states and 19863 transitions. Word has length 191 [2019-11-23 23:34:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:09,277 INFO L462 AbstractCegarLoop]: Abstraction has 16448 states and 19863 transitions. [2019-11-23 23:34:09,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 16448 states and 19863 transitions. [2019-11-23 23:34:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-23 23:34:09,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:09,291 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:09,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:09,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:09,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1907076308, now seen corresponding path program 1 times [2019-11-23 23:34:09,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:09,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950977575] [2019-11-23 23:34:09,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 23:34:09,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950977575] [2019-11-23 23:34:09,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618966109] [2019-11-23 23:34:09,694 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:34:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:09,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:34:09,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 23:34:10,042 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 23:34:10,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:10,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-11-23 23:34:10,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651848472] [2019-11-23 23:34:10,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:10,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:10,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:10,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:10,120 INFO L87 Difference]: Start difference. First operand 16448 states and 19863 transitions. Second operand 3 states. [2019-11-23 23:34:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:11,196 INFO L93 Difference]: Finished difference Result 36184 states and 44130 transitions. [2019-11-23 23:34:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:11,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-23 23:34:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:11,236 INFO L225 Difference]: With dead ends: 36184 [2019-11-23 23:34:11,236 INFO L226 Difference]: Without dead ends: 19737 [2019-11-23 23:34:11,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 437 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19737 states. [2019-11-23 23:34:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19737 to 19737. [2019-11-23 23:34:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19737 states. [2019-11-23 23:34:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19737 states to 19737 states and 24239 transitions. [2019-11-23 23:34:11,529 INFO L78 Accepts]: Start accepts. Automaton has 19737 states and 24239 transitions. Word has length 220 [2019-11-23 23:34:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:11,529 INFO L462 AbstractCegarLoop]: Abstraction has 19737 states and 24239 transitions. [2019-11-23 23:34:11,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19737 states and 24239 transitions. [2019-11-23 23:34:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-23 23:34:11,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:11,553 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:11,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:11,765 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash -428853597, now seen corresponding path program 1 times [2019-11-23 23:34:11,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:11,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832728905] [2019-11-23 23:34:11,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:12,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832728905] [2019-11-23 23:34:12,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:12,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:12,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572352444] [2019-11-23 23:34:12,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:12,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:12,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:12,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:12,003 INFO L87 Difference]: Start difference. First operand 19737 states and 24239 transitions. Second operand 4 states. [2019-11-23 23:34:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:13,384 INFO L93 Difference]: Finished difference Result 55348 states and 67984 transitions. [2019-11-23 23:34:13,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:13,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-23 23:34:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:13,481 INFO L225 Difference]: With dead ends: 55348 [2019-11-23 23:34:13,481 INFO L226 Difference]: Without dead ends: 35612 [2019-11-23 23:34:13,498 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:34:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35612 states. [2019-11-23 23:34:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35612 to 31892. [2019-11-23 23:34:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31892 states. [2019-11-23 23:34:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31892 states to 31892 states and 38927 transitions. [2019-11-23 23:34:13,913 INFO L78 Accepts]: Start accepts. Automaton has 31892 states and 38927 transitions. Word has length 243 [2019-11-23 23:34:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:13,913 INFO L462 AbstractCegarLoop]: Abstraction has 31892 states and 38927 transitions. [2019-11-23 23:34:13,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31892 states and 38927 transitions. [2019-11-23 23:34:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-23 23:34:13,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:13,941 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:34:13,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash 135935934, now seen corresponding path program 1 times [2019-11-23 23:34:13,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:13,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321003509] [2019-11-23 23:34:13,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:34:15,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321003509] [2019-11-23 23:34:15,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540166982] [2019-11-23 23:34:15,182 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:34:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:15,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:34:15,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:15,676 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:15,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:15,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2019-11-23 23:34:15,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127955858] [2019-11-23 23:34:15,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:15,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:15,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:15,836 INFO L87 Difference]: Start difference. First operand 31892 states and 38927 transitions. Second operand 4 states. [2019-11-23 23:34:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:17,440 INFO L93 Difference]: Finished difference Result 76222 states and 92738 transitions. [2019-11-23 23:34:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:17,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 274 [2019-11-23 23:34:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:17,442 INFO L225 Difference]: With dead ends: 76222 [2019-11-23 23:34:17,442 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:34:17,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 545 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:34:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:34:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:34:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:34:17,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2019-11-23 23:34:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:17,470 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:34:17,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:34:17,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:34:17,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:17,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:34:18,654 WARN L192 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 523 DAG size of output: 172 [2019-11-23 23:34:19,298 WARN L192 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 523 DAG size of output: 172 [2019-11-23 23:34:20,136 WARN L192 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 43 [2019-11-23 23:34:20,991 WARN L192 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 43 [2019-11-23 23:34:20,997 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,997 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,997 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,997 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,997 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,998 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 23:34:20,999 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,000 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,000 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,000 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,000 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,000 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,000 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,000 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,000 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,001 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,002 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,002 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 23:34:21,002 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,002 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,002 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,002 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,002 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,002 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,003 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,004 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,004 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,004 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,004 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,004 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,004 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,004 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,004 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,005 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (= ~a27~0 1)) (.cse8 (= ~a26~0 1)) (.cse9 (= ~a11~0 1))) (let ((.cse5 (not (= 1 ~a7~0))) (.cse2 (not .cse9)) (.cse3 (not (= 1 ~a6~0))) (.cse4 (or .cse1 .cse8)) (.cse0 (= 1 ~a5~0)) (.cse7 (= ~a16~0 1))) (or (and (<= 1 ~a3~0) .cse0) (and .cse1 .cse0) (and .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse5) (and .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse3) (and .cse4 .cse0 (let ((.cse6 (not (= ~a12~0 1)))) (or (and .cse6 .cse7 (<= ~a27~0 0)) (and .cse6 (<= ~a11~0 0) .cse7)))) (and (= ~a27~0 0) .cse0 .cse8) (and .cse4 .cse0 .cse9 .cse7)))) [2019-11-23 23:34:21,005 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,005 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,005 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,006 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1578) no Hoare annotation was computed. [2019-11-23 23:34:21,006 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,006 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 23:34:21,006 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,006 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,006 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,006 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,006 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,007 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,008 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= ~a27~0 1)) (.cse8 (= ~a26~0 1)) (.cse9 (= ~a11~0 1))) (let ((.cse5 (not (= 1 ~a7~0))) (.cse2 (not .cse9)) (.cse3 (not (= 1 ~a6~0))) (.cse4 (or .cse1 .cse8)) (.cse0 (= 1 ~a5~0)) (.cse7 (= ~a16~0 1))) (or (and (<= 1 ~a3~0) .cse0) (and .cse1 .cse0) (and .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse5) (and .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse3) (and .cse4 .cse0 (let ((.cse6 (not (= ~a12~0 1)))) (or (and .cse6 .cse7 (<= ~a27~0 0)) (and .cse6 (<= ~a11~0 0) .cse7)))) (and (= ~a27~0 0) .cse0 .cse8) (and .cse4 .cse0 .cse9 .cse7)))) [2019-11-23 23:34:21,008 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,008 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,008 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,008 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,008 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,008 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,009 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,010 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,011 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,011 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,011 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,011 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,011 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,011 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:34:21,011 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,012 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,012 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,012 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,012 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,012 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,012 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,012 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,012 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,013 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,014 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,015 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,015 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 23:34:21,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:34:21 BoogieIcfgContainer [2019-11-23 23:34:21,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:34:21,038 INFO L168 Benchmark]: Toolchain (without parser) took 32434.30 ms. Allocated memory was 145.2 MB in the beginning and 1.0 GB in the end (delta: 897.1 MB). Free memory was 98.2 MB in the beginning and 383.9 MB in the end (delta: -285.7 MB). Peak memory consumption was 709.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:34:21,039 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:34:21,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1519.43 ms. Allocated memory was 145.2 MB in the beginning and 235.4 MB in the end (delta: 90.2 MB). Free memory was 97.8 MB in the beginning and 181.8 MB in the end (delta: -84.1 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:34:21,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.57 ms. Allocated memory is still 235.4 MB. Free memory was 181.8 MB in the beginning and 166.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:34:21,041 INFO L168 Benchmark]: Boogie Preprocessor took 123.35 ms. Allocated memory is still 235.4 MB. Free memory was 166.9 MB in the beginning and 154.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:34:21,041 INFO L168 Benchmark]: RCFGBuilder took 3143.87 ms. Allocated memory was 235.4 MB in the beginning and 329.3 MB in the end (delta: 93.8 MB). Free memory was 154.5 MB in the beginning and 202.9 MB in the end (delta: -48.5 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:34:21,042 INFO L168 Benchmark]: TraceAbstraction took 27485.15 ms. Allocated memory was 329.3 MB in the beginning and 1.0 GB in the end (delta: 713.0 MB). Free memory was 202.9 MB in the beginning and 383.9 MB in the end (delta: -181.0 MB). Peak memory consumption was 630.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:34:21,047 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1519.43 ms. Allocated memory was 145.2 MB in the beginning and 235.4 MB in the end (delta: 90.2 MB). Free memory was 97.8 MB in the beginning and 181.8 MB in the end (delta: -84.1 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 157.57 ms. Allocated memory is still 235.4 MB. Free memory was 181.8 MB in the beginning and 166.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.35 ms. Allocated memory is still 235.4 MB. Free memory was 166.9 MB in the beginning and 154.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3143.87 ms. Allocated memory was 235.4 MB in the beginning and 329.3 MB in the end (delta: 93.8 MB). Free memory was 154.5 MB in the beginning and 202.9 MB in the end (delta: -48.5 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27485.15 ms. Allocated memory was 329.3 MB in the beginning and 1.0 GB in the end (delta: 713.0 MB). Free memory was 202.9 MB in the beginning and 383.9 MB in the end (delta: -181.0 MB). Peak memory consumption was 630.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1578]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((1 <= a3 && 1 == a5) || (a27 == 1 && 1 == a5)) || ((1 == a5 && !(a11 == 1)) && !(1 == a6))) || (((a27 == 1 || a26 == 1) && 1 == a5) && !(1 == a7))) || ((1 == a5 && !(1 == a7)) && !(a11 == 1))) || (((a27 == 1 || a26 == 1) && 1 == a5) && !(1 == a6))) || (((a27 == 1 || a26 == 1) && 1 == a5) && (((!(a12 == 1) && a16 == 1) && a27 <= 0) || ((!(a12 == 1) && a11 <= 0) && a16 == 1)))) || ((a27 == 0 && 1 == a5) && a26 == 1)) || ((((a27 == 1 || a26 == 1) && 1 == a5) && a11 == 1) && a16 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((1 <= a3 && 1 == a5) || (a27 == 1 && 1 == a5)) || ((1 == a5 && !(a11 == 1)) && !(1 == a6))) || (((a27 == 1 || a26 == 1) && 1 == a5) && !(1 == a7))) || ((1 == a5 && !(1 == a7)) && !(a11 == 1))) || (((a27 == 1 || a26 == 1) && 1 == a5) && !(1 == a6))) || (((a27 == 1 || a26 == 1) && 1 == a5) && (((!(a12 == 1) && a16 == 1) && a27 <= 0) || ((!(a12 == 1) && a11 <= 0) && a16 == 1)))) || ((a27 == 0 && 1 == a5) && a26 == 1)) || ((((a27 == 1 || a26 == 1) && 1 == a5) && a11 == 1) && a16 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: SAFE, OverallTime: 27.3s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, HoareTripleCheckerStatistics: 1300 SDtfs, 3417 SDslu, 362 SDs, 0 SdLazy, 7481 SolverSat, 1838 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1410 GetRequests, 1375 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31892occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 9877 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 590 NumberOfFragments, 261 HoareAnnotationTreeSize, 3 FomulaSimplifications, 30522 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 8450 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3241 NumberOfCodeBlocks, 3241 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3906 ConstructedInterpolants, 0 QuantifiedInterpolants, 2532003 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1337 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 1225/1235 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...