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/003c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:55:54,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:55:54,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:55:54,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:55:54,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:55:54,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:55:54,909 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:55:54,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:55:54,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:55:54,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:55:54,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:55:54,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:55:54,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:55:54,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:55:54,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:55:54,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:55:54,926 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:55:54,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:55:54,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:55:54,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:55:54,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:55:54,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:55:54,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:55:54,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:55:54,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:55:54,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:55:54,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:55:54,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:55:54,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:55:54,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:55:54,956 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:55:54,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:55:54,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:55:54,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:55:54,958 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:55:54,958 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:55:54,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:55:54,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:55:54,973 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:55:54,973 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:55:54,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:55:54,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:55:54,974 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:55:54,974 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:55:54,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:55:54,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:55:54,975 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:55:54,975 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:55:54,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:55:54,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:55:54,976 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:55:54,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:55:54,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:55:54,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:55:54,977 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:55:54,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:55:54,977 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:55:54,979 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:55:54,980 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:55:55,032 INFO ]: Repository-Root is: /tmp [2018-06-24 20:55:55,044 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:55:55,051 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:55:55,052 INFO ]: Initializing SmtParser... [2018-06-24 20:55:55,052 INFO ]: SmtParser initialized [2018-06-24 20:55:55,053 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 [2018-06-24 20:55:55,054 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-24 20:55:55,147 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 unknown [2018-06-24 20:55:55,424 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 [2018-06-24 20:55:55,433 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:55:55,439 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:55:55,439 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:55:55,439 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:55:55,439 INFO ]: ChcToBoogie initialized [2018-06-24 20:55:55,442 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,503 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55 Unit [2018-06-24 20:55:55,503 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:55:55,503 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:55:55,503 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:55:55,503 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:55:55,526 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,526 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,533 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,534 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,538 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,540 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,549 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,551 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:55:55,552 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:55:55,552 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:55:55,552 INFO ]: RCFGBuilder initialized [2018-06-24 20:55:55,560 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:55:55,572 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:55:55,572 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:55:55,572 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:55:55,573 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:55:55,573 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:55:55,573 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:55:55,853 INFO ]: Using library mode [2018-06-24 20:55:55,854 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:55:55 BoogieIcfgContainer [2018-06-24 20:55:55,854 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:55:55,854 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:55:55,854 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:55:55,855 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:55:55,856 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:55:55" (1/1) ... [2018-06-24 20:55:55,881 INFO ]: Initial Icfg 10 locations, 14 edges [2018-06-24 20:55:55,882 INFO ]: Using Remove infeasible edges [2018-06-24 20:55:55,882 INFO ]: Using Maximize final states [2018-06-24 20:55:55,883 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:55:55,883 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:55:55,884 INFO ]: Using Remove sink states [2018-06-24 20:55:55,885 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:55:55,885 INFO ]: Using Use SBE [2018-06-24 20:55:55,890 INFO ]: SBE split 0 edges [2018-06-24 20:55:55,896 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:55:55,898 INFO ]: 0 new accepting states [2018-06-24 20:55:55,933 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 20:55:55,935 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:55:55,938 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:55:55,938 INFO ]: 0 new accepting states [2018-06-24 20:55:55,938 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:55:55,939 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:55:55,939 INFO ]: Encoded RCFG 6 locations, 10 edges [2018-06-24 20:55:55,940 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:55:55 BasicIcfg [2018-06-24 20:55:55,940 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:55:55,941 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:55:55,941 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:55:55,944 INFO ]: TraceAbstraction initialized [2018-06-24 20:55:55,944 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:55:55" (1/4) ... [2018-06-24 20:55:55,945 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65304c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:55:55, skipping insertion in model container [2018-06-24 20:55:55,945 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:55:55" (2/4) ... [2018-06-24 20:55:55,945 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65304c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:55:55, skipping insertion in model container [2018-06-24 20:55:55,945 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:55:55" (3/4) ... [2018-06-24 20:55:55,946 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65304c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:55:55, skipping insertion in model container [2018-06-24 20:55:55,946 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:55:55" (4/4) ... [2018-06-24 20:55:55,947 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:55:55,958 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:55:55,966 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:55:56,004 INFO ]: Using default assertion order modulation [2018-06-24 20:55:56,005 INFO ]: Interprodecural is true [2018-06-24 20:55:56,005 INFO ]: Hoare is false [2018-06-24 20:55:56,005 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:55:56,005 INFO ]: Backedges is TWOTRACK [2018-06-24 20:55:56,005 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:55:56,005 INFO ]: Difference is false [2018-06-24 20:55:56,005 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:55:56,005 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:55:56,014 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 20:55:56,022 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:55:56,022 INFO ]: Found error trace [2018-06-24 20:55:56,023 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:55:56,023 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:56,028 INFO ]: Analyzing trace with hash 39219782, now seen corresponding path program 1 times [2018-06-24 20:55:56,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:56,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:56,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:56,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:56,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:56,110 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:56,187 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:56,189 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:55:56,189 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:55:56,190 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:55:56,202 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:55:56,203 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:55:56,204 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 20:55:56,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:56,339 INFO ]: Finished difference Result 7 states and 15 transitions. [2018-06-24 20:55:56,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:55:56,342 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:55:56,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:56,352 INFO ]: With dead ends: 7 [2018-06-24 20:55:56,352 INFO ]: Without dead ends: 7 [2018-06-24 20:55:56,353 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-24 20:55:56,371 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:55:56,400 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:55:56,401 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:55:56,402 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-06-24 20:55:56,403 INFO ]: Start accepts. Automaton has 7 states and 15 transitions. Word has length 5 [2018-06-24 20:55:56,407 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:56,408 INFO ]: Abstraction has 7 states and 15 transitions. [2018-06-24 20:55:56,408 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:55:56,408 INFO ]: Start isEmpty. Operand 7 states and 15 transitions. [2018-06-24 20:55:56,408 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:55:56,408 INFO ]: Found error trace [2018-06-24 20:55:56,408 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:55:56,408 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:56,408 INFO ]: Analyzing trace with hash 1215428044, now seen corresponding path program 1 times [2018-06-24 20:55:56,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:56,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:56,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:56,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:56,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:56,452 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:56,733 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:56,733 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:56,733 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-24 20:55:56,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:56,788 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:56,798 INFO ]: Computing forward predicates... [2018-06-24 20:55:56,844 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:56,864 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:56,864 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:55:56,865 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:55:56,865 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:55:56,865 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:55:56,865 INFO ]: Start difference. First operand 7 states and 15 transitions. Second operand 5 states. [2018-06-24 20:55:57,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:57,083 INFO ]: Finished difference Result 8 states and 20 transitions. [2018-06-24 20:55:57,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:55:57,085 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:55:57,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:57,085 INFO ]: With dead ends: 8 [2018-06-24 20:55:57,085 INFO ]: Without dead ends: 8 [2018-06-24 20:55:57,086 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:55:57,086 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:55:57,087 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:55:57,088 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:55:57,088 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-06-24 20:55:57,088 INFO ]: Start accepts. Automaton has 8 states and 20 transitions. Word has length 6 [2018-06-24 20:55:57,088 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:57,088 INFO ]: Abstraction has 8 states and 20 transitions. [2018-06-24 20:55:57,088 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:55:57,088 INFO ]: Start isEmpty. Operand 8 states and 20 transitions. [2018-06-24 20:55:57,088 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:55:57,088 INFO ]: Found error trace [2018-06-24 20:55:57,089 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:55:57,090 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:57,090 INFO ]: Analyzing trace with hash 1215457835, now seen corresponding path program 1 times [2018-06-24 20:55:57,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:57,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:57,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:57,091 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:57,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:57,119 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:57,208 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:57,208 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:55:57,208 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:55:57,208 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:55:57,208 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:55:57,208 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:55:57,208 INFO ]: Start difference. First operand 8 states and 20 transitions. Second operand 3 states. [2018-06-24 20:55:57,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:57,411 INFO ]: Finished difference Result 9 states and 24 transitions. [2018-06-24 20:55:57,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:55:57,412 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:55:57,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:57,412 INFO ]: With dead ends: 9 [2018-06-24 20:55:57,412 INFO ]: Without dead ends: 8 [2018-06-24 20:55:57,412 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-24 20:55:57,413 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:55:57,414 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:55:57,414 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:55:57,414 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-24 20:55:57,414 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 6 [2018-06-24 20:55:57,414 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:57,414 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-24 20:55:57,414 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:55:57,414 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-24 20:55:57,415 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:55:57,415 INFO ]: Found error trace [2018-06-24 20:55:57,415 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:55:57,415 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:57,415 INFO ]: Analyzing trace with hash 1215487626, now seen corresponding path program 1 times [2018-06-24 20:55:57,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:57,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:57,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:57,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:57,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:57,427 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:57,493 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:57,493 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:55:57,493 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:55:57,493 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:55:57,493 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:55:57,493 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:55:57,493 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 3 states. [2018-06-24 20:55:57,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:57,521 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-24 20:55:57,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:55:57,522 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:55:57,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:57,522 INFO ]: With dead ends: 9 [2018-06-24 20:55:57,522 INFO ]: Without dead ends: 8 [2018-06-24 20:55:57,522 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-24 20:55:57,523 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:55:57,524 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:55:57,524 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:55:57,524 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-24 20:55:57,524 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-24 20:55:57,524 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:57,524 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-24 20:55:57,524 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:55:57,524 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-24 20:55:57,525 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:55:57,525 INFO ]: Found error trace [2018-06-24 20:55:57,525 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:55:57,525 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:57,525 INFO ]: Analyzing trace with hash -976821498, now seen corresponding path program 2 times [2018-06-24 20:55:57,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:57,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:57,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:57,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:57,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:57,559 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:57,864 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:57,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:57,864 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-24 20:55:57,870 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:57,930 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:57,930 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:57,933 INFO ]: Computing forward predicates... [2018-06-24 20:55:58,215 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:58,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:58,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 20:55:58,237 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:55:58,237 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:55:58,237 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:55:58,237 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 7 states. [2018-06-24 20:55:58,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:58,507 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-24 20:55:58,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:55:58,507 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:55:58,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:58,508 INFO ]: With dead ends: 10 [2018-06-24 20:55:58,508 INFO ]: Without dead ends: 10 [2018-06-24 20:55:58,508 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:55:58,508 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:55:58,509 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:55:58,509 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:55:58,509 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 20:55:58,509 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-24 20:55:58,510 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:58,510 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 20:55:58,510 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:55:58,510 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 20:55:58,510 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:55:58,510 INFO ]: Found error trace [2018-06-24 20:55:58,510 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:58,510 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:58,510 INFO ]: Analyzing trace with hash -976732125, now seen corresponding path program 1 times [2018-06-24 20:55:58,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:58,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:58,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:58,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:58,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:58,529 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:58,559 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:55:58,559 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:55:58,559 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:55:58,559 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:55:58,559 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:55:58,559 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:55:58,559 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 3 states. [2018-06-24 20:55:58,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:58,569 INFO ]: Finished difference Result 12 states and 19 transitions. [2018-06-24 20:55:58,570 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:55:58,570 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 20:55:58,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:58,570 INFO ]: With dead ends: 12 [2018-06-24 20:55:58,570 INFO ]: Without dead ends: 12 [2018-06-24 20:55:58,571 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-24 20:55:58,571 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:55:58,571 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 20:55:58,572 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:55:58,572 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 20:55:58,572 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-24 20:55:58,572 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:58,572 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 20:55:58,572 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:55:58,572 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 20:55:58,572 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:55:58,572 INFO ]: Found error trace [2018-06-24 20:55:58,572 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:58,572 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:58,573 INFO ]: Analyzing trace with hash -214310001, now seen corresponding path program 2 times [2018-06-24 20:55:58,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:58,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:58,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:58,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:58,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:58,588 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:58,644 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:55:58,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:58,644 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-24 20:55:58,653 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:58,716 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:58,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:58,719 INFO ]: Computing forward predicates... [2018-06-24 20:55:59,233 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:59,269 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:59,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-06-24 20:55:59,270 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:55:59,270 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:55:59,270 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:55:59,270 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 8 states. [2018-06-24 20:55:59,452 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:59,452 INFO ]: Finished difference Result 17 states and 29 transitions. [2018-06-24 20:55:59,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:55:59,454 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-24 20:55:59,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:59,454 INFO ]: With dead ends: 17 [2018-06-24 20:55:59,454 INFO ]: Without dead ends: 17 [2018-06-24 20:55:59,454 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:55:59,455 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:55:59,456 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 10. [2018-06-24 20:55:59,456 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:55:59,457 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 20:55:59,457 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 8 [2018-06-24 20:55:59,457 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:59,457 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 20:55:59,457 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:55:59,457 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 20:55:59,457 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:55:59,457 INFO ]: Found error trace [2018-06-24 20:55:59,457 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 20:55:59,457 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:59,457 INFO ]: Analyzing trace with hash 1860051910, now seen corresponding path program 3 times [2018-06-24 20:55:59,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:59,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:59,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:59,458 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:59,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:59,485 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:59,996 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:59,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:59,996 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-24 20:56:00,002 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:56:00,045 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:56:00,045 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:00,049 INFO ]: Computing forward predicates... [2018-06-24 20:56:00,167 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:00,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:00,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 20:56:00,187 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:56:00,187 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:56:00,187 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:56:00,187 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 8 states. [2018-06-24 20:56:00,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:00,256 INFO ]: Finished difference Result 14 states and 23 transitions. [2018-06-24 20:56:00,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:56:00,257 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 20:56:00,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:00,257 INFO ]: With dead ends: 14 [2018-06-24 20:56:00,257 INFO ]: Without dead ends: 14 [2018-06-24 20:56:00,257 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:56:00,257 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:56:00,259 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-24 20:56:00,259 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:56:00,259 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-24 20:56:00,259 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-24 20:56:00,259 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:00,259 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-24 20:56:00,259 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:56:00,259 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-24 20:56:00,259 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:56:00,259 INFO ]: Found error trace [2018-06-24 20:56:00,260 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:00,260 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:00,260 INFO ]: Analyzing trace with hash 1945939363, now seen corresponding path program 3 times [2018-06-24 20:56:00,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:00,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:00,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:00,261 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:00,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:00,275 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:00,329 INFO ]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:00,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:00,329 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-24 20:56:00,342 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:56:00,374 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:56:00,374 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:00,377 INFO ]: Computing forward predicates... [2018-06-24 20:56:00,467 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:00,487 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:00,487 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-24 20:56:00,487 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:56:00,487 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:56:00,487 INFO ]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:56:00,487 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 10 states. [2018-06-24 20:56:00,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:00,672 INFO ]: Finished difference Result 24 states and 43 transitions. [2018-06-24 20:56:00,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:56:00,672 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-24 20:56:00,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:00,673 INFO ]: With dead ends: 24 [2018-06-24 20:56:00,673 INFO ]: Without dead ends: 24 [2018-06-24 20:56:00,673 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:56:00,673 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:56:00,675 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 12. [2018-06-24 20:56:00,675 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:56:00,675 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-24 20:56:00,676 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-24 20:56:00,676 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:00,676 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-24 20:56:00,676 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:56:00,676 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-24 20:56:00,676 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:56:00,676 INFO ]: Found error trace [2018-06-24 20:56:00,676 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:00,676 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:00,676 INFO ]: Analyzing trace with hash 194192911, now seen corresponding path program 4 times [2018-06-24 20:56:00,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:00,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:00,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:00,677 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:00,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:00,692 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:00,780 INFO ]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:00,780 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:00,780 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-24 20:56:00,788 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:56:00,837 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:56:00,837 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:00,839 INFO ]: Computing forward predicates... [2018-06-24 20:56:00,844 INFO ]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:00,864 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:00,864 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:56:00,864 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:56:00,864 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:56:00,864 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:56:00,865 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 6 states. [2018-06-24 20:56:00,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:00,885 INFO ]: Finished difference Result 20 states and 35 transitions. [2018-06-24 20:56:00,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:56:00,885 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:56:00,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:00,886 INFO ]: With dead ends: 20 [2018-06-24 20:56:00,886 INFO ]: Without dead ends: 20 [2018-06-24 20:56:00,886 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 11 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-24 20:56:00,886 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:56:00,887 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-06-24 20:56:00,888 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:56:00,888 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-24 20:56:00,888 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 10 [2018-06-24 20:56:00,888 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:00,888 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-24 20:56:00,888 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:56:00,888 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-24 20:56:00,888 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:56:00,888 INFO ]: Found error trace [2018-06-24 20:56:00,888 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 20:56:00,888 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:00,889 INFO ]: Analyzing trace with hash 791164038, now seen corresponding path program 4 times [2018-06-24 20:56:00,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:00,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:00,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:00,889 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:00,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:00,913 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:01,140 INFO ]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:56:01,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:01,141 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-24 20:56:01,149 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:56:01,186 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:56:01,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:01,190 INFO ]: Computing forward predicates... [2018-06-24 20:56:01,495 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:01,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:01,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 11 [2018-06-24 20:56:01,523 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:56:01,523 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:56:01,523 INFO ]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:56:01,523 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 11 states. [2018-06-24 20:56:01,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:01,696 INFO ]: Finished difference Result 18 states and 31 transitions. [2018-06-24 20:56:01,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:56:01,697 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-24 20:56:01,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:01,698 INFO ]: With dead ends: 18 [2018-06-24 20:56:01,698 INFO ]: Without dead ends: 18 [2018-06-24 20:56:01,698 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:56:01,698 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:56:01,700 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-06-24 20:56:01,700 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:56:01,700 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-24 20:56:01,700 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 11 [2018-06-24 20:56:01,700 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:01,700 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-24 20:56:01,700 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:56:01,700 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-24 20:56:01,700 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:56:01,700 INFO ]: Found error trace [2018-06-24 20:56:01,700 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:01,700 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:01,701 INFO ]: Analyzing trace with hash 1724627747, now seen corresponding path program 5 times [2018-06-24 20:56:01,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:01,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:01,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:01,701 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:01,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:01,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:01,839 INFO ]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:01,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:01,839 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-24 20:56:01,845 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:56:01,906 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:56:01,906 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:01,909 INFO ]: Computing forward predicates... [2018-06-24 20:56:01,914 INFO ]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:01,947 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:01,947 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:56:01,947 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:56:01,947 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:56:01,947 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:56:01,947 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 7 states. [2018-06-24 20:56:01,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:01,989 INFO ]: Finished difference Result 18 states and 31 transitions. [2018-06-24 20:56:01,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:56:01,992 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-24 20:56:01,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:01,992 INFO ]: With dead ends: 18 [2018-06-24 20:56:01,992 INFO ]: Without dead ends: 18 [2018-06-24 20:56:01,993 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:56:01,993 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:56:01,994 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-24 20:56:01,994 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:56:01,994 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 20:56:01,994 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 11 [2018-06-24 20:56:01,994 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:01,994 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 20:56:01,994 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:56:01,994 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 20:56:01,995 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:56:01,995 INFO ]: Found error trace [2018-06-24 20:56:01,995 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:01,995 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:01,995 INFO ]: Analyzing trace with hash 1923467407, now seen corresponding path program 6 times [2018-06-24 20:56:01,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:01,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:01,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:01,996 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:01,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:02,012 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:02,212 INFO ]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:02,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:02,212 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-24 20:56:02,218 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:56:02,302 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:56:02,302 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:02,306 INFO ]: Computing forward predicates... [2018-06-24 20:56:02,527 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:02,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:02,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-24 20:56:02,551 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:56:02,551 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:56:02,552 INFO ]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:56:02,552 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 16 states. [2018-06-24 20:56:03,148 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:03,148 INFO ]: Finished difference Result 42 states and 79 transitions. [2018-06-24 20:56:03,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:56:03,149 INFO ]: Start accepts. Automaton has 16 states. Word has length 12 [2018-06-24 20:56:03,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:03,149 INFO ]: With dead ends: 42 [2018-06-24 20:56:03,149 INFO ]: Without dead ends: 42 [2018-06-24 20:56:03,150 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=432, Invalid=974, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:56:03,150 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:56:03,153 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 14. [2018-06-24 20:56:03,153 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:56:03,153 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2018-06-24 20:56:03,153 INFO ]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 12 [2018-06-24 20:56:03,153 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:03,153 INFO ]: Abstraction has 14 states and 23 transitions. [2018-06-24 20:56:03,153 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:56:03,153 INFO ]: Start isEmpty. Operand 14 states and 23 transitions. [2018-06-24 20:56:03,154 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:56:03,154 INFO ]: Found error trace [2018-06-24 20:56:03,154 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:03,154 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:03,154 INFO ]: Analyzing trace with hash -502437725, now seen corresponding path program 7 times [2018-06-24 20:56:03,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:03,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:03,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:03,155 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:03,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:03,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:03,358 INFO ]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:03,358 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:03,358 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:03,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:03,410 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:03,413 INFO ]: Computing forward predicates... [2018-06-24 20:56:03,419 INFO ]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:03,439 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:03,439 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:56:03,439 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:56:03,439 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:56:03,439 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:56:03,439 INFO ]: Start difference. First operand 14 states and 23 transitions. Second operand 9 states. [2018-06-24 20:56:03,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:03,494 INFO ]: Finished difference Result 22 states and 39 transitions. [2018-06-24 20:56:03,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:56:03,494 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-24 20:56:03,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:03,495 INFO ]: With dead ends: 22 [2018-06-24 20:56:03,495 INFO ]: Without dead ends: 22 [2018-06-24 20:56:03,495 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:56:03,495 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:56:03,496 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-24 20:56:03,496 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:56:03,497 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2018-06-24 20:56:03,497 INFO ]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 13 [2018-06-24 20:56:03,497 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:03,497 INFO ]: Abstraction has 15 states and 25 transitions. [2018-06-24 20:56:03,497 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:56:03,497 INFO ]: Start isEmpty. Operand 15 states and 25 transitions. [2018-06-24 20:56:03,497 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:56:03,497 INFO ]: Found error trace [2018-06-24 20:56:03,497 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:03,497 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:03,498 INFO ]: Analyzing trace with hash 1603914511, now seen corresponding path program 8 times [2018-06-24 20:56:03,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:03,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:03,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:03,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:03,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:03,513 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:04,306 INFO ]: Checked inductivity of 45 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:04,306 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:04,306 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:04,312 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:56:04,374 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:56:04,374 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:04,378 INFO ]: Computing forward predicates... [2018-06-24 20:56:04,521 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:04,541 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:04,541 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-24 20:56:04,541 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:56:04,542 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:56:04,542 INFO ]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:56:04,542 INFO ]: Start difference. First operand 15 states and 25 transitions. Second operand 20 states. [2018-06-24 20:56:05,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:05,166 INFO ]: Finished difference Result 61 states and 117 transitions. [2018-06-24 20:56:05,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-24 20:56:05,166 INFO ]: Start accepts. Automaton has 20 states. Word has length 14 [2018-06-24 20:56:05,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:05,167 INFO ]: With dead ends: 61 [2018-06-24 20:56:05,167 INFO ]: Without dead ends: 61 [2018-06-24 20:56:05,168 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1004, Invalid=2188, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:56:05,169 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:56:05,171 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 16. [2018-06-24 20:56:05,171 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:56:05,171 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-24 20:56:05,172 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 14 [2018-06-24 20:56:05,172 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:05,172 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-24 20:56:05,172 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:56:05,172 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-24 20:56:05,172 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:56:05,172 INFO ]: Found error trace [2018-06-24 20:56:05,172 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:05,172 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:05,172 INFO ]: Analyzing trace with hash -1818642909, now seen corresponding path program 9 times [2018-06-24 20:56:05,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:05,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:05,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:05,173 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:05,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:05,190 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:05,304 INFO ]: Checked inductivity of 55 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:05,304 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:05,304 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:05,312 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:56:05,364 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:56:05,364 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:05,368 INFO ]: Computing forward predicates... [2018-06-24 20:56:05,938 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:05,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:05,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-06-24 20:56:05,959 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:56:05,959 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:56:05,959 INFO ]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:56:05,959 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 22 states. [2018-06-24 20:56:06,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:06,988 INFO ]: Finished difference Result 72 states and 139 transitions. [2018-06-24 20:56:06,988 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-24 20:56:06,988 INFO ]: Start accepts. Automaton has 22 states. Word has length 15 [2018-06-24 20:56:06,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:06,989 INFO ]: With dead ends: 72 [2018-06-24 20:56:06,989 INFO ]: Without dead ends: 72 [2018-06-24 20:56:06,990 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1445, Invalid=3111, Unknown=0, NotChecked=0, Total=4556 [2018-06-24 20:56:06,991 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-24 20:56:06,993 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 17. [2018-06-24 20:56:06,993 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:56:06,993 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-06-24 20:56:06,993 INFO ]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 15 [2018-06-24 20:56:06,994 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:06,994 INFO ]: Abstraction has 17 states and 29 transitions. [2018-06-24 20:56:06,994 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:56:06,994 INFO ]: Start isEmpty. Operand 17 states and 29 transitions. [2018-06-24 20:56:06,994 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:56:06,994 INFO ]: Found error trace [2018-06-24 20:56:06,994 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:06,994 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:06,994 INFO ]: Analyzing trace with hash -543740529, now seen corresponding path program 10 times [2018-06-24 20:56:06,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:06,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:06,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:06,995 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:06,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:07,018 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:07,287 INFO ]: Checked inductivity of 66 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:07,287 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:07,287 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:07,293 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:56:07,374 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:56:07,374 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:07,378 INFO ]: Computing forward predicates... [2018-06-24 20:56:07,387 INFO ]: Checked inductivity of 66 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:56:07,419 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:07,419 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:56:07,419 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:56:07,419 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:56:07,419 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:56:07,419 INFO ]: Start difference. First operand 17 states and 29 transitions. Second operand 12 states. [2018-06-24 20:56:07,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:07,447 INFO ]: Finished difference Result 28 states and 51 transitions. [2018-06-24 20:56:07,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:56:07,447 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-24 20:56:07,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:07,448 INFO ]: With dead ends: 28 [2018-06-24 20:56:07,448 INFO ]: Without dead ends: 28 [2018-06-24 20:56:07,448 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:56:07,448 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:56:07,449 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-06-24 20:56:07,450 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:56:07,450 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2018-06-24 20:56:07,450 INFO ]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 16 [2018-06-24 20:56:07,450 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:07,450 INFO ]: Abstraction has 18 states and 31 transitions. [2018-06-24 20:56:07,450 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:56:07,450 INFO ]: Start isEmpty. Operand 18 states and 31 transitions. [2018-06-24 20:56:07,450 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:56:07,450 INFO ]: Found error trace [2018-06-24 20:56:07,450 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:56:07,450 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:07,451 INFO ]: Analyzing trace with hash 323527587, now seen corresponding path program 11 times [2018-06-24 20:56:07,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:07,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:07,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:07,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:07,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:07,495 INFO ]: Conjunction of SSA is sat [2018-06-24 20:56:07,507 INFO ]: Counterexample might be feasible [2018-06-24 20:56:07,531 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:56:07,532 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:56:07 BasicIcfg [2018-06-24 20:56:07,532 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:56:07,533 INFO ]: Toolchain (without parser) took 12100.29 ms. Allocated memory was 300.9 MB in the beginning and 420.5 MB in the end (delta: 119.5 MB). Free memory was 256.3 MB in the beginning and 360.0 MB in the end (delta: -103.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:56:07,535 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 300.9 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:56:07,535 INFO ]: ChcToBoogie took 63.75 ms. Allocated memory is still 300.9 MB. Free memory was 255.3 MB in the beginning and 253.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:56:07,536 INFO ]: Boogie Preprocessor took 47.87 ms. Allocated memory is still 300.9 MB. Free memory was 253.3 MB in the beginning and 252.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:56:07,536 INFO ]: RCFGBuilder took 302.11 ms. Allocated memory is still 300.9 MB. Free memory was 252.3 MB in the beginning and 240.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:56:07,537 INFO ]: BlockEncodingV2 took 85.67 ms. Allocated memory is still 300.9 MB. Free memory was 240.3 MB in the beginning and 237.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:56:07,537 INFO ]: TraceAbstraction took 11591.50 ms. Allocated memory was 300.9 MB in the beginning and 420.5 MB in the end (delta: 119.5 MB). Free memory was 237.3 MB in the beginning and 360.0 MB in the end (delta: -122.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:56:07,545 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 14 edges - StatisticsResult: Encoded RCFG 6 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 300.9 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.75 ms. Allocated memory is still 300.9 MB. Free memory was 255.3 MB in the beginning and 253.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.87 ms. Allocated memory is still 300.9 MB. Free memory was 253.3 MB in the beginning and 252.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 302.11 ms. Allocated memory is still 300.9 MB. Free memory was 252.3 MB in the beginning and 240.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 85.67 ms. Allocated memory is still 300.9 MB. Free memory was 240.3 MB in the beginning and 237.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 11591.50 ms. Allocated memory was 300.9 MB in the beginning and 420.5 MB in the end (delta: 119.5 MB). Free memory was 237.3 MB in the beginning and 360.0 MB in the end (delta: -122.7 MB). There was no memory consumed. 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, 0, 0, 0, 0, 0, 0); [L0] assume (((hbv_False_9_Int == hbv_False_10_Int && hbv_False_5_Int == hbv_False_6_Int) && !(hbv_False_1_Int - hbv_False_2_Int + -1 >= 0)) && !(hbv_False_7_Int == hbv_False_8_Int)) && !(hbv_False_3_Int - hbv_False_4_Int + -1 >= 0); [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hbv_False_3_Int, hbv_False_11_Int, hbv_False_4_Int, hbv_False_12_Int, hbv_False_7_Int, hbv_False_1_Int, hbv_False_13_Int, hbv_False_2_Int, hbv_False_14_Int, hbv_False_8_Int; [L0] havoc hbv_False_9_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_5_Int, hbv_False_8_Int, hbv_False_11_Int, hbv_False_13_Int, hbv_False_14_Int, hbv_False_1_Int, hbv_False_7_Int, hbv_False_12_Int, hbv_False_6_Int, hbv_False_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hhv_INV1_5_Int - hbv_INV1_7_Int + -1 >= 0 && -1 * hhv_INV1_8_Int == -10) && hbv_INV1_3_Int + hbv_INV1_4_Int == hhv_INV1_9_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hbv_INV1_5_Int == hbv_INV1_6_Int) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && hbv_INV1_7_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_7_Int + -10 == 0) && hbv_INV1_8_Int == hbv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_3_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_9_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_7_Int, hbv_INV1_3_Int, hbv_INV1_2_Int, hbv_INV1_5_Int, hbv_INV1_6_Int, hbv_INV1_8_Int, hbv_INV1_10_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 11.5s OverallTime, 18 OverallIterations, 11 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 0 SDslu, 300 SDs, 0 SdLazy, 919 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 107 SyntacticMatches, 11 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2653 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=17, 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, 17 MinimizatonAttempts, 187 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 12963 SizeOfPredicates, 43 NumberOfNonLiveVariables, 3922 ConjunctsInSsa, 511 ConjunctsInUnsatCore, 30 InterpolantComputations, 4 PerfectInterpolantSequences, 188/639 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/003c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-56-07-562.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-56-07-562.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-56-07-562.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-56-07-562.csv Received shutdown request...