/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:41,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:41,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:41,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:41,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:41,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:41,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:41,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:41,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:41,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:41,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:41,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:41,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:41,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:41,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:41,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:41,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:41,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:41,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:41,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:41,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:41,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:41,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:41,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:41,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:41,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:41,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:41,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:41,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:41,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:41,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:41,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:41,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:41,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:41,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:41,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:41,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:41,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:41,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:41,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:41,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:41,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:30:41,138 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:41,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:41,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:41,139 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:41,139 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:41,140 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:41,140 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:41,140 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:41,140 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:41,140 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:41,140 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:41,141 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:41,141 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:41,141 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:41,141 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:41,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:41,142 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:41,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:41,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:41,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:41,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:41,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:41,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:41,145 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:41,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:41,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:41,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:41,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:41,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:41,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:41,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:41,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:41,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:41,147 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:41,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:41,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:41,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:41,148 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:41,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:41,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:41,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:41,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:41,460 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:41,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label24.c [2019-11-23 23:30:41,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30736e783/95e1e0b8294042a98c70f1c1b94655cb/FLAGb18ea48fb [2019-11-23 23:30:42,094 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:42,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label24.c [2019-11-23 23:30:42,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30736e783/95e1e0b8294042a98c70f1c1b94655cb/FLAGb18ea48fb [2019-11-23 23:30:42,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30736e783/95e1e0b8294042a98c70f1c1b94655cb [2019-11-23 23:30:42,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:42,401 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:42,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:42,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:42,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:42,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:42" (1/1) ... [2019-11-23 23:30:42,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18bcd91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:42, skipping insertion in model container [2019-11-23 23:30:42,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:42" (1/1) ... [2019-11-23 23:30:42,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:42,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:43,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:43,019 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:43,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:43,133 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:43,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43 WrapperNode [2019-11-23 23:30:43,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:43,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:43,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:43,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:43,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:43,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:43,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:43,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:43,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:43,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:43,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:43,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:43,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:43,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:45,519 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:45,520 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:45,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:45 BoogieIcfgContainer [2019-11-23 23:30:45,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:45,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:45,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:45,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:45,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:42" (1/3) ... [2019-11-23 23:30:45,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5f87a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:45, skipping insertion in model container [2019-11-23 23:30:45,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (2/3) ... [2019-11-23 23:30:45,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5f87a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:45, skipping insertion in model container [2019-11-23 23:30:45,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:45" (3/3) ... [2019-11-23 23:30:45,530 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label24.c [2019-11-23 23:30:45,540 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:45,548 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:45,561 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:45,587 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:45,587 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:45,587 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:45,587 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:45,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:45,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:45,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:45,588 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:45,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:45,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:45,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:45,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1323243039, now seen corresponding path program 1 times [2019-11-23 23:30:45,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:45,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088453090] [2019-11-23 23:30:45,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:46,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088453090] [2019-11-23 23:30:46,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:46,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:46,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127693474] [2019-11-23 23:30:46,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:46,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:46,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:46,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:46,179 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:46,954 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:46,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:46,974 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:46,974 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:46,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:30:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:30:47,050 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:30:47,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:47,051 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:30:47,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:30:47,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:30:47,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:47,059 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:47,059 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:47,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:47,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1048395660, now seen corresponding path program 1 times [2019-11-23 23:30:47,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:47,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544099817] [2019-11-23 23:30:47,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:47,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544099817] [2019-11-23 23:30:47,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:47,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:47,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560712788] [2019-11-23 23:30:47,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:47,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:47,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:47,115 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:30:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:47,709 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:30:47,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:47,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:30:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:47,713 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:30:47,713 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:47,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-23 23:30:47,779 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-23 23:30:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:47,779 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-23 23:30:47,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-23 23:30:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:30:47,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:47,785 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:47,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2123300332, now seen corresponding path program 1 times [2019-11-23 23:30:47,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:47,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538874092] [2019-11-23 23:30:47,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:47,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538874092] [2019-11-23 23:30:47,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:47,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:47,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304685499] [2019-11-23 23:30:47,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:47,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:47,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:47,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:47,885 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 4 states. [2019-11-23 23:30:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:48,513 INFO L93 Difference]: Finished difference Result 1425 states and 2333 transitions. [2019-11-23 23:30:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:48,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-23 23:30:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:48,520 INFO L225 Difference]: With dead ends: 1425 [2019-11-23 23:30:48,520 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:30:48,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:30:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 571. [2019-11-23 23:30:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:30:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 820 transitions. [2019-11-23 23:30:48,555 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 820 transitions. Word has length 78 [2019-11-23 23:30:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:48,556 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 820 transitions. [2019-11-23 23:30:48,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 820 transitions. [2019-11-23 23:30:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 23:30:48,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:48,563 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:48,563 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:48,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:48,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2133653614, now seen corresponding path program 1 times [2019-11-23 23:30:48,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:48,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673960843] [2019-11-23 23:30:48,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:48,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673960843] [2019-11-23 23:30:48,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:48,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:48,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950836389] [2019-11-23 23:30:48,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:48,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:48,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:48,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:48,642 INFO L87 Difference]: Start difference. First operand 571 states and 820 transitions. Second operand 3 states. [2019-11-23 23:30:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:49,030 INFO L93 Difference]: Finished difference Result 1283 states and 1815 transitions. [2019-11-23 23:30:49,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:49,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 23:30:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:49,036 INFO L225 Difference]: With dead ends: 1283 [2019-11-23 23:30:49,036 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:30:49,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:30:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 571. [2019-11-23 23:30:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:30:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 782 transitions. [2019-11-23 23:30:49,074 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 782 transitions. Word has length 94 [2019-11-23 23:30:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:49,075 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 782 transitions. [2019-11-23 23:30:49,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 782 transitions. [2019-11-23 23:30:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 23:30:49,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:49,085 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:49,085 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:49,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:49,086 INFO L82 PathProgramCache]: Analyzing trace with hash 501972945, now seen corresponding path program 1 times [2019-11-23 23:30:49,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:49,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495862189] [2019-11-23 23:30:49,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 23:30:49,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495862189] [2019-11-23 23:30:49,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:49,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:49,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682763533] [2019-11-23 23:30:49,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:49,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:49,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:49,217 INFO L87 Difference]: Start difference. First operand 571 states and 782 transitions. Second operand 3 states. [2019-11-23 23:30:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:49,546 INFO L93 Difference]: Finished difference Result 1425 states and 1961 transitions. [2019-11-23 23:30:49,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:49,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 23:30:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:49,550 INFO L225 Difference]: With dead ends: 1425 [2019-11-23 23:30:49,551 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:30:49,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:30:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 713. [2019-11-23 23:30:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 854 transitions. [2019-11-23 23:30:49,571 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 854 transitions. Word has length 105 [2019-11-23 23:30:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:49,571 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 854 transitions. [2019-11-23 23:30:49,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 854 transitions. [2019-11-23 23:30:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-23 23:30:49,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:49,574 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:49,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash -802120607, now seen corresponding path program 1 times [2019-11-23 23:30:49,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:49,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687585749] [2019-11-23 23:30:49,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-23 23:30:49,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687585749] [2019-11-23 23:30:49,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:49,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:49,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641569841] [2019-11-23 23:30:49,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:49,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:49,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:49,634 INFO L87 Difference]: Start difference. First operand 713 states and 854 transitions. Second operand 3 states. [2019-11-23 23:30:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:50,013 INFO L93 Difference]: Finished difference Result 1780 states and 2146 transitions. [2019-11-23 23:30:50,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:50,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-23 23:30:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:50,019 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:30:50,019 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:50,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-23 23:30:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1103 transitions. [2019-11-23 23:30:50,051 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1103 transitions. Word has length 124 [2019-11-23 23:30:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:50,051 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1103 transitions. [2019-11-23 23:30:50,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1103 transitions. [2019-11-23 23:30:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-23 23:30:50,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:50,056 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:50,057 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1331378472, now seen corresponding path program 1 times [2019-11-23 23:30:50,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:50,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453707375] [2019-11-23 23:30:50,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:30:50,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453707375] [2019-11-23 23:30:50,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:50,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:50,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890895837] [2019-11-23 23:30:50,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:50,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:50,134 INFO L87 Difference]: Start difference. First operand 926 states and 1103 transitions. Second operand 3 states. [2019-11-23 23:30:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:50,429 INFO L93 Difference]: Finished difference Result 1993 states and 2370 transitions. [2019-11-23 23:30:50,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:50,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-23 23:30:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:50,435 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:30:50,435 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:50,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2019-11-23 23:30:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1258 transitions. [2019-11-23 23:30:50,463 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1258 transitions. Word has length 127 [2019-11-23 23:30:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:50,464 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1258 transitions. [2019-11-23 23:30:50,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1258 transitions. [2019-11-23 23:30:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:30:50,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:50,467 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:50,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1638315872, now seen corresponding path program 1 times [2019-11-23 23:30:50,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:50,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954969042] [2019-11-23 23:30:50,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-23 23:30:50,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954969042] [2019-11-23 23:30:50,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:50,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 23:30:50,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075184707] [2019-11-23 23:30:50,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:30:50,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:30:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:30:50,630 INFO L87 Difference]: Start difference. First operand 1068 states and 1258 transitions. Second operand 6 states. [2019-11-23 23:30:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:51,378 INFO L93 Difference]: Finished difference Result 2138 states and 2531 transitions. [2019-11-23 23:30:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 23:30:51,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-23 23:30:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:51,385 INFO L225 Difference]: With dead ends: 2138 [2019-11-23 23:30:51,386 INFO L226 Difference]: Without dead ends: 1142 [2019-11-23 23:30:51,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-11-23 23:30:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1068. [2019-11-23 23:30:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1244 transitions. [2019-11-23 23:30:51,410 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1244 transitions. Word has length 131 [2019-11-23 23:30:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:51,410 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1244 transitions. [2019-11-23 23:30:51,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:30:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1244 transitions. [2019-11-23 23:30:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 23:30:51,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:51,414 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:51,414 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:51,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2055473488, now seen corresponding path program 1 times [2019-11-23 23:30:51,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:51,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421518072] [2019-11-23 23:30:51,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-23 23:30:51,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421518072] [2019-11-23 23:30:51,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:51,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:51,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347046798] [2019-11-23 23:30:51,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:51,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:51,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:51,527 INFO L87 Difference]: Start difference. First operand 1068 states and 1244 transitions. Second operand 4 states. [2019-11-23 23:30:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:52,031 INFO L93 Difference]: Finished difference Result 2277 states and 2651 transitions. [2019-11-23 23:30:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:52,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-23 23:30:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:52,037 INFO L225 Difference]: With dead ends: 2277 [2019-11-23 23:30:52,038 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:30:52,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:30:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-23 23:30:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1202 transitions. [2019-11-23 23:30:52,062 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1202 transitions. Word has length 164 [2019-11-23 23:30:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:52,062 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1202 transitions. [2019-11-23 23:30:52,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1202 transitions. [2019-11-23 23:30:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-23 23:30:52,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:52,066 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:52,066 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash 634321042, now seen corresponding path program 1 times [2019-11-23 23:30:52,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:52,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956407450] [2019-11-23 23:30:52,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:30:52,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956407450] [2019-11-23 23:30:52,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:52,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:52,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229026484] [2019-11-23 23:30:52,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:52,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:52,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:52,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:52,198 INFO L87 Difference]: Start difference. First operand 1068 states and 1202 transitions. Second operand 4 states. [2019-11-23 23:30:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:52,616 INFO L93 Difference]: Finished difference Result 2135 states and 2405 transitions. [2019-11-23 23:30:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:52,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-23 23:30:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:52,624 INFO L225 Difference]: With dead ends: 2135 [2019-11-23 23:30:52,624 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:30:52,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:30:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-23 23:30:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1201 transitions. [2019-11-23 23:30:52,648 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1201 transitions. Word has length 170 [2019-11-23 23:30:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:52,649 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1201 transitions. [2019-11-23 23:30:52,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1201 transitions. [2019-11-23 23:30:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-23 23:30:52,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:52,653 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:52,653 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:52,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1529648803, now seen corresponding path program 1 times [2019-11-23 23:30:52,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:52,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054504509] [2019-11-23 23:30:52,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 23:30:52,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054504509] [2019-11-23 23:30:52,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:52,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:30:52,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088506408] [2019-11-23 23:30:52,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:30:52,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:52,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:30:52,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:30:52,827 INFO L87 Difference]: Start difference. First operand 1068 states and 1201 transitions. Second operand 6 states. [2019-11-23 23:30:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:53,264 INFO L93 Difference]: Finished difference Result 2170 states and 2447 transitions. [2019-11-23 23:30:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:53,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2019-11-23 23:30:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:53,270 INFO L225 Difference]: With dead ends: 2170 [2019-11-23 23:30:53,271 INFO L226 Difference]: Without dead ends: 1174 [2019-11-23 23:30:53,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:30:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-23 23:30:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1068. [2019-11-23 23:30:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1187 transitions. [2019-11-23 23:30:53,300 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1187 transitions. Word has length 191 [2019-11-23 23:30:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:53,301 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1187 transitions. [2019-11-23 23:30:53,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:30:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1187 transitions. [2019-11-23 23:30:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 23:30:53,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:53,306 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:53,306 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:53,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1379061172, now seen corresponding path program 1 times [2019-11-23 23:30:53,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:53,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841615845] [2019-11-23 23:30:53,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-23 23:30:53,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841615845] [2019-11-23 23:30:53,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:53,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:53,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54063775] [2019-11-23 23:30:53,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:53,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:53,493 INFO L87 Difference]: Start difference. First operand 1068 states and 1187 transitions. Second operand 4 states. [2019-11-23 23:30:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:53,876 INFO L93 Difference]: Finished difference Result 2062 states and 2298 transitions. [2019-11-23 23:30:53,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:53,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-23 23:30:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:53,877 INFO L225 Difference]: With dead ends: 2062 [2019-11-23 23:30:53,877 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:53,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:53,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2019-11-23 23:30:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:53,882 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:53,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:53,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:53,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:54,028 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 67 [2019-11-23 23:30:54,445 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-23 23:30:54,735 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-11-23 23:30:54,738 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:54,739 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:54,739 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:54,739 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:54,739 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:54,739 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:54,739 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:54,740 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:54,740 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:54,740 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:54,740 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 23:30:54,740 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:54,740 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:54,740 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:54,740 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:54,741 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:54,741 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:54,741 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:54,741 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:54,741 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:54,742 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a16~0 6)) (.cse8 (not (= 15 ~a8~0)))) (let ((.cse1 (<= ~a20~0 0)) (.cse9 (= ~a16~0 5)) (.cse5 (not (= 1 ~a7~0))) (.cse3 (<= ~a17~0 0)) (.cse11 (= ~a12~0 8)) (.cse6 (= ~a20~0 1)) (.cse0 (or (and (not .cse7) .cse8) (= 13 ~a8~0))) (.cse2 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse5 .cse4 .cse7 .cse1) (and .cse8 .cse5 .cse9) (and .cse5 .cse4 .cse6 .cse9) (and .cse5 .cse10 .cse11 .cse4 .cse1) (and .cse8 .cse4 .cse9) (and .cse4 .cse1 .cse9) (and .cse0 .cse4 .cse6) (and .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse2 .cse3) (and .cse0 .cse10 .cse11 .cse6) (and .cse0 .cse7) (and .cse0 .cse2 .cse4 (not .cse10))))) [2019-11-23 23:30:54,742 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:54,742 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:54,742 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:54,742 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:54,743 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:54,743 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:54,743 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:54,743 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:54,743 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:54,743 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:54,743 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:54,743 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:54,744 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:54,744 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:54,744 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:54,744 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:54,744 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:54,744 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:54,744 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:54,745 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:54,745 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:54,745 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:54,745 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:54,745 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a16~0 6)) (.cse8 (not (= 15 ~a8~0)))) (let ((.cse1 (<= ~a20~0 0)) (.cse9 (= ~a16~0 5)) (.cse5 (not (= 1 ~a7~0))) (.cse3 (<= ~a17~0 0)) (.cse11 (= ~a12~0 8)) (.cse6 (= ~a20~0 1)) (.cse0 (or (and (not .cse7) .cse8) (= 13 ~a8~0))) (.cse2 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse5 .cse4 .cse7 .cse1) (and .cse8 .cse5 .cse9) (and .cse5 .cse4 .cse6 .cse9) (and .cse5 .cse10 .cse11 .cse4 .cse1) (and .cse8 .cse4 .cse9) (and .cse4 .cse1 .cse9) (and .cse0 .cse4 .cse6) (and .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse2 .cse3) (and .cse0 .cse10 .cse11 .cse6) (and .cse0 .cse7) (and .cse0 .cse2 .cse4 (not .cse10))))) [2019-11-23 23:30:54,745 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:54,746 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:54,746 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:54,746 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:54,746 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:54,746 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:54,746 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:54,746 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:54,747 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:54,747 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:54,747 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:54,747 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:54,747 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:54,747 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:54,747 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:54,747 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:54,748 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:54,750 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:54,750 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:54,750 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:54,750 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:54,750 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:54,750 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:54,751 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 470) no Hoare annotation was computed. [2019-11-23 23:30:54,751 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:54,751 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:54,751 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:54,751 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:54,751 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:54,751 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:54,751 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:54,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:54 BoogieIcfgContainer [2019-11-23 23:30:54,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:54,789 INFO L168 Benchmark]: Toolchain (without parser) took 12385.48 ms. Allocated memory was 145.2 MB in the beginning and 386.9 MB in the end (delta: 241.7 MB). Free memory was 101.0 MB in the beginning and 82.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:54,790 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:30:54,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.38 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.8 MB in the beginning and 166.2 MB in the end (delta: -65.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:54,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.74 ms. Allocated memory is still 203.9 MB. Free memory was 166.2 MB in the beginning and 160.0 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:54,792 INFO L168 Benchmark]: Boogie Preprocessor took 80.03 ms. Allocated memory is still 203.9 MB. Free memory was 160.0 MB in the beginning and 155.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:54,797 INFO L168 Benchmark]: RCFGBuilder took 2202.92 ms. Allocated memory was 203.9 MB in the beginning and 250.1 MB in the end (delta: 46.1 MB). Free memory was 155.2 MB in the beginning and 201.6 MB in the end (delta: -46.5 MB). Peak memory consumption was 110.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:54,822 INFO L168 Benchmark]: TraceAbstraction took 9261.61 ms. Allocated memory was 250.1 MB in the beginning and 386.9 MB in the end (delta: 136.8 MB). Free memory was 201.6 MB in the beginning and 82.4 MB in the end (delta: 119.2 MB). Peak memory consumption was 256.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:54,827 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.27 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.38 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.8 MB in the beginning and 166.2 MB in the end (delta: -65.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.74 ms. Allocated memory is still 203.9 MB. Free memory was 166.2 MB in the beginning and 160.0 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.03 ms. Allocated memory is still 203.9 MB. Free memory was 160.0 MB in the beginning and 155.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2202.92 ms. Allocated memory was 203.9 MB in the beginning and 250.1 MB in the end (delta: 46.1 MB). Free memory was 155.2 MB in the beginning and 201.6 MB in the end (delta: -46.5 MB). Peak memory consumption was 110.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9261.61 ms. Allocated memory was 250.1 MB in the beginning and 386.9 MB in the end (delta: 136.8 MB). Free memory was 201.6 MB in the beginning and 82.4 MB in the end (delta: 119.2 MB). Peak memory consumption was 256.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 470]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a20 <= 0) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((((a16 == 4 && !(1 == a7)) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && a20 <= 0)) || ((!(15 == a8) && !(1 == a7)) && a16 == 5)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 5)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a17 <= 0)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 6)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a20 <= 0) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((((a16 == 4 && !(1 == a7)) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && a20 <= 0)) || ((!(15 == a8) && !(1 == a7)) && a16 == 5)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 5)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a17 <= 0)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 6)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a21 == 1) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.1s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 645 SDtfs, 1516 SDslu, 94 SDs, 0 SdLazy, 3631 SolverSat, 756 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 489 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2761 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 323 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1545 NumberOfCodeBlocks, 1545 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1533 ConstructedInterpolants, 0 QuantifiedInterpolants, 497891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1309/1309 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...