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-093a8c0 [2018-10-14 16:56:24,302 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:56:24,304 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:56:24,317 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:56:24,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:56:24,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:56:24,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:56:24,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:56:24,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:56:24,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:56:24,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:56:24,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:56:24,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:56:24,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:56:24,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:56:24,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:56:24,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:56:24,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:56:24,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:56:24,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:56:24,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:56:24,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:56:24,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:56:24,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:56:24,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:56:24,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:56:24,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:56:24,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:56:24,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:56:24,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:56:24,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:56:24,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:56:24,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:56:24,348 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:56:24,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:56:24,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:56:24,350 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-14 16:56:24,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:56:24,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:56:24,362 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:56:24,362 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:56:24,363 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:56:24,363 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:56:24,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:56:24,364 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:56:24,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:56:24,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:56:24,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:56:24,365 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:56:24,365 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:56:24,366 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:56:24,366 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:56:24,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:56:24,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:56:24,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:56:24,448 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:56:24,449 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:56:24,449 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-14 16:56:24,450 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-14 16:56:24,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:56:24,548 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:56:24,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:56:24,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:56:24,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:56:24,577 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 14.10 04:56:24" (1/1) ... [2018-10-14 16:56:24,579 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 14.10 04:56:24" (1/1) ... [2018-10-14 16:56:24,603 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 14.10 04:56:24" (1/1) ... [2018-10-14 16:56:24,603 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 14.10 04:56:24" (1/1) ... [2018-10-14 16:56:24,618 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 14.10 04:56:24" (1/1) ... [2018-10-14 16:56:24,620 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 14.10 04:56:24" (1/1) ... [2018-10-14 16:56:24,622 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 14.10 04:56:24" (1/1) ... [2018-10-14 16:56:24,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:56:24,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:56:24,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:56:24,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:56:24,635 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 14.10 04:56:24" (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-14 16:56:24,715 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:56:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:56:24,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:56:25,346 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:56:25,347 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 14.10 04:56:25 BoogieIcfgContainer [2018-10-14 16:56:25,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:56:25,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:56:25,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:56:25,354 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:56:25,354 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 14.10 04:56:24" (1/2) ... [2018-10-14 16:56:25,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@825cc09 and model type test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:56:25, skipping insertion in model container [2018-10-14 16:56:25,356 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 14.10 04:56:25" (2/2) ... [2018-10-14 16:56:25,358 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i_11.bpl [2018-10-14 16:56:25,370 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:56:25,382 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:56:25,396 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:56:25,422 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:56:25,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:56:25,423 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:56:25,424 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:56:25,424 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:56:25,424 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:56:25,424 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:56:25,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:56:25,424 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:56:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2018-10-14 16:56:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-14 16:56:25,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:25,458 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-14 16:56:25,459 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:25,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2118012074, now seen corresponding path program 1 times [2018-10-14 16:56:25,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:25,905 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-14 16:56:25,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:56:25,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 16:56:25,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 16:56:25,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 16:56:25,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 16:56:25,934 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 4 states. [2018-10-14 16:56:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:26,050 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-14 16:56:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 16:56:26,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-14 16:56:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:26,066 INFO L225 Difference]: With dead ends: 96 [2018-10-14 16:56:26,066 INFO L226 Difference]: Without dead ends: 96 [2018-10-14 16:56:26,069 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-14 16:56:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-14 16:56:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-14 16:56:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-14 16:56:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-14 16:56:26,114 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-14 16:56:26,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:26,115 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-14 16:56:26,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 16:56:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-14 16:56:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-14 16:56:26,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:26,119 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-14 16:56:26,119 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:26,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2113447183, now seen corresponding path program 1 times [2018-10-14 16:56:26,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:26,311 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-14 16:56:26,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:26,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:56:26,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:56:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:56:26,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:56:26,315 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 5 states. [2018-10-14 16:56:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:26,587 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-14 16:56:26,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 16:56:26,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-10-14 16:56:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:26,591 INFO L225 Difference]: With dead ends: 99 [2018-10-14 16:56:26,591 INFO L226 Difference]: Without dead ends: 99 [2018-10-14 16:56:26,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:56:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-14 16:56:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-14 16:56:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-14 16:56:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-14 16:56:26,604 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-14 16:56:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:26,605 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-14 16:56:26,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:56:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-14 16:56:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-14 16:56:26,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:26,610 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-14 16:56:26,611 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:26,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -68932426, now seen corresponding path program 2 times [2018-10-14 16:56:26,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:26,866 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-14 16:56:26,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:26,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 16:56:26,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 16:56:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 16:56:26,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:56:26,869 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 6 states. [2018-10-14 16:56:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:26,982 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-14 16:56:26,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:56:26,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-10-14 16:56:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:26,985 INFO L225 Difference]: With dead ends: 102 [2018-10-14 16:56:26,985 INFO L226 Difference]: Without dead ends: 102 [2018-10-14 16:56:26,986 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-14 16:56:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-14 16:56:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-14 16:56:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-14 16:56:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-14 16:56:26,995 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-14 16:56:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:26,996 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-14 16:56:26,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 16:56:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-14 16:56:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-14 16:56:26,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:26,998 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-14 16:56:26,999 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:26,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1875062703, now seen corresponding path program 3 times [2018-10-14 16:56:27,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:27,160 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-14 16:56:27,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:27,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:56:27,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:56:27,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:56:27,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:56:27,162 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 7 states. [2018-10-14 16:56:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:27,668 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-14 16:56:27,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 16:56:27,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-10-14 16:56:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:27,671 INFO L225 Difference]: With dead ends: 105 [2018-10-14 16:56:27,671 INFO L226 Difference]: Without dead ends: 105 [2018-10-14 16:56:27,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:56:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-14 16:56:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-14 16:56:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-14 16:56:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-14 16:56:27,685 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-14 16:56:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:27,686 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-14 16:56:27,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:56:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-14 16:56:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-14 16:56:27,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:27,688 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-14 16:56:27,688 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:27,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2094931478, now seen corresponding path program 4 times [2018-10-14 16:56:27,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:27,871 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-14 16:56:27,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:27,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:56:27,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:56:27,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:56:27,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:56:27,874 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 8 states. [2018-10-14 16:56:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:28,641 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-14 16:56:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:56:28,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-10-14 16:56:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:28,644 INFO L225 Difference]: With dead ends: 108 [2018-10-14 16:56:28,644 INFO L226 Difference]: Without dead ends: 108 [2018-10-14 16:56:28,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-14 16:56:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-14 16:56:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-14 16:56:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-14 16:56:28,651 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-14 16:56:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:28,652 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-14 16:56:28,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:56:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-14 16:56:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-14 16:56:28,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:28,654 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-14 16:56:28,655 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:28,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1914486193, now seen corresponding path program 5 times [2018-10-14 16:56:28,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:28,827 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-14 16:56:28,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:28,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:56:28,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:56:28,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:56:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:56:28,829 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 9 states. [2018-10-14 16:56:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:29,053 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-14 16:56:29,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:56:29,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-10-14 16:56:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:29,055 INFO L225 Difference]: With dead ends: 111 [2018-10-14 16:56:29,056 INFO L226 Difference]: Without dead ends: 111 [2018-10-14 16:56:29,056 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-14 16:56:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-14 16:56:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-14 16:56:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-14 16:56:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-14 16:56:29,066 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-14 16:56:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:29,066 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-14 16:56:29,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:56:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-14 16:56:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-14 16:56:29,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:29,068 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-14 16:56:29,069 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:29,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash 859146102, now seen corresponding path program 6 times [2018-10-14 16:56:29,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:29,378 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-14 16:56:29,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:29,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:56:29,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:56:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:56:29,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:56:29,380 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 10 states. [2018-10-14 16:56:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:29,610 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-14 16:56:29,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 16:56:29,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-10-14 16:56:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:29,612 INFO L225 Difference]: With dead ends: 114 [2018-10-14 16:56:29,612 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 16:56:29,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:56:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 16:56:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-14 16:56:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-14 16:56:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-14 16:56:29,618 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-14 16:56:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:29,619 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-14 16:56:29,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:56:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-14 16:56:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-14 16:56:29,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:29,621 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-14 16:56:29,621 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:29,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash -736961297, now seen corresponding path program 7 times [2018-10-14 16:56:29,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:29,888 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-14 16:56:29,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:29,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:56:29,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:56:29,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:56:29,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:56:29,890 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 11 states. [2018-10-14 16:56:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:30,148 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-14 16:56:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:56:30,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2018-10-14 16:56:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:30,150 INFO L225 Difference]: With dead ends: 117 [2018-10-14 16:56:30,151 INFO L226 Difference]: Without dead ends: 117 [2018-10-14 16:56:30,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:56:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-14 16:56:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-14 16:56:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 16:56:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-14 16:56:30,157 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-14 16:56:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:30,157 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-14 16:56:30,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:56:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-14 16:56:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-14 16:56:30,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:30,159 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-14 16:56:30,160 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:30,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash -789550890, now seen corresponding path program 8 times [2018-10-14 16:56:30,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:31,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-14 16:56:31,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:31,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:56:31,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:56:31,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:56:31,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:31,124 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 12 states. [2018-10-14 16:56:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:31,465 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-14 16:56:31,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:56:31,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2018-10-14 16:56:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:31,473 INFO L225 Difference]: With dead ends: 120 [2018-10-14 16:56:31,474 INFO L226 Difference]: Without dead ends: 120 [2018-10-14 16:56:31,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:56:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-14 16:56:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-14 16:56:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-14 16:56:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-14 16:56:31,479 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-14 16:56:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:31,479 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-14 16:56:31,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:56:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-14 16:56:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-14 16:56:31,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:31,481 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-14 16:56:31,481 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:31,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash 176947087, now seen corresponding path program 9 times [2018-10-14 16:56:31,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:31,878 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-14 16:56:31,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:31,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 16:56:31,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 16:56:31,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 16:56:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:56:31,880 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 13 states. [2018-10-14 16:56:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:32,245 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-14 16:56:32,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:56:32,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2018-10-14 16:56:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:32,248 INFO L225 Difference]: With dead ends: 121 [2018-10-14 16:56:32,248 INFO L226 Difference]: Without dead ends: 121 [2018-10-14 16:56:32,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:56:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-14 16:56:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-10-14 16:56:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-14 16:56:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-14 16:56:32,253 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-14 16:56:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:32,253 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-14 16:56:32,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 16:56:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-14 16:56:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-14 16:56:32,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:32,255 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-14 16:56:32,255 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:32,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:32,256 INFO L82 PathProgramCache]: Analyzing trace with hash -342572490, now seen corresponding path program 10 times [2018-10-14 16:56:32,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:33,526 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2018-10-14 16:56:33,824 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 18 [2018-10-14 16:56:34,394 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2018-10-14 16:56:36,072 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-14 16:56:36,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:36,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:56:36,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:56:36,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:56:36,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:56:36,074 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 39 states. [2018-10-14 16:56:39,310 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2018-10-14 16:56:39,669 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 59 [2018-10-14 16:56:39,870 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 48 [2018-10-14 16:56:40,070 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 55 [2018-10-14 16:56:40,303 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 57 [2018-10-14 16:56:40,604 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 59 [2018-10-14 16:56:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:40,605 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-14 16:56:40,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 16:56:40,606 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-10-14 16:56:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:40,606 INFO L225 Difference]: With dead ends: 110 [2018-10-14 16:56:40,607 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 16:56:40,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=614, Invalid=3676, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:56:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 16:56:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 16:56:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 16:56:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 16:56:40,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2018-10-14 16:56:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:40,611 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 16:56:40,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:56:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 16:56:40,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 16:56:40,617 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 14.10 04:56:40 BoogieIcfgContainer [2018-10-14 16:56:40,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 16:56:40,618 INFO L168 Benchmark]: Toolchain (without parser) took 16071.25 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 145.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 211.0 MB). Peak memory consumption was 356.2 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:40,619 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:56:40,620 INFO L168 Benchmark]: Boogie Preprocessor took 84.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:56:40,620 INFO L168 Benchmark]: RCFGBuilder took 714.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:40,621 INFO L168 Benchmark]: TraceAbstraction took 15268.61 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 145.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Peak memory consumption was 324.5 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:40,625 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 714.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15268.61 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 145.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Peak memory consumption was 324.5 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, 15.2s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 7.8s 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.5s 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.0s 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-14_16-56-40-636.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-14_16-56-40-636.csv Received shutdown request...