/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/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:19:13,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:19:13,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:19:13,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:19:13,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:19:13,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:19:13,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:19:13,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:19:13,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:19:13,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:19:13,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:19:13,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:19:13,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:19:13,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:19:13,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:19:13,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:19:13,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:19:13,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:19:13,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:19:13,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:19:13,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:19:13,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:19:13,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:19:13,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:19:13,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:19:13,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:19:13,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:19:13,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:19:13,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:19:13,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:19:13,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:19:13,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:19:13,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:19:13,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:19:13,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:19:13,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:19:13,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:19:13,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:19:13,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:19:13,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:19:13,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:19:13,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:19:13,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:19:13,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:19:13,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:19:13,278 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:19:13,278 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:19:13,278 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:19:13,278 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:19:13,278 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:19:13,278 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:19:13,279 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:19:13,280 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:19:13,280 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:19:13,280 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:19:13,281 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:19:13,281 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:19:13,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:19:13,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:19:13,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:19:13,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:19:13,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:19:13,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:19:13,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:19:13,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:19:13,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:19:13,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:19:13,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:19:13,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:19:13,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:19:13,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:19:13,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:19:13,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:19:13,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:19:13,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:19:13,287 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:19:13,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:19:13,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:19:13,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:19:13,288 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:19:13,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:19:13,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:19:13,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:19:13,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:19:13,566 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:19:13,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-24 04:19:13,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7738ce224/8060c8caf96d430a82f58b3ce7ae4a58/FLAG804c16cc9 [2019-11-24 04:19:14,084 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:19:14,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-24 04:19:14,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7738ce224/8060c8caf96d430a82f58b3ce7ae4a58/FLAG804c16cc9 [2019-11-24 04:19:14,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7738ce224/8060c8caf96d430a82f58b3ce7ae4a58 [2019-11-24 04:19:14,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:19:14,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:19:14,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:19:14,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:19:14,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:19:14,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38616e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14, skipping insertion in model container [2019-11-24 04:19:14,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:19:14,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:19:14,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:19:14,750 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:19:14,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:19:14,797 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:19:14,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14 WrapperNode [2019-11-24 04:19:14,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:19:14,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:19:14,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:19:14,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:19:14,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:19:14,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:19:14,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:19:14,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:19:14,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... [2019-11-24 04:19:14,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:19:14,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:19:14,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:19:14,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:19:14,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:19:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:19:15,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:19:15,443 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:19:15,443 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 04:19:15,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:19:15 BoogieIcfgContainer [2019-11-24 04:19:15,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:19:15,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:19:15,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:19:15,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:19:15,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:19:14" (1/3) ... [2019-11-24 04:19:15,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b12b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:19:15, skipping insertion in model container [2019-11-24 04:19:15,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:14" (2/3) ... [2019-11-24 04:19:15,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b12b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:19:15, skipping insertion in model container [2019-11-24 04:19:15,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:19:15" (3/3) ... [2019-11-24 04:19:15,458 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-11-24 04:19:15,468 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:19:15,475 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-24 04:19:15,487 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-24 04:19:15,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:19:15,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:19:15,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:19:15,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:19:15,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:19:15,513 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:19:15,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:19:15,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:19:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-11-24 04:19:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:19:15,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:15,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:15,537 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2133700231, now seen corresponding path program 1 times [2019-11-24 04:19:15,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:15,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433981631] [2019-11-24 04:19:15,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:15,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433981631] [2019-11-24 04:19:15,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:15,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:15,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215273404] [2019-11-24 04:19:15,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:15,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:15,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:15,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:15,776 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 4 states. [2019-11-24 04:19:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:15,964 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2019-11-24 04:19:15,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:15,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 04:19:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:15,981 INFO L225 Difference]: With dead ends: 124 [2019-11-24 04:19:15,981 INFO L226 Difference]: Without dead ends: 108 [2019-11-24 04:19:15,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-24 04:19:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2019-11-24 04:19:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 04:19:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 04:19:16,038 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 7 [2019-11-24 04:19:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:16,039 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 04:19:16,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 04:19:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:19:16,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:16,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:16,043 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2130064740, now seen corresponding path program 1 times [2019-11-24 04:19:16,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:16,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467301768] [2019-11-24 04:19:16,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:16,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467301768] [2019-11-24 04:19:16,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:16,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:16,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269010730] [2019-11-24 04:19:16,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:16,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:16,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:16,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:16,119 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-11-24 04:19:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:16,195 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-24 04:19:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:16,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 04:19:16,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:16,197 INFO L225 Difference]: With dead ends: 64 [2019-11-24 04:19:16,197 INFO L226 Difference]: Without dead ends: 62 [2019-11-24 04:19:16,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-24 04:19:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-24 04:19:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 04:19:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-24 04:19:16,208 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 7 [2019-11-24 04:19:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:16,208 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-24 04:19:16,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-24 04:19:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:19:16,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:16,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:16,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:16,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:16,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1607501556, now seen corresponding path program 1 times [2019-11-24 04:19:16,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:16,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15051089] [2019-11-24 04:19:16,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:16,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15051089] [2019-11-24 04:19:16,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:16,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:16,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126094403] [2019-11-24 04:19:16,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:16,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:16,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:16,290 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-11-24 04:19:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:16,383 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-24 04:19:16,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:16,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-24 04:19:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:16,386 INFO L225 Difference]: With dead ends: 68 [2019-11-24 04:19:16,386 INFO L226 Difference]: Without dead ends: 66 [2019-11-24 04:19:16,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-24 04:19:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-11-24 04:19:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-24 04:19:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-24 04:19:16,398 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2019-11-24 04:19:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:16,398 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-24 04:19:16,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-24 04:19:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:19:16,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:16,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:16,401 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash -448408979, now seen corresponding path program 1 times [2019-11-24 04:19:16,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:16,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241740763] [2019-11-24 04:19:16,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:16,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241740763] [2019-11-24 04:19:16,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:16,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:16,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218457462] [2019-11-24 04:19:16,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:16,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:16,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:16,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:16,493 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-11-24 04:19:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:16,604 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-24 04:19:16,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:16,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-24 04:19:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:16,606 INFO L225 Difference]: With dead ends: 66 [2019-11-24 04:19:16,606 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 04:19:16,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 04:19:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-11-24 04:19:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-24 04:19:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-24 04:19:16,614 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 10 [2019-11-24 04:19:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:16,614 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-24 04:19:16,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-24 04:19:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:19:16,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:16,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:16,616 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1379104200, now seen corresponding path program 1 times [2019-11-24 04:19:16,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:16,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904953618] [2019-11-24 04:19:16,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:16,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904953618] [2019-11-24 04:19:16,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:16,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:16,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008891375] [2019-11-24 04:19:16,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:16,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:16,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:16,680 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-11-24 04:19:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:16,788 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-24 04:19:16,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:16,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-24 04:19:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:16,792 INFO L225 Difference]: With dead ends: 64 [2019-11-24 04:19:16,793 INFO L226 Difference]: Without dead ends: 62 [2019-11-24 04:19:16,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-24 04:19:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-24 04:19:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 04:19:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-24 04:19:16,808 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 10 [2019-11-24 04:19:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:16,808 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-24 04:19:16,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-24 04:19:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:19:16,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:16,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:16,810 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:16,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1015772272, now seen corresponding path program 1 times [2019-11-24 04:19:16,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:16,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585375873] [2019-11-24 04:19:16,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:16,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585375873] [2019-11-24 04:19:16,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:16,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:16,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071964755] [2019-11-24 04:19:16,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:16,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:16,903 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2019-11-24 04:19:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:16,968 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-11-24 04:19:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:16,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-24 04:19:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:16,970 INFO L225 Difference]: With dead ends: 62 [2019-11-24 04:19:16,970 INFO L226 Difference]: Without dead ends: 58 [2019-11-24 04:19:16,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-24 04:19:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-11-24 04:19:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-24 04:19:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-11-24 04:19:16,983 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 11 [2019-11-24 04:19:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:16,983 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-11-24 04:19:16,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-11-24 04:19:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:19:16,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:16,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:16,987 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1015281714, now seen corresponding path program 1 times [2019-11-24 04:19:16,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:16,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223497339] [2019-11-24 04:19:16,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:17,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223497339] [2019-11-24 04:19:17,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:17,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:17,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597949016] [2019-11-24 04:19:17,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:17,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:17,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:17,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:17,087 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 6 states. [2019-11-24 04:19:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:17,197 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-24 04:19:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:17,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-24 04:19:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:17,199 INFO L225 Difference]: With dead ends: 99 [2019-11-24 04:19:17,199 INFO L226 Difference]: Without dead ends: 97 [2019-11-24 04:19:17,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-24 04:19:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2019-11-24 04:19:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 04:19:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-24 04:19:17,205 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2019-11-24 04:19:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:17,206 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-24 04:19:17,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-24 04:19:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:19:17,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:17,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:17,207 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:17,207 INFO L82 PathProgramCache]: Analyzing trace with hash 197446834, now seen corresponding path program 1 times [2019-11-24 04:19:17,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:17,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137328430] [2019-11-24 04:19:17,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:17,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137328430] [2019-11-24 04:19:17,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:17,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:17,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682163555] [2019-11-24 04:19:17,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:17,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:17,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:17,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:17,242 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-11-24 04:19:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:17,300 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-24 04:19:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:17,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-24 04:19:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:17,302 INFO L225 Difference]: With dead ends: 56 [2019-11-24 04:19:17,302 INFO L226 Difference]: Without dead ends: 52 [2019-11-24 04:19:17,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-24 04:19:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-11-24 04:19:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-24 04:19:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-24 04:19:17,307 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2019-11-24 04:19:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:17,307 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-24 04:19:17,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-24 04:19:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:19:17,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:17,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:17,309 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1408957852, now seen corresponding path program 1 times [2019-11-24 04:19:17,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:17,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50162975] [2019-11-24 04:19:17,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:17,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50162975] [2019-11-24 04:19:17,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:17,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:17,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079725086] [2019-11-24 04:19:17,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:17,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:17,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:17,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:17,420 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2019-11-24 04:19:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:17,540 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2019-11-24 04:19:17,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:17,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-24 04:19:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:17,542 INFO L225 Difference]: With dead ends: 90 [2019-11-24 04:19:17,542 INFO L226 Difference]: Without dead ends: 88 [2019-11-24 04:19:17,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:19:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-24 04:19:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 49. [2019-11-24 04:19:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-24 04:19:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-24 04:19:17,548 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 12 [2019-11-24 04:19:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:17,549 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-24 04:19:17,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-24 04:19:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:19:17,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:17,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:17,551 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:17,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:17,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1842939021, now seen corresponding path program 1 times [2019-11-24 04:19:17,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:17,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035283797] [2019-11-24 04:19:17,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:17,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035283797] [2019-11-24 04:19:17,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:17,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:17,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937414724] [2019-11-24 04:19:17,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:17,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:17,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:17,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:17,597 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-11-24 04:19:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:17,686 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-11-24 04:19:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:17,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-24 04:19:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:17,690 INFO L225 Difference]: With dead ends: 67 [2019-11-24 04:19:17,690 INFO L226 Difference]: Without dead ends: 65 [2019-11-24 04:19:17,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-24 04:19:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-11-24 04:19:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-24 04:19:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-24 04:19:17,694 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 12 [2019-11-24 04:19:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:17,695 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-24 04:19:17,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-24 04:19:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:19:17,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:17,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:17,696 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:17,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1844662925, now seen corresponding path program 1 times [2019-11-24 04:19:17,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:17,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180678946] [2019-11-24 04:19:17,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:17,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180678946] [2019-11-24 04:19:17,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:17,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:17,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244914878] [2019-11-24 04:19:17,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:17,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:17,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:17,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:17,776 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2019-11-24 04:19:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:17,840 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-11-24 04:19:17,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:17,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-24 04:19:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:17,842 INFO L225 Difference]: With dead ends: 48 [2019-11-24 04:19:17,842 INFO L226 Difference]: Without dead ends: 46 [2019-11-24 04:19:17,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-24 04:19:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-11-24 04:19:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-24 04:19:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-24 04:19:17,848 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 12 [2019-11-24 04:19:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:17,848 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-24 04:19:17,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-24 04:19:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:19:17,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:17,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:17,851 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash -734819501, now seen corresponding path program 1 times [2019-11-24 04:19:17,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:17,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368255392] [2019-11-24 04:19:17,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:17,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368255392] [2019-11-24 04:19:17,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:17,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:17,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464176635] [2019-11-24 04:19:17,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:17,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:17,967 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-11-24 04:19:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:18,027 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-24 04:19:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:18,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-24 04:19:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:18,028 INFO L225 Difference]: With dead ends: 45 [2019-11-24 04:19:18,028 INFO L226 Difference]: Without dead ends: 43 [2019-11-24 04:19:18,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:19:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-24 04:19:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-24 04:19:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-24 04:19:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-24 04:19:18,032 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 13 [2019-11-24 04:19:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:18,032 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-24 04:19:18,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-24 04:19:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:19:18,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:18,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:18,033 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1296538901, now seen corresponding path program 1 times [2019-11-24 04:19:18,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:18,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276068160] [2019-11-24 04:19:18,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:18,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276068160] [2019-11-24 04:19:18,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:18,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:18,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205248677] [2019-11-24 04:19:18,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:18,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:18,090 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-11-24 04:19:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:18,164 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-11-24 04:19:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:18,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:19:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:18,165 INFO L225 Difference]: With dead ends: 56 [2019-11-24 04:19:18,165 INFO L226 Difference]: Without dead ends: 54 [2019-11-24 04:19:18,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-24 04:19:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-11-24 04:19:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 04:19:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-24 04:19:18,169 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 13 [2019-11-24 04:19:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:18,170 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-24 04:19:18,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-24 04:19:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:19:18,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:18,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:18,171 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:18,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:18,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1298086046, now seen corresponding path program 1 times [2019-11-24 04:19:18,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:18,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298502281] [2019-11-24 04:19:18,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:18,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298502281] [2019-11-24 04:19:18,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:18,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:18,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634399382] [2019-11-24 04:19:18,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:18,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:18,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:18,239 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-11-24 04:19:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:18,317 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-11-24 04:19:18,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:18,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-24 04:19:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:18,318 INFO L225 Difference]: With dead ends: 60 [2019-11-24 04:19:18,318 INFO L226 Difference]: Without dead ends: 58 [2019-11-24 04:19:18,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-24 04:19:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2019-11-24 04:19:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-24 04:19:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-24 04:19:18,322 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 13 [2019-11-24 04:19:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:18,322 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-24 04:19:18,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-24 04:19:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:19:18,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:18,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:18,323 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1349979981, now seen corresponding path program 1 times [2019-11-24 04:19:18,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:18,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683648203] [2019-11-24 04:19:18,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:18,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683648203] [2019-11-24 04:19:18,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:18,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:18,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628761461] [2019-11-24 04:19:18,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:18,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:18,385 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-11-24 04:19:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:18,434 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-24 04:19:18,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:18,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:19:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:18,435 INFO L225 Difference]: With dead ends: 36 [2019-11-24 04:19:18,435 INFO L226 Difference]: Without dead ends: 32 [2019-11-24 04:19:18,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-24 04:19:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-24 04:19:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-24 04:19:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-24 04:19:18,438 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 13 [2019-11-24 04:19:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:18,438 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-24 04:19:18,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-24 04:19:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:19:18,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:18,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:18,440 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1585965895, now seen corresponding path program 1 times [2019-11-24 04:19:18,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:18,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974991714] [2019-11-24 04:19:18,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:18,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974991714] [2019-11-24 04:19:18,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:18,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:18,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617369669] [2019-11-24 04:19:18,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:18,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:18,489 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-11-24 04:19:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:18,562 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-11-24 04:19:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:18,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-24 04:19:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:18,563 INFO L225 Difference]: With dead ends: 47 [2019-11-24 04:19:18,563 INFO L226 Difference]: Without dead ends: 45 [2019-11-24 04:19:18,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-24 04:19:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-11-24 04:19:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-24 04:19:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-24 04:19:18,567 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 14 [2019-11-24 04:19:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:18,567 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-24 04:19:18,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-24 04:19:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:19:18,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:18,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:18,568 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash 433495416, now seen corresponding path program 1 times [2019-11-24 04:19:18,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:18,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229051995] [2019-11-24 04:19:18,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:18,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229051995] [2019-11-24 04:19:18,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:18,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:18,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623760161] [2019-11-24 04:19:18,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:18,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:18,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:18,603 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2019-11-24 04:19:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:18,688 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-11-24 04:19:18,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:18,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 04:19:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:18,690 INFO L225 Difference]: With dead ends: 51 [2019-11-24 04:19:18,691 INFO L226 Difference]: Without dead ends: 49 [2019-11-24 04:19:18,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-24 04:19:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2019-11-24 04:19:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-24 04:19:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-24 04:19:18,695 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-11-24 04:19:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:18,696 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-24 04:19:18,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-24 04:19:18,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:19:18,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:18,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:18,697 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:18,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:18,697 INFO L82 PathProgramCache]: Analyzing trace with hash 553460123, now seen corresponding path program 1 times [2019-11-24 04:19:18,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:18,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658655186] [2019-11-24 04:19:18,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:18,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658655186] [2019-11-24 04:19:18,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:18,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:18,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829072753] [2019-11-24 04:19:18,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:18,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:18,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:18,726 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-11-24 04:19:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:18,777 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-11-24 04:19:18,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:18,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:19:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:18,777 INFO L225 Difference]: With dead ends: 32 [2019-11-24 04:19:18,777 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:19:18,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:19:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:19:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:19:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:19:18,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-11-24 04:19:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:18,779 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:19:18,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:19:18,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:19:18,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:19:19,167 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-11-24 04:19:19,171 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-24 04:19:19,171 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-11-24 04:19:19,171 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-11-24 04:19:19,172 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-11-24 04:19:19,173 INFO L444 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-11-24 04:19:19,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-11-24 04:19:19,173 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-11-24 04:19:19,173 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-11-24 04:19:19,173 INFO L444 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-11-24 04:19:19,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-11-24 04:19:19,173 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-11-24 04:19:19,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-24 04:19:19,174 INFO L447 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-11-24 04:19:19,174 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-11-24 04:19:19,174 INFO L447 ceAbstractionStarter]: At program point L368(lines 10 370) the Hoare annotation is: true [2019-11-24 04:19:19,175 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-11-24 04:19:19,175 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-11-24 04:19:19,175 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-11-24 04:19:19,175 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-11-24 04:19:19,176 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-11-24 04:19:19,176 INFO L440 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-11-24 04:19:19,176 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-24 04:19:19,176 INFO L444 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-11-24 04:19:19,177 INFO L440 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-24 04:19:19,177 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-24 04:19:19,178 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-11-24 04:19:19,178 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-24 04:19:19,178 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-24 04:19:19,179 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-11-24 04:19:19,179 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-11-24 04:19:19,179 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-11-24 04:19:19,179 INFO L444 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-24 04:19:19,179 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-11-24 04:19:19,179 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-11-24 04:19:19,180 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-11-24 04:19:19,181 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-11-24 04:19:19,181 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:19:19,181 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-24 04:19:19,181 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-11-24 04:19:19,181 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-11-24 04:19:19,181 INFO L444 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-11-24 04:19:19,181 INFO L440 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-24 04:19:19,181 INFO L440 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-24 04:19:19,182 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-11-24 04:19:19,182 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-24 04:19:19,182 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-24 04:19:19,182 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-24 04:19:19,182 INFO L444 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-11-24 04:19:19,183 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-11-24 04:19:19,183 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-11-24 04:19:19,183 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-11-24 04:19:19,183 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-24 04:19:19,183 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-11-24 04:19:19,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:19:19 BoogieIcfgContainer [2019-11-24 04:19:19,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:19:19,210 INFO L168 Benchmark]: Toolchain (without parser) took 4737.46 ms. Allocated memory was 138.9 MB in the beginning and 245.4 MB in the end (delta: 106.4 MB). Free memory was 103.7 MB in the beginning and 116.0 MB in the end (delta: -12.3 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:19,211 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 04:19:19,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.59 ms. Allocated memory is still 138.9 MB. Free memory was 103.3 MB in the beginning and 90.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:19,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.72 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 90.8 MB in the beginning and 179.7 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:19,213 INFO L168 Benchmark]: Boogie Preprocessor took 24.82 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 178.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:19,214 INFO L168 Benchmark]: RCFGBuilder took 502.32 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 153.0 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:19,215 INFO L168 Benchmark]: TraceAbstraction took 3762.31 ms. Allocated memory was 201.9 MB in the beginning and 245.4 MB in the end (delta: 43.5 MB). Free memory was 152.3 MB in the beginning and 116.0 MB in the end (delta: 36.4 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:19,218 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.19 ms. Allocated memory is still 138.9 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 324.59 ms. Allocated memory is still 138.9 MB. Free memory was 103.3 MB in the beginning and 90.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 118.72 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 90.8 MB in the beginning and 179.7 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.82 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 178.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 502.32 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 153.0 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3762.31 ms. Allocated memory was 201.9 MB in the beginning and 245.4 MB in the end (delta: 43.5 MB). Free memory was 152.3 MB in the beginning and 116.0 MB in the end (delta: 36.4 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 69 locations, 17 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 705 SDtfs, 1368 SDslu, 609 SDs, 0 SdLazy, 1023 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 226 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 56 HoareAnnotationTreeSize, 6 FomulaSimplifications, 143036 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 8224 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 6465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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...