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/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:08:51,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:08:51,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:08:51,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:08:51,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:08:51,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:08:51,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:08:51,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:08:51,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:08:51,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:08:51,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:08:51,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:08:51,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:08:51,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:08:51,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:08:51,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:08:51,357 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:08:51,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:08:51,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:08:51,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:08:51,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:08:51,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:08:51,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:08:51,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:08:51,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:08:51,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:08:51,369 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:08:51,370 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:08:51,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:08:51,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:08:51,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:08:51,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:08:51,373 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:08:51,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:08:51,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:08:51,375 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:08:51,376 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-15 15:08:51,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:08:51,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:08:51,394 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:08:51,394 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:08:51,394 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:08:51,394 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:08:51,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:08:51,395 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:08:51,395 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:08:51,396 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:08:51,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:08:51,396 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:08:51,396 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:08:51,397 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:08:51,397 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:08:51,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:08:51,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:08:51,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:08:51,490 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:08:51,491 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:08:51,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl [2018-10-15 15:08:51,492 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl' [2018-10-15 15:08:51,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:08:51,583 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:08:51,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:08:51,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:08:51,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:08:51,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (1/1) ... [2018-10-15 15:08:51,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (1/1) ... [2018-10-15 15:08:51,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (1/1) ... [2018-10-15 15:08:51,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (1/1) ... [2018-10-15 15:08:51,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (1/1) ... [2018-10-15 15:08:51,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (1/1) ... [2018-10-15 15:08:51,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (1/1) ... [2018-10-15 15:08:51,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:08:51,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:08:51,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:08:51,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:08:51,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (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-15 15:08:51,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:08:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:08:52,666 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:08:52,667 INFO L202 PluginConnector]: Adding new model s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:08:52 BoogieIcfgContainer [2018-10-15 15:08:52,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:08:52,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:08:52,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:08:52,673 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:08:52,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:51" (1/2) ... [2018-10-15 15:08:52,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6feee4d3 and model type s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:08:52, skipping insertion in model container [2018-10-15 15:08:52,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:08:52" (2/2) ... [2018-10-15 15:08:52,676 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.BV.c.cil.c_13.bpl [2018-10-15 15:08:52,685 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:08:52,695 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:08:52,711 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:08:52,735 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:08:52,736 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:08:52,736 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:08:52,736 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:08:52,736 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:08:52,736 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:08:52,736 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:08:52,737 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:08:52,737 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:08:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-10-15 15:08:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-15 15:08:52,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:52,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:08:52,798 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:52,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash 844736169, now seen corresponding path program 1 times [2018-10-15 15:08:52,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:53,203 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-15 15:08:53,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:53,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:53,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:53,238 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2018-10-15 15:08:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:53,443 INFO L93 Difference]: Finished difference Result 282 states and 291 transitions. [2018-10-15 15:08:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:53,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-10-15 15:08:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:53,463 INFO L225 Difference]: With dead ends: 282 [2018-10-15 15:08:53,463 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 15:08:53,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 15:08:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 272. [2018-10-15 15:08:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 15:08:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 281 transitions. [2018-10-15 15:08:53,534 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 281 transitions. Word has length 171 [2018-10-15 15:08:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:53,535 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 281 transitions. [2018-10-15 15:08:53,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 281 transitions. [2018-10-15 15:08:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 15:08:53,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:53,542 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:08:53,542 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:53,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash 620238936, now seen corresponding path program 1 times [2018-10-15 15:08:53,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:08:53,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:53,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:53,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:53,738 INFO L87 Difference]: Start difference. First operand 272 states and 281 transitions. Second operand 3 states. [2018-10-15 15:08:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:53,819 INFO L93 Difference]: Finished difference Result 341 states and 354 transitions. [2018-10-15 15:08:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:53,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-10-15 15:08:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:53,826 INFO L225 Difference]: With dead ends: 341 [2018-10-15 15:08:53,826 INFO L226 Difference]: Without dead ends: 340 [2018-10-15 15:08:53,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-15 15:08:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 335. [2018-10-15 15:08:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-15 15:08:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 348 transitions. [2018-10-15 15:08:53,852 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 348 transitions. Word has length 195 [2018-10-15 15:08:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:53,853 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 348 transitions. [2018-10-15 15:08:53,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 348 transitions. [2018-10-15 15:08:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-15 15:08:53,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:53,859 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:08:53,859 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:53,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash 336183092, now seen corresponding path program 1 times [2018-10-15 15:08:53,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-15 15:08:54,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:54,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:54,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:54,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:54,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:54,025 INFO L87 Difference]: Start difference. First operand 335 states and 348 transitions. Second operand 3 states. [2018-10-15 15:08:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:54,262 INFO L93 Difference]: Finished difference Result 371 states and 384 transitions. [2018-10-15 15:08:54,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:54,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-10-15 15:08:54,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:54,275 INFO L225 Difference]: With dead ends: 371 [2018-10-15 15:08:54,275 INFO L226 Difference]: Without dead ends: 371 [2018-10-15 15:08:54,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-15 15:08:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-10-15 15:08:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 15:08:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 384 transitions. [2018-10-15 15:08:54,321 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 384 transitions. Word has length 221 [2018-10-15 15:08:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:54,324 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 384 transitions. [2018-10-15 15:08:54,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 384 transitions. [2018-10-15 15:08:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-15 15:08:54,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:54,338 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:08:54,339 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:54,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 232124623, now seen corresponding path program 1 times [2018-10-15 15:08:54,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-15 15:08:54,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:54,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:54,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:54,610 INFO L87 Difference]: Start difference. First operand 371 states and 384 transitions. Second operand 3 states. [2018-10-15 15:08:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:54,742 INFO L93 Difference]: Finished difference Result 417 states and 430 transitions. [2018-10-15 15:08:54,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:54,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2018-10-15 15:08:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:54,746 INFO L225 Difference]: With dead ends: 417 [2018-10-15 15:08:54,746 INFO L226 Difference]: Without dead ends: 417 [2018-10-15 15:08:54,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-15 15:08:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-10-15 15:08:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-15 15:08:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 430 transitions. [2018-10-15 15:08:54,762 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 430 transitions. Word has length 267 [2018-10-15 15:08:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:54,763 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 430 transitions. [2018-10-15 15:08:54,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 430 transitions. [2018-10-15 15:08:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 15:08:54,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:54,768 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:08:54,769 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:54,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1569429868, now seen corresponding path program 1 times [2018-10-15 15:08:54,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-15 15:08:55,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:55,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:55,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:55,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:55,013 INFO L87 Difference]: Start difference. First operand 417 states and 430 transitions. Second operand 3 states. [2018-10-15 15:08:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:55,099 INFO L93 Difference]: Finished difference Result 486 states and 505 transitions. [2018-10-15 15:08:55,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:55,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2018-10-15 15:08:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:55,103 INFO L225 Difference]: With dead ends: 486 [2018-10-15 15:08:55,103 INFO L226 Difference]: Without dead ends: 486 [2018-10-15 15:08:55,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-15 15:08:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 476. [2018-10-15 15:08:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-10-15 15:08:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 494 transitions. [2018-10-15 15:08:55,116 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 494 transitions. Word has length 268 [2018-10-15 15:08:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:55,117 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 494 transitions. [2018-10-15 15:08:55,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 494 transitions. [2018-10-15 15:08:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-15 15:08:55,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:55,123 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:08:55,124 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:55,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash -75022079, now seen corresponding path program 1 times [2018-10-15 15:08:55,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-15 15:08:55,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:55,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:55,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:55,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:55,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:55,309 INFO L87 Difference]: Start difference. First operand 476 states and 494 transitions. Second operand 3 states. [2018-10-15 15:08:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:55,591 INFO L93 Difference]: Finished difference Result 628 states and 646 transitions. [2018-10-15 15:08:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:55,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-10-15 15:08:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:55,595 INFO L225 Difference]: With dead ends: 628 [2018-10-15 15:08:55,595 INFO L226 Difference]: Without dead ends: 628 [2018-10-15 15:08:55,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-15 15:08:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 620. [2018-10-15 15:08:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-15 15:08:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 638 transitions. [2018-10-15 15:08:55,608 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 638 transitions. Word has length 341 [2018-10-15 15:08:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:55,609 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 638 transitions. [2018-10-15 15:08:55,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 638 transitions. [2018-10-15 15:08:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-15 15:08:55,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:55,617 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:08:55,618 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:55,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:55,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1464924447, now seen corresponding path program 1 times [2018-10-15 15:08:55,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-15 15:08:55,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:55,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:55,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:55,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:55,811 INFO L87 Difference]: Start difference. First operand 620 states and 638 transitions. Second operand 3 states. [2018-10-15 15:08:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:55,977 INFO L93 Difference]: Finished difference Result 772 states and 790 transitions. [2018-10-15 15:08:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:55,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 388 [2018-10-15 15:08:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:55,981 INFO L225 Difference]: With dead ends: 772 [2018-10-15 15:08:55,981 INFO L226 Difference]: Without dead ends: 728 [2018-10-15 15:08:55,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-15 15:08:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-10-15 15:08:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-10-15 15:08:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 746 transitions. [2018-10-15 15:08:55,995 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 746 transitions. Word has length 388 [2018-10-15 15:08:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:55,996 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 746 transitions. [2018-10-15 15:08:55,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 746 transitions. [2018-10-15 15:08:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-15 15:08:55,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:55,999 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:08:56,000 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:56,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash -417443506, now seen corresponding path program 1 times [2018-10-15 15:08:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 460 proven. 17 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-15 15:08:56,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:08:56,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:08:56,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:08:56,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:08:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:08:56,321 INFO L87 Difference]: Start difference. First operand 728 states and 746 transitions. Second operand 4 states. [2018-10-15 15:08:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:57,937 INFO L93 Difference]: Finished difference Result 800 states and 811 transitions. [2018-10-15 15:08:57,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:08:57,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 417 [2018-10-15 15:08:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:57,939 INFO L225 Difference]: With dead ends: 800 [2018-10-15 15:08:57,939 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:08:57,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:08:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:08:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:08:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:08:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:08:57,941 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 417 [2018-10-15 15:08:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:57,941 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:08:57,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:08:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:08:57,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:08:57,947 INFO L202 PluginConnector]: Adding new model s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:08:57 BoogieIcfgContainer [2018-10-15 15:08:57,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:08:57,949 INFO L168 Benchmark]: Toolchain (without parser) took 6366.64 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 183.0 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -213.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:08:57,951 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-15 15:08:57,951 INFO L168 Benchmark]: Boogie Preprocessor took 64.71 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-15 15:08:57,952 INFO L168 Benchmark]: RCFGBuilder took 1018.89 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-15 15:08:57,953 INFO L168 Benchmark]: TraceAbstraction took 5278.40 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 183.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -255.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:08:57,957 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.22 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 64.71 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 1018.89 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5278.40 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 183.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -255.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 379]: 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, 215 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1840 SDtfs, 261 SDslu, 1633 SDs, 0 SdLazy, 468 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=7, 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, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2268 NumberOfCodeBlocks, 2268 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 2260 ConstructedInterpolants, 0 QuantifiedInterpolants, 864094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 1637/1654 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/s3_srvr_2.BV.c.cil.c_13.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-08-57-968.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.BV.c.cil.c_13.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-08-57-968.csv Received shutdown request...