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/eldarica-misc/LIA/reve/014d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:06:38,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:06:38,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:06:38,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:06:38,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:06:38,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:06:38,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:06:38,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:06:38,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:06:38,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:06:38,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:06:38,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:06:38,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:06:38,858 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:06:38,859 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:06:38,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:06:38,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:06:38,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:06:38,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:06:38,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:06:38,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:06:38,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:06:38,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:06:38,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:06:38,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:06:38,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:06:38,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:06:38,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:06:38,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:06:38,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:06:38,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:06:38,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:06:38,880 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:06:38,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:06:38,881 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:06:38,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:06:38,882 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:06:38,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:06:38,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:06:38,898 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:06:38,899 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:06:38,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:06:38,900 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:06:38,900 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:06:38,900 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:06:38,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:06:38,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:06:38,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:06:38,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:06:38,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:06:38,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:06:38,902 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:06:38,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:06:38,902 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:06:38,902 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:06:38,902 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:06:38,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:06:38,903 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:06:38,904 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:06:38,904 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:06:38,954 INFO ]: Repository-Root is: /tmp [2018-06-26 18:06:38,969 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:06:38,974 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:06:38,975 INFO ]: Initializing SmtParser... [2018-06-26 18:06:38,975 INFO ]: SmtParser initialized [2018-06-26 18:06:38,976 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 [2018-06-26 18:06:38,977 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-26 18:06:39,065 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 unknown [2018-06-26 18:06:39,278 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 [2018-06-26 18:06:39,282 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:06:39,288 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:06:39,289 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:06:39,289 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:06:39,289 INFO ]: ChcToBoogie initialized [2018-06-26 18:06:39,292 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,345 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39 Unit [2018-06-26 18:06:39,345 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:06:39,346 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:06:39,346 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:06:39,346 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:06:39,368 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,368 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,374 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,374 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,379 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,388 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,389 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,394 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:06:39,395 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:06:39,395 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:06:39,395 INFO ]: RCFGBuilder initialized [2018-06-26 18:06:39,396 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (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-26 18:06:39,412 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:06:39,413 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:06:39,413 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:06:39,413 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:06:39,413 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:06:39,413 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-26 18:06:39,769 INFO ]: Using library mode [2018-06-26 18:06:39,769 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:06:39 BoogieIcfgContainer [2018-06-26 18:06:39,769 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:06:39,769 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:06:39,769 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:06:39,771 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:06:39,771 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:06:39" (1/1) ... [2018-06-26 18:06:39,786 INFO ]: Initial Icfg 12 locations, 24 edges [2018-06-26 18:06:39,787 INFO ]: Using Remove infeasible edges [2018-06-26 18:06:39,788 INFO ]: Using Maximize final states [2018-06-26 18:06:39,788 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:06:39,788 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:06:39,790 INFO ]: Using Remove sink states [2018-06-26 18:06:39,791 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:06:39,791 INFO ]: Using Use SBE [2018-06-26 18:06:39,798 INFO ]: SBE split 0 edges [2018-06-26 18:06:39,804 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-26 18:06:39,812 INFO ]: 0 new accepting states [2018-06-26 18:06:39,869 INFO ]: Removed 8 edges and 2 locations by large block encoding [2018-06-26 18:06:39,871 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:06:39,874 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:06:39,874 INFO ]: 0 new accepting states [2018-06-26 18:06:39,874 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:06:39,874 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:06:39,874 INFO ]: Encoded RCFG 8 locations, 17 edges [2018-06-26 18:06:39,875 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:06:39 BasicIcfg [2018-06-26 18:06:39,875 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:06:39,876 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:06:39,876 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:06:39,880 INFO ]: TraceAbstraction initialized [2018-06-26 18:06:39,880 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:06:39" (1/4) ... [2018-06-26 18:06:39,881 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5069d05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:06:39, skipping insertion in model container [2018-06-26 18:06:39,881 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:39" (2/4) ... [2018-06-26 18:06:39,881 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5069d05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:06:39, skipping insertion in model container [2018-06-26 18:06:39,881 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:06:39" (3/4) ... [2018-06-26 18:06:39,882 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5069d05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:06:39, skipping insertion in model container [2018-06-26 18:06:39,882 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:06:39" (4/4) ... [2018-06-26 18:06:39,885 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:06:39,896 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:06:39,904 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:06:39,937 INFO ]: Using default assertion order modulation [2018-06-26 18:06:39,938 INFO ]: Interprodecural is true [2018-06-26 18:06:39,938 INFO ]: Hoare is false [2018-06-26 18:06:39,938 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:06:39,938 INFO ]: Backedges is TWOTRACK [2018-06-26 18:06:39,938 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:06:39,938 INFO ]: Difference is false [2018-06-26 18:06:39,938 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:06:39,938 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:06:39,945 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 18:06:39,955 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:06:39,955 INFO ]: Found error trace [2018-06-26 18:06:39,956 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:06:39,956 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:39,961 INFO ]: Analyzing trace with hash 44149066, now seen corresponding path program 1 times [2018-06-26 18:06:39,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:39,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:39,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:39,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:39,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,029 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:40,082 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:40,084 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:40,084 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:06:40,085 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:06:40,096 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:06:40,097 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:40,099 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-26 18:06:40,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:40,205 INFO ]: Finished difference Result 11 states and 25 transitions. [2018-06-26 18:06:40,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:40,206 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:06:40,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:40,215 INFO ]: With dead ends: 11 [2018-06-26 18:06:40,215 INFO ]: Without dead ends: 11 [2018-06-26 18:06:40,217 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-26 18:06:40,231 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:06:40,244 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-26 18:06:40,245 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:06:40,246 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-06-26 18:06:40,247 INFO ]: Start accepts. Automaton has 9 states and 21 transitions. Word has length 5 [2018-06-26 18:06:40,247 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:40,247 INFO ]: Abstraction has 9 states and 21 transitions. [2018-06-26 18:06:40,247 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:06:40,247 INFO ]: Start isEmpty. Operand 9 states and 21 transitions. [2018-06-26 18:06:40,248 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:06:40,248 INFO ]: Found error trace [2018-06-26 18:06:40,248 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:06:40,248 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:40,248 INFO ]: Analyzing trace with hash 44178857, now seen corresponding path program 1 times [2018-06-26 18:06:40,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:40,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:40,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:40,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,259 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:40,278 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:40,278 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:40,278 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:06:40,280 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:06:40,280 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:06:40,280 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:40,280 INFO ]: Start difference. First operand 9 states and 21 transitions. Second operand 3 states. [2018-06-26 18:06:40,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:40,354 INFO ]: Finished difference Result 13 states and 29 transitions. [2018-06-26 18:06:40,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:40,355 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:06:40,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:40,355 INFO ]: With dead ends: 13 [2018-06-26 18:06:40,355 INFO ]: Without dead ends: 13 [2018-06-26 18:06:40,356 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-26 18:06:40,356 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:06:40,358 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-26 18:06:40,358 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:06:40,358 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2018-06-26 18:06:40,358 INFO ]: Start accepts. Automaton has 11 states and 26 transitions. Word has length 5 [2018-06-26 18:06:40,358 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:40,358 INFO ]: Abstraction has 11 states and 26 transitions. [2018-06-26 18:06:40,359 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:06:40,359 INFO ]: Start isEmpty. Operand 11 states and 26 transitions. [2018-06-26 18:06:40,359 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:06:40,359 INFO ]: Found error trace [2018-06-26 18:06:40,359 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:06:40,359 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:40,359 INFO ]: Analyzing trace with hash 44207687, now seen corresponding path program 1 times [2018-06-26 18:06:40,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:40,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:40,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:40,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,368 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:40,403 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:40,403 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:40,403 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:06:40,403 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:06:40,403 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:06:40,403 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:40,403 INFO ]: Start difference. First operand 11 states and 26 transitions. Second operand 3 states. [2018-06-26 18:06:40,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:40,412 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-26 18:06:40,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:40,413 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:06:40,413 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:40,413 INFO ]: With dead ends: 12 [2018-06-26 18:06:40,413 INFO ]: Without dead ends: 12 [2018-06-26 18:06:40,414 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-26 18:06:40,414 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:06:40,415 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 18:06:40,415 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:06:40,416 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-26 18:06:40,416 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 5 [2018-06-26 18:06:40,416 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:40,416 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-26 18:06:40,416 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:06:40,416 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-26 18:06:40,416 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:06:40,416 INFO ]: Found error trace [2018-06-26 18:06:40,416 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:06:40,417 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:40,417 INFO ]: Analyzing trace with hash 1367882360, now seen corresponding path program 1 times [2018-06-26 18:06:40,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:40,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:40,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:40,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,430 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:40,558 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:40,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:40,558 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) [2018-06-26 18:06:40,574 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:40,603 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:40,609 INFO ]: Computing forward predicates... [2018-06-26 18:06:40,626 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:40,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:40,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:06:40,647 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:06:40,647 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:06:40,647 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:40,647 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 4 states. [2018-06-26 18:06:40,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:40,725 INFO ]: Finished difference Result 17 states and 39 transitions. [2018-06-26 18:06:40,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:06:40,725 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:06:40,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:40,726 INFO ]: With dead ends: 17 [2018-06-26 18:06:40,726 INFO ]: Without dead ends: 17 [2018-06-26 18:06:40,726 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:40,726 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:06:40,729 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-26 18:06:40,729 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:06:40,729 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-06-26 18:06:40,729 INFO ]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 6 [2018-06-26 18:06:40,729 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:40,729 INFO ]: Abstraction has 13 states and 31 transitions. [2018-06-26 18:06:40,729 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:06:40,729 INFO ]: Start isEmpty. Operand 13 states and 31 transitions. [2018-06-26 18:06:40,730 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:06:40,730 INFO ]: Found error trace [2018-06-26 18:06:40,730 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:06:40,730 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:40,730 INFO ]: Analyzing trace with hash 1368805881, now seen corresponding path program 1 times [2018-06-26 18:06:40,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:40,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:40,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:40,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:40,741 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:40,772 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:40,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:40,772 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:40,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:40,806 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:40,807 INFO ]: Computing forward predicates... [2018-06-26 18:06:40,818 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:40,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:40,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:06:40,850 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:06:40,850 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:06:40,850 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:40,850 INFO ]: Start difference. First operand 13 states and 31 transitions. Second operand 4 states. [2018-06-26 18:06:41,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:41,008 INFO ]: Finished difference Result 14 states and 24 transitions. [2018-06-26 18:06:41,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:41,008 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:06:41,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:41,009 INFO ]: With dead ends: 14 [2018-06-26 18:06:41,009 INFO ]: Without dead ends: 14 [2018-06-26 18:06:41,009 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:06:41,009 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:06:41,011 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-26 18:06:41,011 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:06:41,011 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-26 18:06:41,011 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 6 [2018-06-26 18:06:41,011 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:41,011 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-26 18:06:41,011 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:06:41,011 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-26 18:06:41,012 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:06:41,012 INFO ]: Found error trace [2018-06-26 18:06:41,012 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:06:41,012 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:41,012 INFO ]: Analyzing trace with hash 1368864502, now seen corresponding path program 1 times [2018-06-26 18:06:41,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:41,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:41,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:41,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:41,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:41,023 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:41,131 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:41,131 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:41,131 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:06:41,131 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:06:41,132 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:06:41,132 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:41,132 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 4 states. [2018-06-26 18:06:41,333 WARN ]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-26 18:06:41,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:41,364 INFO ]: Finished difference Result 14 states and 23 transitions. [2018-06-26 18:06:41,364 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:06:41,364 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:06:41,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:41,365 INFO ]: With dead ends: 14 [2018-06-26 18:06:41,365 INFO ]: Without dead ends: 14 [2018-06-26 18:06:41,365 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:06:41,365 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:06:41,367 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-26 18:06:41,367 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:06:41,367 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-26 18:06:41,367 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 6 [2018-06-26 18:06:41,367 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:41,367 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-26 18:06:41,367 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:06:41,367 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-26 18:06:41,368 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:06:41,368 INFO ]: Found error trace [2018-06-26 18:06:41,368 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:06:41,368 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:41,368 INFO ]: Analyzing trace with hash 1369817814, now seen corresponding path program 1 times [2018-06-26 18:06:41,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:41,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:41,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:41,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:41,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:41,387 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:41,406 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:41,406 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:41,406 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:06:41,406 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:06:41,406 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:06:41,406 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:41,406 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 3 states. [2018-06-26 18:06:41,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:41,422 INFO ]: Finished difference Result 12 states and 19 transitions. [2018-06-26 18:06:41,423 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:41,423 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:06:41,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:41,423 INFO ]: With dead ends: 12 [2018-06-26 18:06:41,423 INFO ]: Without dead ends: 11 [2018-06-26 18:06:41,423 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-26 18:06:41,423 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:06:41,424 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:06:41,424 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:06:41,425 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-26 18:06:41,425 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 6 [2018-06-26 18:06:41,425 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:41,425 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-26 18:06:41,425 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:06:41,425 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-26 18:06:41,425 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:06:41,425 INFO ]: Found error trace [2018-06-26 18:06:41,425 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:41,425 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:41,425 INFO ]: Analyzing trace with hash -517370714, now seen corresponding path program 1 times [2018-06-26 18:06:41,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:41,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:41,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:41,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:41,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:41,443 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:41,559 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:41,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:41,559 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:41,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:41,577 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:41,579 INFO ]: Computing forward predicates... [2018-06-26 18:06:41,796 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:41,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:41,816 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 18:06:41,816 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:06:41,816 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:06:41,816 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:06:41,816 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 8 states. [2018-06-26 18:06:42,247 WARN ]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-26 18:06:42,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:42,282 INFO ]: Finished difference Result 15 states and 25 transitions. [2018-06-26 18:06:42,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:06:42,282 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 18:06:42,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:42,283 INFO ]: With dead ends: 15 [2018-06-26 18:06:42,283 INFO ]: Without dead ends: 15 [2018-06-26 18:06:42,283 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:06:42,283 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:06:42,284 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-26 18:06:42,284 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:06:42,284 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-26 18:06:42,284 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 7 [2018-06-26 18:06:42,284 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:42,284 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-26 18:06:42,284 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:06:42,284 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-26 18:06:42,284 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:06:42,284 INFO ]: Found error trace [2018-06-26 18:06:42,284 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:42,284 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:42,285 INFO ]: Analyzing trace with hash -515493881, now seen corresponding path program 1 times [2018-06-26 18:06:42,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:42,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:42,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:42,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:42,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:42,298 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:42,327 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:42,327 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:42,327 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:06:42,327 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:06:42,328 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:06:42,328 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:42,328 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 4 states. [2018-06-26 18:06:42,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:42,339 INFO ]: Finished difference Result 11 states and 16 transitions. [2018-06-26 18:06:42,340 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:06:42,340 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 18:06:42,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:42,340 INFO ]: With dead ends: 11 [2018-06-26 18:06:42,340 INFO ]: Without dead ends: 10 [2018-06-26 18:06:42,340 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:06:42,340 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:06:42,341 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 18:06:42,341 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:06:42,342 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-26 18:06:42,342 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-26 18:06:42,342 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:42,342 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-26 18:06:42,342 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:06:42,342 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-26 18:06:42,342 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:06:42,342 INFO ]: Found error trace [2018-06-26 18:06:42,342 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:42,342 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:42,342 INFO ]: Analyzing trace with hash 251376053, now seen corresponding path program 1 times [2018-06-26 18:06:42,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:42,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:42,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:42,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:42,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:42,363 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:42,468 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:42,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:42,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:42,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:42,506 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:42,508 INFO ]: Computing forward predicates... [2018-06-26 18:06:42,520 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:42,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:42,555 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:06:42,556 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:06:42,556 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:06:42,556 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:06:42,556 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-26 18:06:42,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:42,682 INFO ]: Finished difference Result 11 states and 17 transitions. [2018-06-26 18:06:42,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:06:42,682 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 18:06:42,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:42,682 INFO ]: With dead ends: 11 [2018-06-26 18:06:42,682 INFO ]: Without dead ends: 11 [2018-06-26 18:06:42,683 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:06:42,683 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:06:42,684 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:06:42,684 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:06:42,684 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-26 18:06:42,684 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-26 18:06:42,684 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:42,684 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-26 18:06:42,684 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:06:42,684 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-26 18:06:42,685 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:06:42,685 INFO ]: Found error trace [2018-06-26 18:06:42,685 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:42,685 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:42,685 INFO ]: Analyzing trace with hash -799774265, now seen corresponding path program 2 times [2018-06-26 18:06:42,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:42,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:42,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:42,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:42,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:42,697 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:42,759 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:42,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:42,759 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:42,765 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:06:42,780 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:06:42,780 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:42,781 INFO ]: Computing forward predicates... [2018-06-26 18:06:42,786 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:42,809 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:42,809 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 18:06:42,809 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:06:42,810 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:06:42,810 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:06:42,810 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 6 states. [2018-06-26 18:06:42,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:42,830 INFO ]: Finished difference Result 12 states and 19 transitions. [2018-06-26 18:06:42,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:06:42,831 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 18:06:42,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:42,831 INFO ]: With dead ends: 12 [2018-06-26 18:06:42,831 INFO ]: Without dead ends: 12 [2018-06-26 18:06:42,831 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:06:42,831 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:06:42,833 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 18:06:42,833 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:06:42,833 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-26 18:06:42,833 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-26 18:06:42,833 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:42,833 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-26 18:06:42,833 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:06:42,834 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-26 18:06:42,834 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:06:42,834 INFO ]: Found error trace [2018-06-26 18:06:42,834 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:42,834 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:42,834 INFO ]: Analyzing trace with hash 974304245, now seen corresponding path program 3 times [2018-06-26 18:06:42,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:42,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:42,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:42,835 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:42,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:42,857 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:42,934 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:42,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:42,934 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:42,942 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:06:42,967 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:06:42,967 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:42,968 INFO ]: Computing forward predicates... [2018-06-26 18:06:43,043 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:43,063 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:43,063 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-26 18:06:43,063 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:06:43,063 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:06:43,064 INFO ]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:06:43,064 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 13 states. [2018-06-26 18:06:43,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:43,382 INFO ]: Finished difference Result 28 states and 51 transitions. [2018-06-26 18:06:43,382 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:06:43,382 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-26 18:06:43,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:43,383 INFO ]: With dead ends: 28 [2018-06-26 18:06:43,383 INFO ]: Without dead ends: 28 [2018-06-26 18:06:43,383 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=503, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:06:43,383 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:06:43,385 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 13. [2018-06-26 18:06:43,385 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:06:43,385 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-26 18:06:43,386 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-26 18:06:43,386 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:43,386 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-26 18:06:43,386 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:06:43,386 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-26 18:06:43,386 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:06:43,386 INFO ]: Found error trace [2018-06-26 18:06:43,386 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:43,386 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:43,386 INFO ]: Analyzing trace with hash 136163207, now seen corresponding path program 4 times [2018-06-26 18:06:43,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:43,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:43,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:43,389 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:43,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:43,400 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:43,482 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:43,482 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:43,482 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:43,493 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:06:43,513 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:06:43,513 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:43,515 INFO ]: Computing forward predicates... [2018-06-26 18:06:43,578 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:43,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:43,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-26 18:06:43,598 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:06:43,599 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:06:43,599 INFO ]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:06:43,599 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 15 states. [2018-06-26 18:06:44,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:44,202 INFO ]: Finished difference Result 35 states and 65 transitions. [2018-06-26 18:06:44,203 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 18:06:44,203 INFO ]: Start accepts. Automaton has 15 states. Word has length 11 [2018-06-26 18:06:44,203 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:44,204 INFO ]: With dead ends: 35 [2018-06-26 18:06:44,204 INFO ]: Without dead ends: 35 [2018-06-26 18:06:44,204 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=839, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:06:44,205 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:06:44,206 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 14. [2018-06-26 18:06:44,206 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:06:44,207 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2018-06-26 18:06:44,207 INFO ]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 11 [2018-06-26 18:06:44,207 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:44,207 INFO ]: Abstraction has 14 states and 23 transitions. [2018-06-26 18:06:44,207 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:06:44,207 INFO ]: Start isEmpty. Operand 14 states and 23 transitions. [2018-06-26 18:06:44,207 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:06:44,207 INFO ]: Found error trace [2018-06-26 18:06:44,207 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:44,208 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:44,208 INFO ]: Analyzing trace with hash -76405195, now seen corresponding path program 5 times [2018-06-26 18:06:44,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:44,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:44,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:44,208 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:44,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:44,221 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:44,402 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:44,402 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:44,402 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:44,408 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:06:44,459 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:06:44,459 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:44,461 INFO ]: Computing forward predicates... [2018-06-26 18:06:44,654 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:44,672 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:44,672 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-26 18:06:44,673 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:06:44,673 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:06:44,673 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:06:44,673 INFO ]: Start difference. First operand 14 states and 23 transitions. Second operand 17 states. [2018-06-26 18:06:45,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:45,088 INFO ]: Finished difference Result 43 states and 81 transitions. [2018-06-26 18:06:45,088 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 18:06:45,088 INFO ]: Start accepts. Automaton has 17 states. Word has length 12 [2018-06-26 18:06:45,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:45,089 INFO ]: With dead ends: 43 [2018-06-26 18:06:45,089 INFO ]: Without dead ends: 43 [2018-06-26 18:06:45,090 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=661, Invalid=1319, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 18:06:45,090 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 18:06:45,092 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 15. [2018-06-26 18:06:45,092 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 18:06:45,093 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2018-06-26 18:06:45,093 INFO ]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 12 [2018-06-26 18:06:45,093 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:45,093 INFO ]: Abstraction has 15 states and 25 transitions. [2018-06-26 18:06:45,093 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:06:45,093 INFO ]: Start isEmpty. Operand 15 states and 25 transitions. [2018-06-26 18:06:45,093 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:06:45,093 INFO ]: Found error trace [2018-06-26 18:06:45,093 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:45,093 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:45,093 INFO ]: Analyzing trace with hash 1923908935, now seen corresponding path program 6 times [2018-06-26 18:06:45,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:45,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:45,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:45,094 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:45,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:45,107 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:45,216 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:45,216 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:45,216 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:45,222 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:06:45,244 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 18:06:45,244 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:45,245 INFO ]: Computing forward predicates... [2018-06-26 18:06:45,374 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:45,393 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:45,393 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-26 18:06:45,393 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:06:45,393 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:06:45,393 INFO ]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:06:45,394 INFO ]: Start difference. First operand 15 states and 25 transitions. Second operand 19 states. [2018-06-26 18:06:45,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:45,933 INFO ]: Finished difference Result 52 states and 99 transitions. [2018-06-26 18:06:45,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 18:06:45,934 INFO ]: Start accepts. Automaton has 19 states. Word has length 13 [2018-06-26 18:06:45,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:45,934 INFO ]: With dead ends: 52 [2018-06-26 18:06:45,934 INFO ]: Without dead ends: 52 [2018-06-26 18:06:45,935 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=991, Invalid=1979, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 18:06:45,935 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-26 18:06:45,937 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 16. [2018-06-26 18:06:45,937 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:06:45,938 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-26 18:06:45,938 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 13 [2018-06-26 18:06:45,938 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:45,938 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-26 18:06:45,938 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:06:45,938 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-26 18:06:45,938 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:06:45,938 INFO ]: Found error trace [2018-06-26 18:06:45,938 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:45,938 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:45,938 INFO ]: Analyzing trace with hash -490862475, now seen corresponding path program 7 times [2018-06-26 18:06:45,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:45,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:45,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:45,939 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:45,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:45,957 INFO ]: Conjunction of SSA is sat [2018-06-26 18:06:45,960 INFO ]: Counterexample might be feasible [2018-06-26 18:06:45,974 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:06:45,975 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:06:45 BasicIcfg [2018-06-26 18:06:45,975 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:06:45,976 INFO ]: Toolchain (without parser) took 6693.07 ms. Allocated memory was 304.6 MB in the beginning and 377.5 MB in the end (delta: 72.9 MB). Free memory was 259.1 MB in the beginning and 309.0 MB in the end (delta: -49.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:45,977 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 304.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:06:45,977 INFO ]: ChcToBoogie took 56.40 ms. Allocated memory is still 304.6 MB. Free memory was 259.1 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:45,977 INFO ]: Boogie Preprocessor took 48.01 ms. Allocated memory is still 304.6 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:45,978 INFO ]: RCFGBuilder took 374.42 ms. Allocated memory is still 304.6 MB. Free memory was 255.2 MB in the beginning and 245.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:45,978 INFO ]: BlockEncodingV2 took 105.49 ms. Allocated memory is still 304.6 MB. Free memory was 245.2 MB in the beginning and 241.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:45,979 INFO ]: TraceAbstraction took 6099.01 ms. Allocated memory was 304.6 MB in the beginning and 377.5 MB in the end (delta: 72.9 MB). Free memory was 241.2 MB in the beginning and 309.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 5.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:45,982 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 24 edges - StatisticsResult: Encoded RCFG 8 locations, 17 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 304.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.40 ms. Allocated memory is still 304.6 MB. Free memory was 259.1 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.01 ms. Allocated memory is still 304.6 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 374.42 ms. Allocated memory is still 304.6 MB. Free memory was 255.2 MB in the beginning and 245.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 105.49 ms. Allocated memory is still 304.6 MB. Free memory was 245.2 MB in the beginning and 241.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6099.01 ms. Allocated memory was 304.6 MB in the beginning and 377.5 MB in the end (delta: 72.9 MB). Free memory was 241.2 MB in the beginning and 309.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 5.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0); [L0] assume (((((hbv_False_1_Int + -1 == hbv_False_3_Int && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_2_Int + -10 == 0) && !(hbv_False_2_Int <= 1)) && !(hbv_False_1_Int + hbv_False_4_Int + -10 == 0)) && !(hbv_False_1_Int <= 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int; [L0] havoc hbv_False_5_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_6_Int, hbv_False_2_Int, hbv_False_4_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume (((hhv_REC_f_f_3_Int == hhv_REC_f_f_2_Int && hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hhv_REC_f_f_2_Int <= 1; [L0] hhv_REC_f__0_Int, hhv_REC_f__1_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. UNSAFE Result, 6.0s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 143 SDtfs, 38 SDslu, 324 SDs, 0 SdLazy, 397 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=15, 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, 15 MinimizatonAttempts, 119 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 3522 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1018 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 2/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-06-45-994.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-06-45-994.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-06-45-994.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-06-45-994.csv Received shutdown request...