/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_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:26,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:26,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:26,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:26,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:26,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:26,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:26,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:26,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:26,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:26,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:26,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:26,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:26,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:26,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:26,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:26,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:26,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:26,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:26,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:26,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:26,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:26,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:26,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:26,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:26,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:26,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:26,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:26,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:26,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:26,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:26,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:26,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:26,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:26,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:26,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:26,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:26,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:26,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:26,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:26,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:26,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:31:26,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:26,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:26,257 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:26,257 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:26,258 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:26,258 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:26,258 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:26,258 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:26,258 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:26,258 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:26,259 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:26,259 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:26,259 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:26,259 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:26,259 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:26,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:26,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:26,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:26,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:26,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:26,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:26,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:26,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:26,262 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:26,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:26,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:26,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:26,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:26,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:26,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:26,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:26,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:26,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:26,264 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:26,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:26,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:26,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:26,265 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:26,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:26,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:26,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:26,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:26,582 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:26,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label48.c [2019-11-23 23:31:26,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d279d4b6/9e88d0ef9de0436e8ef4d9d0c3683afa/FLAG990571e5f [2019-11-23 23:31:27,203 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:27,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label48.c [2019-11-23 23:31:27,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d279d4b6/9e88d0ef9de0436e8ef4d9d0c3683afa/FLAG990571e5f [2019-11-23 23:31:27,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d279d4b6/9e88d0ef9de0436e8ef4d9d0c3683afa [2019-11-23 23:31:27,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:27,517 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:27,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:27,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:27,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:27,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:27" (1/1) ... [2019-11-23 23:31:27,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338ea0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:27, skipping insertion in model container [2019-11-23 23:31:27,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:27" (1/1) ... [2019-11-23 23:31:27,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:27,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:28,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:28,127 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:28,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:28,285 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:28,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28 WrapperNode [2019-11-23 23:31:28,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:28,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:28,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:28,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:28,293 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:31:28" (1/1) ... [2019-11-23 23:31:28,317 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:31:28" (1/1) ... [2019-11-23 23:31:28,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:28,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:28,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:28,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:28,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (1/1) ... [2019-11-23 23:31:28,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (1/1) ... [2019-11-23 23:31:28,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (1/1) ... [2019-11-23 23:31:28,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (1/1) ... [2019-11-23 23:31:28,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (1/1) ... [2019-11-23 23:31:28,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (1/1) ... [2019-11-23 23:31:28,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (1/1) ... [2019-11-23 23:31:28,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:28,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:28,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:28,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:28,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (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:31:28,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:28,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:30,458 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:30,458 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:30,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:30 BoogieIcfgContainer [2019-11-23 23:31:30,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:30,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:30,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:30,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:30,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:27" (1/3) ... [2019-11-23 23:31:30,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0e4ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:30, skipping insertion in model container [2019-11-23 23:31:30,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:28" (2/3) ... [2019-11-23 23:31:30,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0e4ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:30, skipping insertion in model container [2019-11-23 23:31:30,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:30" (3/3) ... [2019-11-23 23:31:30,470 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label48.c [2019-11-23 23:31:30,480 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:30,488 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:30,500 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:30,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:30,539 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:30,540 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:30,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:30,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:30,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:30,540 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:30,540 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:30,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:30,580 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:31:30,580 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1323231385, now seen corresponding path program 1 times [2019-11-23 23:31:30,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:30,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365469589] [2019-11-23 23:31:30,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:31,029 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:31:31,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365469589] [2019-11-23 23:31:31,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:31,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:31,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845842784] [2019-11-23 23:31:31,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:31,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:31,057 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:31:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:31,871 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:31:31,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:31,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:31:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:31,890 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:31:31,890 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:31:31,894 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:31:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:31:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:31:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:31:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 396 transitions. [2019-11-23 23:31:31,956 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 396 transitions. Word has length 71 [2019-11-23 23:31:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:31,957 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 396 transitions. [2019-11-23 23:31:31,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:31,958 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 396 transitions. [2019-11-23 23:31:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:31:31,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:31,963 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:31,963 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:31,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1566176565, now seen corresponding path program 1 times [2019-11-23 23:31:31,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:31,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427979012] [2019-11-23 23:31:31,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:32,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427979012] [2019-11-23 23:31:32,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:32,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:32,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422528399] [2019-11-23 23:31:32,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:32,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:32,051 INFO L87 Difference]: Start difference. First operand 216 states and 396 transitions. Second operand 3 states. [2019-11-23 23:31:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:32,446 INFO L93 Difference]: Finished difference Result 644 states and 1185 transitions. [2019-11-23 23:31:32,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:32,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:31:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:32,450 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:31:32,450 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:31:32,453 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:31:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:31:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-11-23 23:31:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-23 23:31:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-11-23 23:31:32,480 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 84 [2019-11-23 23:31:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:32,480 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-11-23 23:31:32,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-11-23 23:31:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:32,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:32,486 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2019-11-23 23:31:32,486 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash -81009251, now seen corresponding path program 1 times [2019-11-23 23:31:32,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:32,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903378204] [2019-11-23 23:31:32,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:32,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903378204] [2019-11-23 23:31:32,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:32,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:32,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873094630] [2019-11-23 23:31:32,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:32,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:32,588 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 4 states. [2019-11-23 23:31:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:33,211 INFO L93 Difference]: Finished difference Result 1212 states and 2013 transitions. [2019-11-23 23:31:33,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:33,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-23 23:31:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:33,218 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:31:33,218 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:31:33,219 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:31:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:31:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-11-23 23:31:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1218 transitions. [2019-11-23 23:31:33,257 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1218 transitions. Word has length 93 [2019-11-23 23:31:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:33,257 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1218 transitions. [2019-11-23 23:31:33,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1218 transitions. [2019-11-23 23:31:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:31:33,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:33,265 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:33,265 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:33,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:33,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2009843212, now seen corresponding path program 1 times [2019-11-23 23:31:33,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:33,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758105775] [2019-11-23 23:31:33,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:33,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758105775] [2019-11-23 23:31:33,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:33,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:33,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836967209] [2019-11-23 23:31:33,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:33,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:33,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:33,354 INFO L87 Difference]: Start difference. First operand 784 states and 1218 transitions. Second operand 4 states. [2019-11-23 23:31:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:33,924 INFO L93 Difference]: Finished difference Result 1655 states and 2541 transitions. [2019-11-23 23:31:33,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:33,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 23:31:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:33,929 INFO L225 Difference]: With dead ends: 1655 [2019-11-23 23:31:33,930 INFO L226 Difference]: Without dead ends: 872 [2019-11-23 23:31:33,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-11-23 23:31:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 855. [2019-11-23 23:31:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1295 transitions. [2019-11-23 23:31:33,992 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1295 transitions. Word has length 99 [2019-11-23 23:31:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:33,992 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1295 transitions. [2019-11-23 23:31:33,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1295 transitions. [2019-11-23 23:31:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 23:31:33,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:33,997 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:33,997 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:33,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1788102724, now seen corresponding path program 1 times [2019-11-23 23:31:33,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:33,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324362654] [2019-11-23 23:31:33,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:34,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324362654] [2019-11-23 23:31:34,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:34,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:34,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385176415] [2019-11-23 23:31:34,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:34,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:34,069 INFO L87 Difference]: Start difference. First operand 855 states and 1295 transitions. Second operand 4 states. [2019-11-23 23:31:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:34,680 INFO L93 Difference]: Finished difference Result 1780 states and 2732 transitions. [2019-11-23 23:31:34,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:34,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 23:31:34,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:34,686 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:31:34,686 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:31:34,688 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:31:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:31:34,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-23 23:31:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1473 transitions. [2019-11-23 23:31:34,713 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1473 transitions. Word has length 103 [2019-11-23 23:31:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:34,713 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1473 transitions. [2019-11-23 23:31:34,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1473 transitions. [2019-11-23 23:31:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 23:31:34,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:34,716 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:34,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1752327103, now seen corresponding path program 1 times [2019-11-23 23:31:34,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:34,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569341164] [2019-11-23 23:31:34,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:34,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569341164] [2019-11-23 23:31:34,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:34,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:34,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939819470] [2019-11-23 23:31:34,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:34,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:34,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:34,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:34,777 INFO L87 Difference]: Start difference. First operand 997 states and 1473 transitions. Second operand 3 states. [2019-11-23 23:31:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:35,284 INFO L93 Difference]: Finished difference Result 2348 states and 3536 transitions. [2019-11-23 23:31:35,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:35,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 23:31:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:35,293 INFO L225 Difference]: With dead ends: 2348 [2019-11-23 23:31:35,294 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:31:35,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:31:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1068. [2019-11-23 23:31:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:31:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1345 transitions. [2019-11-23 23:31:35,333 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1345 transitions. Word has length 106 [2019-11-23 23:31:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:35,333 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1345 transitions. [2019-11-23 23:31:35,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1345 transitions. [2019-11-23 23:31:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 23:31:35,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:35,338 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,338 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1472781405, now seen corresponding path program 1 times [2019-11-23 23:31:35,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:35,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462460694] [2019-11-23 23:31:35,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:35,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462460694] [2019-11-23 23:31:35,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:35,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:35,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862195635] [2019-11-23 23:31:35,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:31:35,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:35,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:31:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:35,501 INFO L87 Difference]: Start difference. First operand 1068 states and 1345 transitions. Second operand 5 states. [2019-11-23 23:31:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:36,244 INFO L93 Difference]: Finished difference Result 2845 states and 3664 transitions. [2019-11-23 23:31:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:36,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 23:31:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:36,254 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:31:36,254 INFO L226 Difference]: Without dead ends: 1849 [2019-11-23 23:31:36,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2019-11-23 23:31:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1494. [2019-11-23 23:31:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-11-23 23:31:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1818 transitions. [2019-11-23 23:31:36,296 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1818 transitions. Word has length 121 [2019-11-23 23:31:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:36,298 INFO L462 AbstractCegarLoop]: Abstraction has 1494 states and 1818 transitions. [2019-11-23 23:31:36,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:31:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1818 transitions. [2019-11-23 23:31:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 23:31:36,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:36,306 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:36,307 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1906081643, now seen corresponding path program 1 times [2019-11-23 23:31:36,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:36,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623861495] [2019-11-23 23:31:36,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 23:31:36,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623861495] [2019-11-23 23:31:36,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269560149] [2019-11-23 23:31:36,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:36,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:31:36,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:31:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 23:31:36,777 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:31:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 23:31:36,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:31:36,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:31:36,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572810155] [2019-11-23 23:31:36,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:36,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:36,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:36,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:36,822 INFO L87 Difference]: Start difference. First operand 1494 states and 1818 transitions. Second operand 3 states. [2019-11-23 23:31:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:37,234 INFO L93 Difference]: Finished difference Result 2987 states and 3655 transitions. [2019-11-23 23:31:37,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:37,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 23:31:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:37,250 INFO L225 Difference]: With dead ends: 2987 [2019-11-23 23:31:37,250 INFO L226 Difference]: Without dead ends: 1494 [2019-11-23 23:31:37,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 372 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-23 23:31:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1352. [2019-11-23 23:31:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-23 23:31:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1563 transitions. [2019-11-23 23:31:37,316 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1563 transitions. Word has length 187 [2019-11-23 23:31:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:37,317 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1563 transitions. [2019-11-23 23:31:37,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1563 transitions. [2019-11-23 23:31:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-23 23:31:37,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:37,322 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:37,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:37,530 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash -495695403, now seen corresponding path program 1 times [2019-11-23 23:31:37,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:37,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286940183] [2019-11-23 23:31:37,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-23 23:31:37,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286940183] [2019-11-23 23:31:37,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:37,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:37,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031072369] [2019-11-23 23:31:37,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:37,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:37,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:37,740 INFO L87 Difference]: Start difference. First operand 1352 states and 1563 transitions. Second operand 4 states. [2019-11-23 23:31:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:38,119 INFO L93 Difference]: Finished difference Result 2845 states and 3320 transitions. [2019-11-23 23:31:38,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:38,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-23 23:31:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:38,127 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:31:38,127 INFO L226 Difference]: Without dead ends: 1494 [2019-11-23 23:31:38,130 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:31:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-23 23:31:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1281. [2019-11-23 23:31:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-11-23 23:31:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1480 transitions. [2019-11-23 23:31:38,163 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1480 transitions. Word has length 190 [2019-11-23 23:31:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:38,163 INFO L462 AbstractCegarLoop]: Abstraction has 1281 states and 1480 transitions. [2019-11-23 23:31:38,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1480 transitions. [2019-11-23 23:31:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 23:31:38,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:38,168 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:38,168 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1290832554, now seen corresponding path program 1 times [2019-11-23 23:31:38,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:38,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609050812] [2019-11-23 23:31:38,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 233 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:31:38,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609050812] [2019-11-23 23:31:38,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869646537] [2019-11-23 23:31:38,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:38,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:31:38,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:31:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-23 23:31:38,577 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:31:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-23 23:31:38,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:31:38,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:31:38,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648376206] [2019-11-23 23:31:38,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:38,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:38,610 INFO L87 Difference]: Start difference. First operand 1281 states and 1480 transitions. Second operand 3 states. [2019-11-23 23:31:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:38,947 INFO L93 Difference]: Finished difference Result 2701 states and 3121 transitions. [2019-11-23 23:31:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:38,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-23 23:31:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:38,948 INFO L225 Difference]: With dead ends: 2701 [2019-11-23 23:31:38,949 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:38,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:38,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2019-11-23 23:31:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:38,953 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:38,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:38,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:39,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:39,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:39,278 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-11-23 23:31:39,964 WARN L192 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-23 23:31:40,565 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-23 23:31:40,571 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:40,571 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:40,571 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:40,571 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:40,571 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:40,571 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:40,572 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:40,572 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:40,572 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:40,572 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:40,572 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:40,572 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:40,572 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:40,573 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:40,573 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:40,573 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:40,573 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:40,573 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:40,573 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 23:31:40,573 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:40,574 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse7 (= 15 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse3 (<= ~a16~0 4)) (.cse4 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not (= 14 ~a8~0))) (.cse6 (= ~a16~0 5)) (.cse11 (<= 14 ~a8~0)) (.cse8 (not (= ~a16~0 6))) (.cse10 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse7 .cse6) (and .cse4 .cse3) (and .cse4 .cse8 .cse0 .cse9 .cse1) (and .cse10 .cse2 .cse3) (and .cse11 .cse0 .cse9 .cse1 .cse5) (and .cse11 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2) (and .cse2 .cse7 (not .cse0)) (and .cse7 .cse5) (and .cse4 .cse10 .cse9 .cse2) (and .cse5 .cse3) (and .cse4 .cse0 .cse9 .cse2 .cse6) (and .cse11 .cse8 .cse10 .cse2))) [2019-11-23 23:31:40,574 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:40,574 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:40,574 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:40,574 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:40,574 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:40,574 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:40,574 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:40,575 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:40,575 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:40,575 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:40,575 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:40,575 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:40,575 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:40,575 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:40,575 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:40,575 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:40,576 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:40,576 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:40,576 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:40,576 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:40,576 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:40,576 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:40,576 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:40,577 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse7 (= 15 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse3 (<= ~a16~0 4)) (.cse4 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not (= 14 ~a8~0))) (.cse6 (= ~a16~0 5)) (.cse11 (<= 14 ~a8~0)) (.cse8 (not (= ~a16~0 6))) (.cse10 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse7 .cse6) (and .cse4 .cse3) (and .cse4 .cse8 .cse0 .cse9 .cse1) (and .cse10 .cse2 .cse3) (and .cse11 .cse0 .cse9 .cse1 .cse5) (and .cse11 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2) (and .cse2 .cse7 (not .cse0)) (and .cse7 .cse5) (and .cse4 .cse10 .cse9 .cse2) (and .cse5 .cse3) (and .cse4 .cse0 .cse9 .cse2 .cse6) (and .cse11 .cse8 .cse10 .cse2))) [2019-11-23 23:31:40,577 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:40,577 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:40,577 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:40,577 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:40,577 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:40,577 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:40,577 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:40,578 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 539) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:40,579 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:40,580 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:40,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:40 BoogieIcfgContainer [2019-11-23 23:31:40,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:40,612 INFO L168 Benchmark]: Toolchain (without parser) took 13095.51 ms. Allocated memory was 137.9 MB in the beginning and 454.0 MB in the end (delta: 316.1 MB). Free memory was 100.4 MB in the beginning and 268.9 MB in the end (delta: -168.5 MB). Peak memory consumption was 269.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:40,613 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 137.9 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:31:40,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.54 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 160.1 MB in the end (delta: -60.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:40,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.97 ms. Allocated memory is still 201.9 MB. Free memory was 160.1 MB in the beginning and 154.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:40,615 INFO L168 Benchmark]: Boogie Preprocessor took 69.68 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 149.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:40,622 INFO L168 Benchmark]: RCFGBuilder took 2004.99 ms. Allocated memory was 201.9 MB in the beginning and 251.1 MB in the end (delta: 49.3 MB). Free memory was 149.8 MB in the beginning and 200.7 MB in the end (delta: -50.9 MB). Peak memory consumption was 107.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:40,623 INFO L168 Benchmark]: TraceAbstraction took 10147.33 ms. Allocated memory was 251.1 MB in the beginning and 454.0 MB in the end (delta: 202.9 MB). Free memory was 200.7 MB in the beginning and 268.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 256.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:40,630 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 137.9 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.54 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 160.1 MB in the end (delta: -60.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.97 ms. Allocated memory is still 201.9 MB. Free memory was 160.1 MB in the beginning and 154.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.68 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 149.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2004.99 ms. Allocated memory was 201.9 MB in the beginning and 251.1 MB in the end (delta: 49.3 MB). Free memory was 149.8 MB in the beginning and 200.7 MB in the end (delta: -50.9 MB). Peak memory consumption was 107.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10147.33 ms. Allocated memory was 251.1 MB in the beginning and 454.0 MB in the end (delta: 202.9 MB). Free memory was 200.7 MB in the beginning and 268.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 256.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: 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: ((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4) || ((1 == a7 && a20 <= 0) && a16 == 5)) || ((1 == a7 && 15 == a8) && a16 == 5)) || (1 == a7 && a16 <= 4)) || ((((1 == a7 && !(a16 == 6)) && a17 == 1) && !(14 == a8)) && a21 == 1)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || ((((14 <= a8 && a17 == 1) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((14 <= a8 && a20 <= 0) && a16 == 5)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || (15 == a8 && a20 <= 0)) || (((1 == a7 && a17 <= 0) && !(14 == a8)) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4) || ((1 == a7 && a20 <= 0) && a16 == 5)) || ((1 == a7 && 15 == a8) && a16 == 5)) || (1 == a7 && a16 <= 4)) || ((((1 == a7 && !(a16 == 6)) && a17 == 1) && !(14 == a8)) && a21 == 1)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || ((((14 <= a8 && a17 == 1) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((14 <= a8 && a20 <= 0) && a16 == 5)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || (15 == a8 && a20 <= 0)) || (((1 == a7 && a17 <= 0) && !(14 == a8)) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 598 SDtfs, 1081 SDslu, 68 SDs, 0 SdLazy, 2845 SolverSat, 790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 806 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1494occurred 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, 10 MinimizatonAttempts, 1082 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 361 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2485 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1300 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1667 NumberOfCodeBlocks, 1667 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2053 ConstructedInterpolants, 0 QuantifiedInterpolants, 678218 SizeOfPredicates, 2 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2218/2272 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...