java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:08:27,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:08:27,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:08:27,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:08:27,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:08:27,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:08:27,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:08:27,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:08:27,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:08:27,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:08:27,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:08:27,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:08:27,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:08:27,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:08:27,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:08:27,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:08:27,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:08:27,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:08:27,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:08:27,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:08:27,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:08:27,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:08:27,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:08:27,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:08:27,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:08:27,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:08:27,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:08:27,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:08:27,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:08:27,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:08:27,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:08:27,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:08:27,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:08:27,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:08:27,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:08:27,167 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:08:27,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:08:27,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:08:27,192 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:08:27,192 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:08:27,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:08:27,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:08:27,194 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:08:27,195 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:08:27,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:08:27,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:08:27,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:08:27,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:08:27,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:08:27,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:08:27,196 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:08:27,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:08:27,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:08:27,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:08:27,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:08:27,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:08:27,197 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:08:27,202 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:08:27,202 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:08:27,250 INFO ]: Repository-Root is: /tmp [2018-06-25 00:08:27,265 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:08:27,271 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:08:27,272 INFO ]: Initializing SmtParser... [2018-06-25 00:08:27,273 INFO ]: SmtParser initialized [2018-06-25 00:08:27,274 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2.cil.smt2 [2018-06-25 00:08:27,275 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/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-06-25 00:08:27,358 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2.cil.smt2 unknown [2018-06-25 00:08:27,889 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2.cil.smt2 [2018-06-25 00:08:27,894 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:08:27,902 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:08:27,902 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:08:27,902 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:08:27,902 INFO ]: ChcToBoogie initialized [2018-06-25 00:08:27,906 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:08:27" (1/1) ... [2018-06-25 00:08:27,971 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27 Unit [2018-06-25 00:08:27,971 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:08:27,972 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:08:27,972 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:08:27,972 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:08:27,992 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (1/1) ... [2018-06-25 00:08:27,992 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (1/1) ... [2018-06-25 00:08:28,008 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (1/1) ... [2018-06-25 00:08:28,008 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (1/1) ... [2018-06-25 00:08:28,045 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (1/1) ... [2018-06-25 00:08:28,047 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (1/1) ... [2018-06-25 00:08:28,051 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (1/1) ... [2018-06-25 00:08:28,059 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:08:28,060 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:08:28,060 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:08:28,060 INFO ]: RCFGBuilder initialized [2018-06-25 00:08:28,061 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 00:08:28,077 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:08:28,077 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:08:28,077 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:08:28,077 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:08:28,077 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:08:28,077 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:08:28,564 INFO ]: Using library mode [2018-06-25 00:08:28,565 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:08:28 BoogieIcfgContainer [2018-06-25 00:08:28,565 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:08:28,565 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:08:28,565 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:08:28,566 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:08:28,567 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:08:28" (1/1) ... [2018-06-25 00:08:28,588 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:08:28,589 INFO ]: Using Remove infeasible edges [2018-06-25 00:08:28,590 INFO ]: Using Maximize final states [2018-06-25 00:08:28,591 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:08:28,591 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:08:28,593 INFO ]: Using Remove sink states [2018-06-25 00:08:28,594 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:08:28,598 INFO ]: Using Use SBE [2018-06-25 00:08:29,873 WARN ]: Simplifying disjunction of 7032 conjuctions. This might take some time... [2018-06-25 00:08:53,696 INFO ]: Simplified to disjunction of 7032 conjuctions. [2018-06-25 00:08:54,994 INFO ]: SBE split 1 edges [2018-06-25 00:08:55,051 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:08:55,053 INFO ]: 0 new accepting states [2018-06-25 00:08:55,104 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:08:55,106 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:08:55,188 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:08:55,189 INFO ]: 0 new accepting states [2018-06-25 00:08:55,190 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:08:55,190 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:08:55,308 INFO ]: Encoded RCFG 6 locations, 884 edges [2018-06-25 00:08:55,309 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:08:55 BasicIcfg [2018-06-25 00:08:55,309 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:08:55,310 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:08:55,310 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:08:55,314 INFO ]: TraceAbstraction initialized [2018-06-25 00:08:55,314 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:08:27" (1/4) ... [2018-06-25 00:08:55,315 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9dbccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:08:55, skipping insertion in model container [2018-06-25 00:08:55,315 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:08:27" (2/4) ... [2018-06-25 00:08:55,316 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9dbccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:08:55, skipping insertion in model container [2018-06-25 00:08:55,316 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:08:28" (3/4) ... [2018-06-25 00:08:55,316 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9dbccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:08:55, skipping insertion in model container [2018-06-25 00:08:55,316 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:08:55" (4/4) ... [2018-06-25 00:08:55,320 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:08:55,330 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:08:55,340 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:08:55,398 INFO ]: Using default assertion order modulation [2018-06-25 00:08:55,398 INFO ]: Interprodecural is true [2018-06-25 00:08:55,398 INFO ]: Hoare is false [2018-06-25 00:08:55,398 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:08:55,398 INFO ]: Backedges is TWOTRACK [2018-06-25 00:08:55,398 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:08:55,398 INFO ]: Difference is false [2018-06-25 00:08:55,398 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:08:55,398 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:08:55,417 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:08:55,440 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:08:55,440 INFO ]: Found error trace [2018-06-25 00:08:55,441 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:08:55,441 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:55,444 INFO ]: Analyzing trace with hash 62433570, now seen corresponding path program 1 times [2018-06-25 00:08:55,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:55,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:55,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:55,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:55,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:55,550 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:55,678 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:08:55,681 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:55,681 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:55,683 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:55,698 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:55,699 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:55,702 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:09:01,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:01,659 INFO ]: Finished difference Result 7 states and 981 transitions. [2018-06-25 00:09:01,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:01,660 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:09:01,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:01,673 INFO ]: With dead ends: 7 [2018-06-25 00:09:01,673 INFO ]: Without dead ends: 7 [2018-06-25 00:09:01,675 INFO ]: 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-06-25 00:09:01,701 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:09:01,740 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:09:01,742 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:09:01,744 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 981 transitions. [2018-06-25 00:09:01,745 INFO ]: Start accepts. Automaton has 7 states and 981 transitions. Word has length 5 [2018-06-25 00:09:01,746 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:01,746 INFO ]: Abstraction has 7 states and 981 transitions. [2018-06-25 00:09:01,746 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:01,746 INFO ]: Start isEmpty. Operand 7 states and 981 transitions. [2018-06-25 00:09:01,747 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:09:01,747 INFO ]: Found error trace [2018-06-25 00:09:01,747 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:09:01,747 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:01,747 INFO ]: Analyzing trace with hash 1915970008, now seen corresponding path program 1 times [2018-06-25 00:09:01,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:01,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:01,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:01,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:01,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:01,797 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:01,850 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:09:01,850 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:01,851 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:01,852 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:01,852 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:01,852 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:01,852 INFO ]: Start difference. First operand 7 states and 981 transitions. Second operand 3 states. [2018-06-25 00:09:04,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:04,580 INFO ]: Finished difference Result 8 states and 983 transitions. [2018-06-25 00:09:04,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:04,580 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:09:04,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:04,582 INFO ]: With dead ends: 8 [2018-06-25 00:09:04,582 INFO ]: Without dead ends: 8 [2018-06-25 00:09:04,582 INFO ]: 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-06-25 00:09:04,583 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:09:04,595 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:09:04,595 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:09:04,597 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2018-06-25 00:09:04,598 INFO ]: Start accepts. Automaton has 8 states and 983 transitions. Word has length 6 [2018-06-25 00:09:04,598 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:04,598 INFO ]: Abstraction has 8 states and 983 transitions. [2018-06-25 00:09:04,598 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:04,598 INFO ]: Start isEmpty. Operand 8 states and 983 transitions. [2018-06-25 00:09:04,598 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:09:04,598 INFO ]: Found error trace [2018-06-25 00:09:04,598 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:09:04,598 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:04,598 INFO ]: Analyzing trace with hash 1918323497, now seen corresponding path program 1 times [2018-06-25 00:09:04,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:04,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:04,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:04,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:04,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:04,623 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:04,674 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:09:04,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:04,674 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:04,674 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:04,674 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:04,675 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:04,675 INFO ]: Start difference. First operand 8 states and 983 transitions. Second operand 3 states. [2018-06-25 00:09:07,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:07,694 INFO ]: Finished difference Result 9 states and 985 transitions. [2018-06-25 00:09:07,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:07,695 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:09:07,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:07,696 INFO ]: With dead ends: 9 [2018-06-25 00:09:07,696 INFO ]: Without dead ends: 9 [2018-06-25 00:09:07,697 INFO ]: 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-06-25 00:09:07,697 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:09:07,703 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:09:07,703 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:09:07,705 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2018-06-25 00:09:07,705 INFO ]: Start accepts. Automaton has 9 states and 985 transitions. Word has length 6 [2018-06-25 00:09:07,705 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:07,705 INFO ]: Abstraction has 9 states and 985 transitions. [2018-06-25 00:09:07,706 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:07,706 INFO ]: Start isEmpty. Operand 9 states and 985 transitions. [2018-06-25 00:09:07,706 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:09:07,706 INFO ]: Found error trace [2018-06-25 00:09:07,706 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:07,706 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:07,706 INFO ]: Analyzing trace with hash 661617152, now seen corresponding path program 1 times [2018-06-25 00:09:07,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:07,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:07,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:07,708 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:07,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:07,766 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:07,852 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:09:07,852 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:07,852 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:07,852 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:07,852 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:07,852 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:07,852 INFO ]: Start difference. First operand 9 states and 985 transitions. Second operand 3 states. [2018-06-25 00:09:10,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:10,514 INFO ]: Finished difference Result 11 states and 1000 transitions. [2018-06-25 00:09:10,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:10,515 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:09:10,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:10,516 INFO ]: With dead ends: 11 [2018-06-25 00:09:10,516 INFO ]: Without dead ends: 11 [2018-06-25 00:09:10,517 INFO ]: 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-06-25 00:09:10,517 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:09:10,523 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:09:10,523 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:09:10,526 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1000 transitions. [2018-06-25 00:09:10,526 INFO ]: Start accepts. Automaton has 11 states and 1000 transitions. Word has length 8 [2018-06-25 00:09:10,526 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:10,526 INFO ]: Abstraction has 11 states and 1000 transitions. [2018-06-25 00:09:10,526 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:10,526 INFO ]: Start isEmpty. Operand 11 states and 1000 transitions. [2018-06-25 00:09:10,527 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:09:10,527 INFO ]: Found error trace [2018-06-25 00:09:10,527 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:10,527 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:10,527 INFO ]: Analyzing trace with hash 238644534, now seen corresponding path program 1 times [2018-06-25 00:09:10,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:10,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:10,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:10,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:10,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:10,574 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:10,668 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:09:10,668 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:10,668 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:10,668 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:10,669 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:10,669 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:10,669 INFO ]: Start difference. First operand 11 states and 1000 transitions. Second operand 3 states. [2018-06-25 00:09:12,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:12,999 INFO ]: Finished difference Result 13 states and 1040 transitions. [2018-06-25 00:09:12,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:12,999 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:09:12,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:13,000 INFO ]: With dead ends: 13 [2018-06-25 00:09:13,001 INFO ]: Without dead ends: 13 [2018-06-25 00:09:13,001 INFO ]: 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-06-25 00:09:13,001 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:09:13,005 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 00:09:13,006 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:09:13,008 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1038 transitions. [2018-06-25 00:09:13,008 INFO ]: Start accepts. Automaton has 12 states and 1038 transitions. Word has length 8 [2018-06-25 00:09:13,008 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:13,008 INFO ]: Abstraction has 12 states and 1038 transitions. [2018-06-25 00:09:13,008 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:13,008 INFO ]: Start isEmpty. Operand 12 states and 1038 transitions. [2018-06-25 00:09:13,009 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:09:13,009 INFO ]: Found error trace [2018-06-25 00:09:13,009 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:13,009 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:13,009 INFO ]: Analyzing trace with hash -1117162454, now seen corresponding path program 1 times [2018-06-25 00:09:13,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:13,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:13,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:13,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:13,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:13,059 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:13,163 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:09:13,163 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:13,163 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:13,163 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:13,163 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:13,163 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:13,164 INFO ]: Start difference. First operand 12 states and 1038 transitions. Second operand 3 states. [2018-06-25 00:09:15,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:15,291 INFO ]: Finished difference Result 14 states and 1170 transitions. [2018-06-25 00:09:15,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:15,292 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:09:15,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:15,294 INFO ]: With dead ends: 14 [2018-06-25 00:09:15,294 INFO ]: Without dead ends: 13 [2018-06-25 00:09:15,294 INFO ]: 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-06-25 00:09:15,294 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:09:15,300 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:09:15,300 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:09:15,302 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1169 transitions. [2018-06-25 00:09:15,303 INFO ]: Start accepts. Automaton has 13 states and 1169 transitions. Word has length 9 [2018-06-25 00:09:15,303 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:15,303 INFO ]: Abstraction has 13 states and 1169 transitions. [2018-06-25 00:09:15,303 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:15,303 INFO ]: Start isEmpty. Operand 13 states and 1169 transitions. [2018-06-25 00:09:15,304 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:09:15,304 INFO ]: Found error trace [2018-06-25 00:09:15,304 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:15,304 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:15,304 INFO ]: Analyzing trace with hash -812463628, now seen corresponding path program 1 times [2018-06-25 00:09:15,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:15,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:15,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:15,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:15,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:15,340 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:15,435 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:09:15,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:15,435 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:15,435 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:15,435 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:15,435 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:15,436 INFO ]: Start difference. First operand 13 states and 1169 transitions. Second operand 3 states. [2018-06-25 00:09:17,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:17,900 INFO ]: Finished difference Result 19 states and 1818 transitions. [2018-06-25 00:09:17,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:17,902 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:09:17,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:17,905 INFO ]: With dead ends: 19 [2018-06-25 00:09:17,905 INFO ]: Without dead ends: 19 [2018-06-25 00:09:17,905 INFO ]: 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-06-25 00:09:17,906 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 00:09:17,917 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-25 00:09:17,917 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 00:09:17,919 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1815 transitions. [2018-06-25 00:09:17,919 INFO ]: Start accepts. Automaton has 17 states and 1815 transitions. Word has length 9 [2018-06-25 00:09:17,919 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:17,919 INFO ]: Abstraction has 17 states and 1815 transitions. [2018-06-25 00:09:17,919 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:17,919 INFO ]: Start isEmpty. Operand 17 states and 1815 transitions. [2018-06-25 00:09:17,920 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:09:17,920 INFO ]: Found error trace [2018-06-25 00:09:17,920 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:17,920 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:17,921 INFO ]: Analyzing trace with hash -979620929, now seen corresponding path program 1 times [2018-06-25 00:09:17,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:17,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:17,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:17,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:17,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:17,952 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:18,041 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:09:18,041 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:18,071 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:18,071 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:18,071 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:18,071 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:18,071 INFO ]: Start difference. First operand 17 states and 1815 transitions. Second operand 3 states. [2018-06-25 00:09:20,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:20,448 INFO ]: Finished difference Result 20 states and 1881 transitions. [2018-06-25 00:09:20,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:20,448 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:09:20,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:20,450 INFO ]: With dead ends: 20 [2018-06-25 00:09:20,450 INFO ]: Without dead ends: 20 [2018-06-25 00:09:20,451 INFO ]: 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-06-25 00:09:20,451 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 00:09:20,462 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-06-25 00:09:20,462 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 00:09:20,464 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1815 transitions. [2018-06-25 00:09:20,464 INFO ]: Start accepts. Automaton has 17 states and 1815 transitions. Word has length 9 [2018-06-25 00:09:20,464 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:20,464 INFO ]: Abstraction has 17 states and 1815 transitions. [2018-06-25 00:09:20,464 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:20,464 INFO ]: Start isEmpty. Operand 17 states and 1815 transitions. [2018-06-25 00:09:20,465 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:09:20,465 INFO ]: Found error trace [2018-06-25 00:09:20,465 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:20,465 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:20,465 INFO ]: Analyzing trace with hash -1140313583, now seen corresponding path program 1 times [2018-06-25 00:09:20,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:20,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:20,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:20,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:20,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:20,493 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:20,586 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:09:20,587 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:20,587 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:20,587 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:20,587 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:20,587 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:20,587 INFO ]: Start difference. First operand 17 states and 1815 transitions. Second operand 3 states. [2018-06-25 00:09:22,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:22,930 INFO ]: Finished difference Result 20 states and 1977 transitions. [2018-06-25 00:09:22,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:22,931 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:09:22,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:22,933 INFO ]: With dead ends: 20 [2018-06-25 00:09:22,933 INFO ]: Without dead ends: 20 [2018-06-25 00:09:22,934 INFO ]: 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-06-25 00:09:22,934 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 00:09:22,944 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-25 00:09:22,944 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 00:09:22,946 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1975 transitions. [2018-06-25 00:09:22,946 INFO ]: Start accepts. Automaton has 19 states and 1975 transitions. Word has length 9 [2018-06-25 00:09:22,946 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:22,946 INFO ]: Abstraction has 19 states and 1975 transitions. [2018-06-25 00:09:22,946 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:22,946 INFO ]: Start isEmpty. Operand 19 states and 1975 transitions. [2018-06-25 00:09:22,949 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:09:22,949 INFO ]: Found error trace [2018-06-25 00:09:22,949 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:22,949 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:22,949 INFO ]: Analyzing trace with hash -11017984, now seen corresponding path program 1 times [2018-06-25 00:09:22,949 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:22,949 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:22,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:22,950 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:22,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:22,988 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:23,209 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-25 00:09:23,281 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:09:23,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:09:23,282 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:09:23,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:23,497 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:23,514 INFO ]: Computing forward predicates... [2018-06-25 00:09:23,743 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:09:23,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:09:23,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 00:09:23,783 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:09:23,783 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:09:23,783 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:09:23,783 INFO ]: Start difference. First operand 19 states and 1975 transitions. Second operand 6 states. [2018-06-25 00:09:32,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:32,569 INFO ]: Finished difference Result 52 states and 6865 transitions. [2018-06-25 00:09:32,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:09:32,569 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-25 00:09:32,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:32,584 INFO ]: With dead ends: 52 [2018-06-25 00:09:32,584 INFO ]: Without dead ends: 52 [2018-06-25 00:09:32,585 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:09:32,586 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-25 00:09:32,611 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-06-25 00:09:32,611 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 00:09:32,618 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 5197 transitions. [2018-06-25 00:09:32,618 INFO ]: Start accepts. Automaton has 39 states and 5197 transitions. Word has length 10 [2018-06-25 00:09:32,618 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:32,618 INFO ]: Abstraction has 39 states and 5197 transitions. [2018-06-25 00:09:32,618 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:09:32,618 INFO ]: Start isEmpty. Operand 39 states and 5197 transitions. [2018-06-25 00:09:32,620 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:09:32,620 INFO ]: Found error trace [2018-06-25 00:09:32,620 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:32,621 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:32,621 INFO ]: Analyzing trace with hash 167221569, now seen corresponding path program 1 times [2018-06-25 00:09:32,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:32,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:32,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:32,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:32,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:32,654 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:32,754 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:09:32,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:32,754 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:32,754 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:32,754 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:32,754 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:32,754 INFO ]: Start difference. First operand 39 states and 5197 transitions. Second operand 3 states. [2018-06-25 00:09:35,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:35,208 INFO ]: Finished difference Result 26 states and 2963 transitions. [2018-06-25 00:09:35,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:35,209 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:09:35,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:35,212 INFO ]: With dead ends: 26 [2018-06-25 00:09:35,212 INFO ]: Without dead ends: 26 [2018-06-25 00:09:35,212 INFO ]: 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-06-25 00:09:35,212 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 00:09:35,227 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-25 00:09:35,227 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 00:09:35,229 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2934 transitions. [2018-06-25 00:09:35,229 INFO ]: Start accepts. Automaton has 23 states and 2934 transitions. Word has length 10 [2018-06-25 00:09:35,229 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:35,229 INFO ]: Abstraction has 23 states and 2934 transitions. [2018-06-25 00:09:35,229 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:35,229 INFO ]: Start isEmpty. Operand 23 states and 2934 transitions. [2018-06-25 00:09:35,231 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:09:35,232 INFO ]: Found error trace [2018-06-25 00:09:35,232 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:35,232 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:35,232 INFO ]: Analyzing trace with hash 1440913617, now seen corresponding path program 1 times [2018-06-25 00:09:35,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:35,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:35,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:35,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:35,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:35,260 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:35,475 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-25 00:09:35,546 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:09:35,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:09:35,546 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 00:09:35,559 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:09:35,730 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:35,737 INFO ]: Computing forward predicates... [2018-06-25 00:09:35,949 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:09:35,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:09:35,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 00:09:35,985 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:09:35,985 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:09:35,985 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:09:35,985 INFO ]: Start difference. First operand 23 states and 2934 transitions. Second operand 6 states. Received shutdown request... [2018-06-25 00:09:37,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:09:37,003 WARN ]: Verification canceled [2018-06-25 00:09:37,006 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:09:37,007 WARN ]: Timeout [2018-06-25 00:09:37,007 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:09:37 BasicIcfg [2018-06-25 00:09:37,007 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:09:37,008 INFO ]: Toolchain (without parser) took 69113.10 ms. Allocated memory was 309.3 MB in the beginning and 1.0 GB in the end (delta: 726.7 MB). Free memory was 243.7 MB in the beginning and 612.4 MB in the end (delta: -368.7 MB). Peak memory consumption was 358.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:37,009 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:09:37,009 INFO ]: ChcToBoogie took 69.18 ms. Allocated memory is still 309.3 MB. Free memory was 242.7 MB in the beginning and 239.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:37,009 INFO ]: Boogie Preprocessor took 87.51 ms. Allocated memory is still 309.3 MB. Free memory was 239.8 MB in the beginning and 235.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:37,010 INFO ]: RCFGBuilder took 504.97 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 203.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:37,010 INFO ]: BlockEncodingV2 took 26743.76 ms. Allocated memory was 309.3 MB in the beginning and 393.2 MB in the end (delta: 83.9 MB). Free memory was 203.8 MB in the beginning and 208.1 MB in the end (delta: -4.3 MB). Peak memory consumption was 97.6 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:37,010 INFO ]: TraceAbstraction took 41697.58 ms. Allocated memory was 393.2 MB in the beginning and 1.0 GB in the end (delta: 642.8 MB). Free memory was 204.9 MB in the beginning and 612.4 MB in the end (delta: -407.5 MB). Peak memory consumption was 235.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:37,017 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 884 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.18 ms. Allocated memory is still 309.3 MB. Free memory was 242.7 MB in the beginning and 239.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 87.51 ms. Allocated memory is still 309.3 MB. Free memory was 239.8 MB in the beginning and 235.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 504.97 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 203.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 26743.76 ms. Allocated memory was 309.3 MB in the beginning and 393.2 MB in the end (delta: 83.9 MB). Free memory was 203.8 MB in the beginning and 208.1 MB in the end (delta: -4.3 MB). Peak memory consumption was 97.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 41697.58 ms. Allocated memory was 393.2 MB in the beginning and 1.0 GB in the end (delta: 642.8 MB). Free memory was 204.9 MB in the beginning and 612.4 MB in the end (delta: -407.5 MB). Peak memory consumption was 235.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (23states) and interpolant automaton (currently 6 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 41.6s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 38.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 0 SDslu, 48 SDs, 0 SdLazy, 10807 SolverSat, 11675 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 1132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2423 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 125/129 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-09-37-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-09-37-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-09-37-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-09-37-034.csv Completed graceful shutdown