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/alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:53:58,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:53:58,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:53:58,672 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:53:58,672 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:53:58,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:53:58,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:53:58,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:53:58,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:53:58,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:53:58,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:53:58,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:53:58,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:53:58,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:53:58,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:53:58,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:53:58,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:53:58,697 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:53:58,699 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:53:58,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:53:58,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:53:58,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:53:58,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:53:58,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:53:58,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:53:58,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:53:58,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:53:58,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:53:58,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:53:58,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:53:58,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:53:58,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:53:58,724 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:53:58,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:53:58,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:53:58,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:53:58,727 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 20:53:58,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:53:58,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:53:58,750 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:53:58,750 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:53:58,750 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:53:58,750 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:53:58,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:53:58,751 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:53:58,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:53:58,751 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:53:58,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:53:58,752 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:53:58,752 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:53:58,753 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:53:58,753 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:53:58,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:53:58,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:53:58,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:53:58,816 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:53:58,817 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:53:58,817 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl [2018-10-12 20:53:58,818 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl' [2018-10-12 20:53:58,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:53:58,905 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:53:58,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:53:58,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:53:58,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:53:58,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/1) ... [2018-10-12 20:53:58,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/1) ... [2018-10-12 20:53:58,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/1) ... [2018-10-12 20:53:58,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/1) ... [2018-10-12 20:53:58,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/1) ... [2018-10-12 20:53:58,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/1) ... [2018-10-12 20:53:58,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/1) ... [2018-10-12 20:53:59,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:53:59,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:53:59,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:53:59,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:53:59,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 20:53:59,080 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:53:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:53:59,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:54:00,104 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:54:00,104 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:54:00 BoogieIcfgContainer [2018-10-12 20:54:00,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:54:00,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:54:00,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:54:00,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:54:00,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:53:58" (1/2) ... [2018-10-12 20:54:00,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f471f0a and model type alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:54:00, skipping insertion in model container [2018-10-12 20:54:00,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:54:00" (2/2) ... [2018-10-12 20:54:00,113 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl [2018-10-12 20:54:00,122 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:54:00,131 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:54:00,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:54:00,178 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:54:00,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:54:00,179 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:54:00,179 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:54:00,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:54:00,180 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:54:00,180 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:54:00,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:54:00,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:54:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-10-12 20:54:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-12 20:54:00,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:00,230 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] [2018-10-12 20:54:00,231 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:00,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:00,240 INFO L82 PathProgramCache]: Analyzing trace with hash 561168593, now seen corresponding path program 1 times [2018-10-12 20:54:00,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:54:00,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:54:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-12 20:54:00,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 20:54:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 20:54:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:54:00,944 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 11 states. [2018-10-12 20:54:01,626 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-12 20:54:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:02,936 INFO L93 Difference]: Finished difference Result 314 states and 319 transitions. [2018-10-12 20:54:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 20:54:02,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-10-12 20:54:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:02,956 INFO L225 Difference]: With dead ends: 314 [2018-10-12 20:54:02,956 INFO L226 Difference]: Without dead ends: 305 [2018-10-12 20:54:02,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:54:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-12 20:54:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 202. [2018-10-12 20:54:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-12 20:54:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 206 transitions. [2018-10-12 20:54:03,017 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 206 transitions. Word has length 63 [2018-10-12 20:54:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:03,018 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 206 transitions. [2018-10-12 20:54:03,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 20:54:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 206 transitions. [2018-10-12 20:54:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-12 20:54:03,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:03,023 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:54:03,024 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:03,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:03,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1551789551, now seen corresponding path program 1 times [2018-10-12 20:54:03,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:54:03,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:54:03,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-12 20:54:03,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 20:54:03,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 20:54:03,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:54:03,311 INFO L87 Difference]: Start difference. First operand 202 states and 206 transitions. Second operand 11 states. [2018-10-12 20:54:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:04,566 INFO L93 Difference]: Finished difference Result 395 states and 399 transitions. [2018-10-12 20:54:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-12 20:54:04,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-10-12 20:54:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:04,571 INFO L225 Difference]: With dead ends: 395 [2018-10-12 20:54:04,571 INFO L226 Difference]: Without dead ends: 384 [2018-10-12 20:54:04,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:54:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-12 20:54:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 231. [2018-10-12 20:54:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-12 20:54:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 236 transitions. [2018-10-12 20:54:04,593 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 236 transitions. Word has length 90 [2018-10-12 20:54:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:04,593 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 236 transitions. [2018-10-12 20:54:04,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 20:54:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 236 transitions. [2018-10-12 20:54:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-12 20:54:04,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:04,597 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:54:04,598 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:04,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash 365499037, now seen corresponding path program 1 times [2018-10-12 20:54:04,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:05,192 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:54:05,435 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:54:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:54:05,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:54:05,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 20:54:05,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 20:54:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 20:54:05,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:54:05,949 INFO L87 Difference]: Start difference. First operand 231 states and 236 transitions. Second operand 27 states. [2018-10-12 20:54:06,774 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-10-12 20:54:08,965 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-10-12 20:54:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:12,104 INFO L93 Difference]: Finished difference Result 559 states and 568 transitions. [2018-10-12 20:54:12,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 20:54:12,104 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2018-10-12 20:54:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:12,108 INFO L225 Difference]: With dead ends: 559 [2018-10-12 20:54:12,109 INFO L226 Difference]: Without dead ends: 559 [2018-10-12 20:54:12,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=594, Invalid=4098, Unknown=0, NotChecked=0, Total=4692 [2018-10-12 20:54:12,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-12 20:54:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 274. [2018-10-12 20:54:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-12 20:54:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 280 transitions. [2018-10-12 20:54:12,133 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 280 transitions. Word has length 106 [2018-10-12 20:54:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:12,134 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 280 transitions. [2018-10-12 20:54:12,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 20:54:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 280 transitions. [2018-10-12 20:54:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-12 20:54:12,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:12,137 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:54:12,137 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:12,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:12,138 INFO L82 PathProgramCache]: Analyzing trace with hash -792833185, now seen corresponding path program 1 times [2018-10-12 20:54:12,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-12 20:54:12,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:54:12,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-12 20:54:12,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 20:54:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 20:54:12,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-12 20:54:12,312 INFO L87 Difference]: Start difference. First operand 274 states and 280 transitions. Second operand 9 states. [2018-10-12 20:54:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:12,807 INFO L93 Difference]: Finished difference Result 381 states and 386 transitions. [2018-10-12 20:54:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 20:54:12,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2018-10-12 20:54:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:12,809 INFO L225 Difference]: With dead ends: 381 [2018-10-12 20:54:12,810 INFO L226 Difference]: Without dead ends: 349 [2018-10-12 20:54:12,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:54:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-12 20:54:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 274. [2018-10-12 20:54:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-12 20:54:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 279 transitions. [2018-10-12 20:54:12,823 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 279 transitions. Word has length 122 [2018-10-12 20:54:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:12,824 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 279 transitions. [2018-10-12 20:54:12,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 20:54:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 279 transitions. [2018-10-12 20:54:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-12 20:54:12,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:12,828 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-12 20:54:12,828 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:12,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:12,828 INFO L82 PathProgramCache]: Analyzing trace with hash 695081297, now seen corresponding path program 2 times [2018-10-12 20:54:12,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:54:12,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:54:12,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-12 20:54:12,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-12 20:54:12,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-12 20:54:12,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-12 20:54:12,931 INFO L87 Difference]: Start difference. First operand 274 states and 279 transitions. Second operand 3 states. [2018-10-12 20:54:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:12,950 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-12 20:54:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-12 20:54:12,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2018-10-12 20:54:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:12,954 INFO L225 Difference]: With dead ends: 170 [2018-10-12 20:54:12,954 INFO L226 Difference]: Without dead ends: 166 [2018-10-12 20:54:12,955 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-12 20:54:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-12 20:54:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-12 20:54:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-12 20:54:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-12 20:54:12,960 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 149 [2018-10-12 20:54:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:12,960 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-12 20:54:12,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-12 20:54:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-12 20:54:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-12 20:54:12,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:12,963 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:54:12,964 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:12,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1392020973, now seen corresponding path program 1 times [2018-10-12 20:54:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:14,263 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 16 [2018-10-12 20:54:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:54:16,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:54:16,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 20:54:16,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 20:54:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 20:54:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:54:16,293 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 34 states. [2018-10-12 20:54:17,263 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-12 20:54:18,309 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-10-12 20:54:18,528 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2018-10-12 20:54:18,893 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-10-12 20:54:19,109 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2018-10-12 20:54:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:21,993 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-10-12 20:54:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-12 20:54:21,994 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 165 [2018-10-12 20:54:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:21,996 INFO L225 Difference]: With dead ends: 213 [2018-10-12 20:54:21,996 INFO L226 Difference]: Without dead ends: 204 [2018-10-12 20:54:21,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=474, Invalid=4496, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 20:54:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-12 20:54:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2018-10-12 20:54:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-12 20:54:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-12 20:54:22,002 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 165 [2018-10-12 20:54:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:22,003 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-12 20:54:22,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 20:54:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-12 20:54:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-12 20:54:22,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:22,006 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-12 20:54:22,006 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:22,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:22,007 INFO L82 PathProgramCache]: Analyzing trace with hash -798555283, now seen corresponding path program 2 times [2018-10-12 20:54:22,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:22,783 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:54:23,027 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:54:23,285 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:54:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 23 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:54:23,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:54:23,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 20:54:23,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 20:54:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 20:54:23,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:54:23,857 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 31 states. [2018-10-12 20:54:25,795 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-10-12 20:54:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:27,897 INFO L93 Difference]: Finished difference Result 168 states and 167 transitions. [2018-10-12 20:54:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 20:54:27,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 192 [2018-10-12 20:54:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:27,898 INFO L225 Difference]: With dead ends: 168 [2018-10-12 20:54:27,898 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 20:54:27,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=733, Invalid=3689, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 20:54:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 20:54:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 20:54:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 20:54:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 20:54:27,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2018-10-12 20:54:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:27,902 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 20:54:27,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 20:54:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 20:54:27,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 20:54:27,907 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 08:54:27 BoogieIcfgContainer [2018-10-12 20:54:27,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 20:54:27,908 INFO L168 Benchmark]: Toolchain (without parser) took 29004.01 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.1 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -127.3 MB). Peak memory consumption was 231.8 MB. Max. memory is 7.1 GB. [2018-10-12 20:54:27,909 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 20:54:27,910 INFO L168 Benchmark]: Boogie Preprocessor took 96.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 20:54:27,910 INFO L168 Benchmark]: RCFGBuilder took 1102.53 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-12 20:54:27,911 INFO L168 Benchmark]: TraceAbstraction took 27801.22 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.1 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -169.6 MB). Peak memory consumption was 189.5 MB. Max. memory is 7.1 GB. [2018-10-12 20:54:27,915 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.46 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 1102.53 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 27801.22 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.1 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -169.6 MB). Peak memory consumption was 189.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 251]: 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, 148 locations, 1 error locations. SAFE Result, 27.7s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 876 SDtfs, 4744 SDslu, 9626 SDs, 0 SdLazy, 7613 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=3, 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, 7 MinimizatonAttempts, 627 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 887 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 880 ConstructedInterpolants, 0 QuantifiedInterpolants, 1136618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 106/152 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/alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-12_20-54-27-926.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-12_20-54-27-926.csv Received shutdown request...