java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 21:16:22,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 21:16:22,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 21:16:22,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 21:16:22,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 21:16:22,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 21:16:22,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 21:16:22,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 21:16:22,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 21:16:22,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 21:16:22,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 21:16:22,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 21:16:22,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 21:16:22,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 21:16:22,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 21:16:22,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 21:16:22,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 21:16:22,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 21:16:22,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 21:16:22,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 21:16:22,244 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 21:16:22,246 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 21:16:22,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 21:16:22,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 21:16:22,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 21:16:22,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 21:16:22,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 21:16:22,253 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 21:16:22,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 21:16:22,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 21:16:22,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 21:16:22,255 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 21:16:22,255 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 21:16:22,256 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 21:16:22,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 21:16:22,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 21:16:22,257 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 21:16:22,275 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 21:16:22,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 21:16:22,277 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 21:16:22,277 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 21:16:22,277 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 21:16:22,277 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 21:16:22,278 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 21:16:22,278 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 21:16:22,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 21:16:22,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 21:16:22,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 21:16:22,279 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 21:16:22,279 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 21:16:22,280 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 21:16:22,280 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 21:16:22,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 21:16:22,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 21:16:22,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 21:16:22,362 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 21:16:22,362 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 21:16:22,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl [2018-10-12 21:16:22,363 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl' [2018-10-12 21:16:22,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 21:16:22,440 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 21:16:22,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 21:16:22,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 21:16:22,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 21:16:22,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (1/1) ... [2018-10-12 21:16:22,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (1/1) ... [2018-10-12 21:16:22,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (1/1) ... [2018-10-12 21:16:22,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (1/1) ... [2018-10-12 21:16:22,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (1/1) ... [2018-10-12 21:16:22,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (1/1) ... [2018-10-12 21:16:22,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (1/1) ... [2018-10-12 21:16:22,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 21:16:22,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 21:16:22,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 21:16:22,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 21:16:22,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 21:16:22,591 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 21:16:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 21:16:22,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 21:16:23,231 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 21:16:23,232 INFO L202 PluginConnector]: Adding new model test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:16:23 BoogieIcfgContainer [2018-10-12 21:16:23,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 21:16:23,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 21:16:23,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 21:16:23,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 21:16:23,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:22" (1/2) ... [2018-10-12 21:16:23,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ae5441 and model type test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:16:23, skipping insertion in model container [2018-10-12 21:16:23,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:16:23" (2/2) ... [2018-10-12 21:16:23,240 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl [2018-10-12 21:16:23,250 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 21:16:23,259 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 21:16:23,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 21:16:23,301 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 21:16:23,302 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 21:16:23,302 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 21:16:23,302 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 21:16:23,303 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 21:16:23,303 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 21:16:23,303 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 21:16:23,303 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 21:16:23,303 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 21:16:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2018-10-12 21:16:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-12 21:16:23,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:23,336 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:23,337 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:23,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2118012074, now seen corresponding path program 1 times [2018-10-12 21:16:23,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:23,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 21:16:23,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-12 21:16:23,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-12 21:16:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-12 21:16:23,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-12 21:16:23,816 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 4 states. [2018-10-12 21:16:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:23,987 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-12 21:16:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-12 21:16:23,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-12 21:16:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:24,004 INFO L225 Difference]: With dead ends: 96 [2018-10-12 21:16:24,004 INFO L226 Difference]: Without dead ends: 96 [2018-10-12 21:16:24,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-12 21:16:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-12 21:16:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-12 21:16:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-12 21:16:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-12 21:16:24,054 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-12 21:16:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:24,055 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-12 21:16:24,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-12 21:16:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-12 21:16:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-12 21:16:24,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:24,059 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:24,059 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:24,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2113447183, now seen corresponding path program 1 times [2018-10-12 21:16:24,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:24,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:24,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-12 21:16:24,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-12 21:16:24,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-12 21:16:24,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-12 21:16:24,347 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 5 states. [2018-10-12 21:16:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:24,506 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-12 21:16:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-12 21:16:24,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-10-12 21:16:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:24,512 INFO L225 Difference]: With dead ends: 99 [2018-10-12 21:16:24,512 INFO L226 Difference]: Without dead ends: 99 [2018-10-12 21:16:24,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-12 21:16:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-12 21:16:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-12 21:16:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-12 21:16:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-12 21:16:24,536 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-12 21:16:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:24,538 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-12 21:16:24,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-12 21:16:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-12 21:16:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-12 21:16:24,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:24,546 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:24,546 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:24,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash -68932426, now seen corresponding path program 2 times [2018-10-12 21:16:24,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:24,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-12 21:16:24,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 21:16:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 21:16:24,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-12 21:16:24,799 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 6 states. [2018-10-12 21:16:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:24,920 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-12 21:16:24,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-12 21:16:24,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-10-12 21:16:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:24,923 INFO L225 Difference]: With dead ends: 102 [2018-10-12 21:16:24,923 INFO L226 Difference]: Without dead ends: 102 [2018-10-12 21:16:24,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:16:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-12 21:16:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-12 21:16:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-12 21:16:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-12 21:16:24,935 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-12 21:16:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:24,936 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-12 21:16:24,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 21:16:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-12 21:16:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-12 21:16:24,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:24,938 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:24,938 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:24,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:24,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1875062703, now seen corresponding path program 3 times [2018-10-12 21:16:24,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:25,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:25,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-12 21:16:25,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 21:16:25,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 21:16:25,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-12 21:16:25,114 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 7 states. [2018-10-12 21:16:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:25,416 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-12 21:16:25,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-12 21:16:25,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-10-12 21:16:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:25,420 INFO L225 Difference]: With dead ends: 105 [2018-10-12 21:16:25,420 INFO L226 Difference]: Without dead ends: 105 [2018-10-12 21:16:25,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-12 21:16:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-12 21:16:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-12 21:16:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-12 21:16:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-12 21:16:25,439 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-12 21:16:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:25,443 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-12 21:16:25,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 21:16:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-12 21:16:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-12 21:16:25,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:25,445 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:25,446 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:25,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2094931478, now seen corresponding path program 4 times [2018-10-12 21:16:25,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:25,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:25,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 21:16:25,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 21:16:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 21:16:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:16:25,793 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 8 states. [2018-10-12 21:16:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:26,289 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-12 21:16:26,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 21:16:26,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-10-12 21:16:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:26,293 INFO L225 Difference]: With dead ends: 108 [2018-10-12 21:16:26,294 INFO L226 Difference]: Without dead ends: 108 [2018-10-12 21:16:26,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:16:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-12 21:16:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-12 21:16:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-12 21:16:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-12 21:16:26,301 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-12 21:16:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:26,302 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-12 21:16:26,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 21:16:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-12 21:16:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-12 21:16:26,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:26,304 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:26,305 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:26,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1914486193, now seen corresponding path program 5 times [2018-10-12 21:16:26,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:26,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:26,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 21:16:26,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 21:16:26,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 21:16:26,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-12 21:16:26,539 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 9 states. [2018-10-12 21:16:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:26,770 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-12 21:16:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 21:16:26,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-10-12 21:16:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:26,777 INFO L225 Difference]: With dead ends: 111 [2018-10-12 21:16:26,778 INFO L226 Difference]: Without dead ends: 111 [2018-10-12 21:16:26,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-12 21:16:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-12 21:16:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-12 21:16:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-12 21:16:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-12 21:16:26,792 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-12 21:16:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:26,793 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-12 21:16:26,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 21:16:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-12 21:16:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-12 21:16:26,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:26,800 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:26,801 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:26,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:26,801 INFO L82 PathProgramCache]: Analyzing trace with hash 859146102, now seen corresponding path program 6 times [2018-10-12 21:16:26,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:27,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:27,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 21:16:27,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 21:16:27,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 21:16:27,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-12 21:16:27,064 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 10 states. [2018-10-12 21:16:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:27,283 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-12 21:16:27,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-12 21:16:27,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-10-12 21:16:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:27,285 INFO L225 Difference]: With dead ends: 114 [2018-10-12 21:16:27,285 INFO L226 Difference]: Without dead ends: 114 [2018-10-12 21:16:27,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-12 21:16:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-12 21:16:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-12 21:16:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-12 21:16:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-12 21:16:27,293 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-12 21:16:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:27,293 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-12 21:16:27,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 21:16:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-12 21:16:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-12 21:16:27,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:27,296 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:27,296 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:27,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash -736961297, now seen corresponding path program 7 times [2018-10-12 21:16:27,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:27,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:27,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 21:16:27,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 21:16:27,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 21:16:27,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-12 21:16:27,595 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 11 states. [2018-10-12 21:16:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:27,840 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-12 21:16:27,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 21:16:27,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2018-10-12 21:16:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:27,842 INFO L225 Difference]: With dead ends: 117 [2018-10-12 21:16:27,843 INFO L226 Difference]: Without dead ends: 117 [2018-10-12 21:16:27,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-12 21:16:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-12 21:16:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-12 21:16:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-12 21:16:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-12 21:16:27,849 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-12 21:16:27,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:27,849 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-12 21:16:27,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 21:16:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-12 21:16:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-12 21:16:27,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:27,852 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:27,852 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:27,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:27,852 INFO L82 PathProgramCache]: Analyzing trace with hash -789550890, now seen corresponding path program 8 times [2018-10-12 21:16:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:28,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:28,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 21:16:28,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 21:16:28,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 21:16:28,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:16:28,123 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 12 states. [2018-10-12 21:16:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:28,455 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-12 21:16:28,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 21:16:28,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2018-10-12 21:16:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:28,462 INFO L225 Difference]: With dead ends: 120 [2018-10-12 21:16:28,463 INFO L226 Difference]: Without dead ends: 120 [2018-10-12 21:16:28,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-12 21:16:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-12 21:16:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-12 21:16:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-12 21:16:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-12 21:16:28,472 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-12 21:16:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:28,477 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-12 21:16:28,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 21:16:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-12 21:16:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-12 21:16:28,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:28,479 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:28,479 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:28,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 176947087, now seen corresponding path program 9 times [2018-10-12 21:16:28,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:28,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:28,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-12 21:16:28,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-12 21:16:28,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-12 21:16:28,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-12 21:16:28,979 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 13 states. [2018-10-12 21:16:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:29,417 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-12 21:16:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 21:16:29,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2018-10-12 21:16:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:29,418 INFO L225 Difference]: With dead ends: 121 [2018-10-12 21:16:29,419 INFO L226 Difference]: Without dead ends: 121 [2018-10-12 21:16:29,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-12 21:16:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-12 21:16:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-10-12 21:16:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-12 21:16:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-12 21:16:29,423 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-12 21:16:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:29,424 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-12 21:16:29,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-12 21:16:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-12 21:16:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-12 21:16:29,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:29,425 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:29,426 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:29,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash -342572490, now seen corresponding path program 10 times [2018-10-12 21:16:29,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:30,652 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2018-10-12 21:16:30,925 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 18 [2018-10-12 21:16:31,241 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2018-10-12 21:16:31,849 WARN L178 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2018-10-12 21:16:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:33,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:33,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 21:16:33,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 21:16:33,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 21:16:33,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 21:16:33,558 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 39 states. [2018-10-12 21:16:36,709 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2018-10-12 21:16:37,084 WARN L178 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 59 [2018-10-12 21:16:37,303 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 48 [2018-10-12 21:16:37,529 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 55 [2018-10-12 21:16:37,765 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 57 [2018-10-12 21:16:38,077 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 59 [2018-10-12 21:16:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:38,079 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-12 21:16:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 21:16:38,079 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-10-12 21:16:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:38,079 INFO L225 Difference]: With dead ends: 110 [2018-10-12 21:16:38,080 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 21:16:38,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=614, Invalid=3676, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 21:16:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 21:16:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 21:16:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 21:16:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 21:16:38,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2018-10-12 21:16:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:38,083 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 21:16:38,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 21:16:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 21:16:38,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 21:16:38,089 INFO L202 PluginConnector]: Adding new model test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 09:16:38 BoogieIcfgContainer [2018-10-12 21:16:38,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 21:16:38,090 INFO L168 Benchmark]: Toolchain (without parser) took 15651.30 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 117.4 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 238.5 MB). Peak memory consumption was 355.9 MB. Max. memory is 7.1 GB. [2018-10-12 21:16:38,091 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 21:16:38,092 INFO L168 Benchmark]: Boogie Preprocessor took 76.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 21:16:38,092 INFO L168 Benchmark]: RCFGBuilder took 714.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2018-10-12 21:16:38,093 INFO L168 Benchmark]: TraceAbstraction took 14855.92 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 117.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 208.9 MB). Peak memory consumption was 326.3 MB. Max. memory is 7.1 GB. [2018-10-12 21:16:38,097 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 714.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14855.92 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 117.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 208.9 MB). Peak memory consumption was 326.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 95 locations, 1 error locations. SAFE Result, 14.7s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 888 SDtfs, 1063 SDslu, 4905 SDs, 0 SdLazy, 1789 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 24 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1155 NumberOfCodeBlocks, 1155 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 446350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/550 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-12_21-16-38-108.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-12_21-16-38-108.csv Received shutdown request...