java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/abstractInterpretation/regression/open/eq/38_definition_of_weak_equivalence.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:53,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:53,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:53,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:53,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:53,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:53,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:53,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:53,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:53,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:53,934 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:53,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:53,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:53,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:53,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:53,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:53,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:53,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:53,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:53,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:53,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:53,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:53,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:53,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:53,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:53,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:53,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:53,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:53,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:53,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:53,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:53,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:53,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:53,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:53,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:53,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:53,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:53,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:53,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:53,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:53,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:53,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:54,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:54,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:54,011 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:54,012 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:54,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/eq/38_definition_of_weak_equivalence.bpl [2019-08-05 11:09:54,013 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/eq/38_definition_of_weak_equivalence.bpl' [2019-08-05 11:09:54,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:54,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:54,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:54,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:54,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:54,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,088 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:09:54,088 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:09:54,088 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:09:54,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:54,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:54,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:54,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:54,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/1) ... [2019-08-05 11:09:54,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:54,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:54,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:54,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:54,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (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 [2019-08-05 11:09:54,187 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:09:54,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:09:54,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:09:54,482 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:09:54,483 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:09:54,484 INFO L202 PluginConnector]: Adding new model 38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:54 BoogieIcfgContainer [2019-08-05 11:09:54,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:54,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:54,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:54,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:54,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:54" (1/2) ... [2019-08-05 11:09:54,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121cd6ab and model type 38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:54, skipping insertion in model container [2019-08-05 11:09:54,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:54" (2/2) ... [2019-08-05 11:09:54,492 INFO L109 eAbstractionObserver]: Analyzing ICFG 38_definition_of_weak_equivalence.bpl [2019-08-05 11:09:54,502 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:54,509 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 11:09:54,525 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 11:09:54,549 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:54,550 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:54,550 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:54,550 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:54,550 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:54,551 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:54,551 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:54,551 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:54,551 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:09:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:09:54,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:54,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:09:54,577 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:54,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:54,583 INFO L82 PathProgramCache]: Analyzing trace with hash 962, now seen corresponding path program 1 times [2019-08-05 11:09:54,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:54,665 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:54,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,042 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_k Int)) (= c_main_a1 (store c_main_b1 c_main_i main_k))) is different from true [2019-08-05 11:09:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:55,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:55,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:09:55,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:55,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-08-05 11:09:55,072 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 11:09:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,091 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2019-08-05 11:09:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:55,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:09:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,105 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:09:55,106 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:09:55,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-08-05 11:09:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:09:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:09:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:09:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2019-08-05 11:09:55,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 2 [2019-08-05 11:09:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,170 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2019-08-05 11:09:55,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2019-08-05 11:09:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:09:55,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:09:55,178 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2019-08-05 11:09:55,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:09:55,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:09:55,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:09:55,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:09:55,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 11:09:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:55,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:55,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:09:55,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:55,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:55,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:55,370 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand 3 states. [2019-08-05 11:09:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,441 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2019-08-05 11:09:55,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:55,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:09:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,443 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:09:55,443 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:09:55,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:09:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:09:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:09:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2019-08-05 11:09:55,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 3 [2019-08-05 11:09:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,447 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2019-08-05 11:09:55,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2019-08-05 11:09:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:09:55,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:09:55,452 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2019-08-05 11:09:55,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,953 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_k Int)) (= c_main_a2 (store c_main_b2 c_main_i (store (select c_main_b2 c_main_i) c_main_j main_k)))) is different from true [2019-08-05 11:09:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:55,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:55,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:09:55,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:55,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-08-05 11:09:55,956 INFO L87 Difference]: Start difference. First operand 7 states and 6 transitions. Second operand 3 states. [2019-08-05 11:09:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,957 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-08-05 11:09:55,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:55,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:09:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,959 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:09:55,959 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:09:55,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-08-05 11:09:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:09:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:09:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:09:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5 transitions. [2019-08-05 11:09:55,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 5 transitions. Word has length 4 [2019-08-05 11:09:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,962 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 5 transitions. [2019-08-05 11:09:55,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2019-08-05 11:09:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:09:55,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:09:55,964 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2019-08-05 11:09:55,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:56,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:09:56,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:09:56,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:09:56,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:09:56,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-08-05 11:09:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:56,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:56,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:09:56,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:56,043 INFO L87 Difference]: Start difference. First operand 6 states and 5 transitions. Second operand 3 states. [2019-08-05 11:09:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:56,061 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2019-08-05 11:09:56,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:56,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:09:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:56,062 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:09:56,063 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:09:56,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:09:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:09:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:09:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:09:56,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-08-05 11:09:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:56,065 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:09:56,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:09:56,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:09:56,071 INFO L202 PluginConnector]: Adding new model 38_definition_of_weak_equivalence.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:09:56 BoogieIcfgContainer [2019-08-05 11:09:56,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:09:56,074 INFO L168 Benchmark]: Toolchain (without parser) took 2024.63 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 64.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,075 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 108.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,077 INFO L168 Benchmark]: Boogie Preprocessor took 23.29 ms. Allocated memory is still 140.5 MB. Free memory was 108.4 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,078 INFO L168 Benchmark]: RCFGBuilder took 369.38 ms. Allocated memory is still 140.5 MB. Free memory was 107.2 MB in the beginning and 97.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,079 INFO L168 Benchmark]: TraceAbstraction took 1586.15 ms. Allocated memory is still 140.5 MB. Free memory was 97.3 MB in the beginning and 64.3 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,083 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 108.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.29 ms. Allocated memory is still 140.5 MB. Free memory was 108.4 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 369.38 ms. Allocated memory is still 140.5 MB. Free memory was 107.2 MB in the beginning and 97.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1586.15 ms. Allocated memory is still 140.5 MB. Free memory was 97.3 MB in the beginning and 64.3 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 22]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 17]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 4 error locations. SAFE Result, 1.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 4 SDslu, 0 SDs, 0 SdLazy, 8 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 10 ConstructedInterpolants, 2 QuantifiedInterpolants, 133 SizeOfPredicates, 4 NumberOfNonLiveVariables, 26 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...