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/llreve/cube_square_unsafe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:47:49,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:47:49,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:47:49,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:47:49,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:47:49,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:47:49,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:47:49,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:47:49,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:47:49,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:47:49,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:47:49,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:47:49,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:47:49,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:47:49,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:47:49,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:47:49,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:47:49,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:47:49,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:47:49,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:47:49,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:47:49,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:47:49,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:47:49,852 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:47:49,853 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:47:49,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:47:49,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:47:49,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:47:49,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:47:49,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:47:49,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:47:49,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:47:49,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:47:49,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:47:49,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:47:49,865 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:47:49,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:47:49,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:47:49,882 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:47:49,882 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:47:49,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:47:49,883 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:47:49,883 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:47:49,883 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:47:49,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:47:49,884 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:47:49,884 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:47:49,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:47:49,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:47:49,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:47:49,885 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:47:49,885 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:47:49,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:47:49,886 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:47:49,886 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:47:49,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:47:49,886 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:47:49,888 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:47:49,888 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:47:49,945 INFO ]: Repository-Root is: /tmp [2018-06-24 20:47:49,965 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:47:49,975 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:47:49,976 INFO ]: Initializing SmtParser... [2018-06-24 20:47:49,976 INFO ]: SmtParser initialized [2018-06-24 20:47:49,977 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 [2018-06-24 20:47:49,978 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:47:50,062 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 unknown [2018-06-24 20:47:50,204 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 [2018-06-24 20:47:50,216 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:47:50,221 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:47:50,222 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:47:50,222 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:47:50,222 INFO ]: ChcToBoogie initialized [2018-06-24 20:47:50,225 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,283 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50 Unit [2018-06-24 20:47:50,283 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:47:50,284 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:47:50,284 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:47:50,284 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:47:50,309 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,309 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,316 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,316 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,319 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,321 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,322 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,324 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:47:50,324 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:47:50,324 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:47:50,324 INFO ]: RCFGBuilder initialized [2018-06-24 20:47:50,326 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:47:50,340 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:47:50,340 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:47:50,340 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:47:50,340 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:47:50,340 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:47:50,340 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:47:50,651 INFO ]: Using library mode [2018-06-24 20:47:50,652 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:47:50 BoogieIcfgContainer [2018-06-24 20:47:50,652 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:47:50,652 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:47:50,652 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:47:50,653 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:47:50,655 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:47:50" (1/1) ... [2018-06-24 20:47:50,667 INFO ]: Initial Icfg 14 locations, 16 edges [2018-06-24 20:47:50,669 INFO ]: Using Remove infeasible edges [2018-06-24 20:47:50,669 INFO ]: Using Maximize final states [2018-06-24 20:47:50,670 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:47:50,670 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:47:50,674 INFO ]: Using Remove sink states [2018-06-24 20:47:50,675 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:47:50,675 INFO ]: Using Use SBE [2018-06-24 20:47:50,685 INFO ]: SBE split 0 edges [2018-06-24 20:47:50,691 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:47:50,693 INFO ]: 0 new accepting states [2018-06-24 20:47:50,747 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-24 20:47:50,749 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:47:50,756 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:47:50,756 INFO ]: 0 new accepting states [2018-06-24 20:47:50,756 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:47:50,757 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:47:50,757 INFO ]: Encoded RCFG 8 locations, 10 edges [2018-06-24 20:47:50,757 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:47:50 BasicIcfg [2018-06-24 20:47:50,757 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:47:50,758 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:47:50,758 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:47:50,762 INFO ]: TraceAbstraction initialized [2018-06-24 20:47:50,762 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:47:50" (1/4) ... [2018-06-24 20:47:50,763 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51116f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:47:50, skipping insertion in model container [2018-06-24 20:47:50,763 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:50" (2/4) ... [2018-06-24 20:47:50,763 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51116f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:47:50, skipping insertion in model container [2018-06-24 20:47:50,764 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:47:50" (3/4) ... [2018-06-24 20:47:50,765 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51116f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:47:50, skipping insertion in model container [2018-06-24 20:47:50,766 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:47:50" (4/4) ... [2018-06-24 20:47:50,767 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:47:50,775 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:47:50,780 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:47:50,813 INFO ]: Using default assertion order modulation [2018-06-24 20:47:50,813 INFO ]: Interprodecural is true [2018-06-24 20:47:50,813 INFO ]: Hoare is false [2018-06-24 20:47:50,813 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:47:50,813 INFO ]: Backedges is TWOTRACK [2018-06-24 20:47:50,813 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:47:50,813 INFO ]: Difference is false [2018-06-24 20:47:50,813 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:47:50,813 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:47:50,821 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 20:47:50,828 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:47:50,828 INFO ]: Found error trace [2018-06-24 20:47:50,829 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:50,829 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:50,835 INFO ]: Analyzing trace with hash -1172159523, now seen corresponding path program 1 times [2018-06-24 20:47:50,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:50,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:50,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:50,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:50,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:50,910 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:50,982 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:47:50,984 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:50,984 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:47:50,986 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:47:50,998 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:47:50,998 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:47:51,000 INFO ]: Start difference. First operand 8 states. Second operand 4 states. [2018-06-24 20:47:51,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:51,081 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-24 20:47:51,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:47:51,082 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:47:51,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:51,091 INFO ]: With dead ends: 13 [2018-06-24 20:47:51,091 INFO ]: Without dead ends: 13 [2018-06-24 20:47:51,093 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:51,107 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:47:51,135 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 20:47:51,136 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:47:51,137 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-24 20:47:51,138 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-06-24 20:47:51,138 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:51,138 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-24 20:47:51,138 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:47:51,138 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-24 20:47:51,138 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:47:51,138 INFO ]: Found error trace [2018-06-24 20:47:51,138 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:51,138 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:51,139 INFO ]: Analyzing trace with hash -2008006790, now seen corresponding path program 1 times [2018-06-24 20:47:51,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:51,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:51,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:51,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:51,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:51,163 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:51,426 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:47:51,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:51,427 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:47:51,428 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:47:51,428 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:47:51,428 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:51,428 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-06-24 20:47:51,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:51,684 INFO ]: Finished difference Result 15 states and 21 transitions. [2018-06-24 20:47:51,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:47:51,684 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:47:51,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:51,685 INFO ]: With dead ends: 15 [2018-06-24 20:47:51,685 INFO ]: Without dead ends: 14 [2018-06-24 20:47:51,685 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:51,685 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:47:51,687 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-24 20:47:51,687 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:47:51,687 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-24 20:47:51,687 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-24 20:47:51,687 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:51,687 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-24 20:47:51,687 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:47:51,688 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-24 20:47:51,688 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:47:51,688 INFO ]: Found error trace [2018-06-24 20:47:51,688 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:51,688 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:51,688 INFO ]: Analyzing trace with hash -1978454118, now seen corresponding path program 1 times [2018-06-24 20:47:51,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:51,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:51,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:51,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:51,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:51,701 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:51,902 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:47:51,902 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:51,902 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:47:51,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:51,933 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:51,939 INFO ]: Computing forward predicates... [2018-06-24 20:47:52,030 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:47:52,051 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:47:52,051 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-06-24 20:47:52,052 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:47:52,052 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:47:52,052 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:47:52,052 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2018-06-24 20:47:52,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:52,212 INFO ]: Finished difference Result 13 states and 17 transitions. [2018-06-24 20:47:52,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:47:52,213 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-24 20:47:52,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:52,213 INFO ]: With dead ends: 13 [2018-06-24 20:47:52,213 INFO ]: Without dead ends: 10 [2018-06-24 20:47:52,213 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:52,214 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:47:52,215 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:47:52,216 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:47:52,216 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 20:47:52,216 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-24 20:47:52,216 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:52,216 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 20:47:52,216 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:47:52,216 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 20:47:52,216 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:47:52,216 INFO ]: Found error trace [2018-06-24 20:47:52,217 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:52,217 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:52,217 INFO ]: Analyzing trace with hash -2119915619, now seen corresponding path program 1 times [2018-06-24 20:47:52,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:52,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:52,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:52,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:52,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:52,232 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:52,286 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:52,286 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:52,286 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:47:52,286 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:47:52,286 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:47:52,286 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:52,287 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-06-24 20:47:52,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:52,325 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-24 20:47:52,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:47:52,325 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:47:52,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:52,325 INFO ]: With dead ends: 11 [2018-06-24 20:47:52,325 INFO ]: Without dead ends: 11 [2018-06-24 20:47:52,326 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:52,326 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:47:52,327 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:47:52,327 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:47:52,327 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-24 20:47:52,327 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-24 20:47:52,328 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:52,328 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-24 20:47:52,328 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:47:52,328 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-24 20:47:52,328 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:47:52,328 INFO ]: Found error trace [2018-06-24 20:47:52,328 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:52,328 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:52,328 INFO ]: Analyzing trace with hash -1293109128, now seen corresponding path program 1 times [2018-06-24 20:47:52,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:52,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:52,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:52,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:52,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:52,357 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:52,775 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:47:52,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:52,775 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:47:52,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:52,830 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:52,835 INFO ]: Computing forward predicates... [2018-06-24 20:47:53,102 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:47:53,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:53,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:47:53,123 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:47:53,123 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:47:53,123 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:53,123 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2018-06-24 20:47:53,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:53,379 INFO ]: Finished difference Result 22 states and 29 transitions. [2018-06-24 20:47:53,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:47:53,379 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-24 20:47:53,379 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:53,380 INFO ]: With dead ends: 22 [2018-06-24 20:47:53,380 INFO ]: Without dead ends: 22 [2018-06-24 20:47:53,380 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:53,380 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:47:53,382 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-24 20:47:53,382 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:47:53,382 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-24 20:47:53,383 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2018-06-24 20:47:53,383 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:53,383 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-24 20:47:53,383 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:47:53,383 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-24 20:47:53,383 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:47:53,383 INFO ]: Found error trace [2018-06-24 20:47:53,383 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:53,383 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:53,383 INFO ]: Analyzing trace with hash 201341883, now seen corresponding path program 2 times [2018-06-24 20:47:53,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:53,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:53,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:53,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:53,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:53,396 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:53,481 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:53,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:53,481 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:47:53,487 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:53,512 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:53,512 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:53,514 INFO ]: Computing forward predicates... [2018-06-24 20:47:53,684 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:53,705 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:53,705 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 20:47:53,705 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:47:53,705 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:47:53,705 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:47:53,706 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 9 states. [2018-06-24 20:47:53,805 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:53,805 INFO ]: Finished difference Result 20 states and 26 transitions. [2018-06-24 20:47:53,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:47:53,806 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:47:53,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:53,807 INFO ]: With dead ends: 20 [2018-06-24 20:47:53,807 INFO ]: Without dead ends: 20 [2018-06-24 20:47:53,807 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:47:53,807 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:47:53,809 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-24 20:47:53,809 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:47:53,810 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-06-24 20:47:53,810 INFO ]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 11 [2018-06-24 20:47:53,810 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:53,810 INFO ]: Abstraction has 16 states and 21 transitions. [2018-06-24 20:47:53,810 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:47:53,810 INFO ]: Start isEmpty. Operand 16 states and 21 transitions. [2018-06-24 20:47:53,810 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:47:53,810 INFO ]: Found error trace [2018-06-24 20:47:53,810 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:53,810 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:53,811 INFO ]: Analyzing trace with hash -1463311397, now seen corresponding path program 3 times [2018-06-24 20:47:53,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:53,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:53,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:53,811 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:53,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:53,826 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:53,927 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:53,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:53,927 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:47:53,933 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:53,961 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:47:53,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:53,963 INFO ]: Computing forward predicates... [2018-06-24 20:47:54,016 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:54,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:54,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-06-24 20:47:54,040 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:47:54,041 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:47:54,041 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:47:54,041 INFO ]: Start difference. First operand 16 states and 21 transitions. Second operand 13 states. [2018-06-24 20:47:54,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:54,336 INFO ]: Finished difference Result 28 states and 36 transitions. [2018-06-24 20:47:54,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:47:54,338 INFO ]: Start accepts. Automaton has 13 states. Word has length 11 [2018-06-24 20:47:54,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:54,338 INFO ]: With dead ends: 28 [2018-06-24 20:47:54,338 INFO ]: Without dead ends: 24 [2018-06-24 20:47:54,339 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:47:54,339 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:47:54,341 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-06-24 20:47:54,341 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:47:54,341 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-24 20:47:54,341 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2018-06-24 20:47:54,341 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:54,342 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-24 20:47:54,342 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:47:54,342 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-24 20:47:54,342 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:47:54,342 INFO ]: Found error trace [2018-06-24 20:47:54,342 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:54,342 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:54,342 INFO ]: Analyzing trace with hash -1431911683, now seen corresponding path program 4 times [2018-06-24 20:47:54,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:54,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:54,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:54,343 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:54,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:54,352 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:54,418 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:54,418 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:54,418 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:47:54,424 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:54,444 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:54,444 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:54,446 INFO ]: Computing forward predicates... [2018-06-24 20:47:54,480 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:54,500 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:54,500 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 20:47:54,500 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:47:54,500 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:47:54,500 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:47:54,500 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 10 states. [2018-06-24 20:47:54,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:54,583 INFO ]: Finished difference Result 18 states and 21 transitions. [2018-06-24 20:47:54,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:47:54,583 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:47:54,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:54,584 INFO ]: With dead ends: 18 [2018-06-24 20:47:54,584 INFO ]: Without dead ends: 13 [2018-06-24 20:47:54,584 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:47:54,584 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:47:54,585 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:47:54,585 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:47:54,585 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-24 20:47:54,586 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-24 20:47:54,586 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:54,586 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-24 20:47:54,586 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:47:54,586 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-24 20:47:54,586 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:47:54,586 INFO ]: Found error trace [2018-06-24 20:47:54,586 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:54,586 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:54,586 INFO ]: Analyzing trace with hash 1946396698, now seen corresponding path program 5 times [2018-06-24 20:47:54,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:54,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:54,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:54,587 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:54,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:54,595 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:54,644 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:54,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:54,644 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:47:54,650 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:54,670 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:54,670 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:54,671 INFO ]: Computing forward predicates... [2018-06-24 20:47:54,700 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:54,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:54,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-06-24 20:47:54,719 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:47:54,720 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:47:54,720 INFO ]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:54,720 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 11 states. [2018-06-24 20:47:55,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:55,077 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-24 20:47:55,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:47:55,079 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:47:55,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:55,079 INFO ]: With dead ends: 17 [2018-06-24 20:47:55,079 INFO ]: Without dead ends: 14 [2018-06-24 20:47:55,079 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:47:55,079 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:47:55,081 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:47:55,081 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:47:55,081 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:47:55,081 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-24 20:47:55,081 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:55,081 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:47:55,081 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:47:55,081 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:47:55,081 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:47:55,082 INFO ]: Found error trace [2018-06-24 20:47:55,082 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:55,082 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:55,082 INFO ]: Analyzing trace with hash -764870019, now seen corresponding path program 6 times [2018-06-24 20:47:55,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:55,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:55,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:55,082 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:55,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:55,102 INFO ]: Conjunction of SSA is sat [2018-06-24 20:47:55,107 INFO ]: Counterexample might be feasible [2018-06-24 20:47:55,119 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:47:55,120 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:47:55 BasicIcfg [2018-06-24 20:47:55,120 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:47:55,121 INFO ]: Toolchain (without parser) took 4904.40 ms. Allocated memory was 308.8 MB in the beginning and 339.2 MB in the end (delta: 30.4 MB). Free memory was 265.2 MB in the beginning and 249.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 46.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:55,122 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:47:55,122 INFO ]: ChcToBoogie took 62.07 ms. Allocated memory is still 308.8 MB. Free memory was 264.2 MB in the beginning and 262.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:55,127 INFO ]: Boogie Preprocessor took 39.44 ms. Allocated memory is still 308.8 MB. Free memory was 262.1 MB in the beginning and 261.1 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:47:55,127 INFO ]: RCFGBuilder took 327.47 ms. Allocated memory is still 308.8 MB. Free memory was 261.1 MB in the beginning and 252.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:55,128 INFO ]: BlockEncodingV2 took 105.44 ms. Allocated memory is still 308.8 MB. Free memory was 252.1 MB in the beginning and 249.1 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:47:55,128 INFO ]: TraceAbstraction took 4362.26 ms. Allocated memory was 308.8 MB in the beginning and 339.2 MB in the end (delta: 30.4 MB). Free memory was 249.1 MB in the beginning and 249.1 MB in the end (delta: 12.8 kB). Peak memory consumption was 30.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:55,133 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 16 edges - StatisticsResult: Encoded RCFG 8 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.07 ms. Allocated memory is still 308.8 MB. Free memory was 264.2 MB in the beginning and 262.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.44 ms. Allocated memory is still 308.8 MB. Free memory was 262.1 MB in the beginning and 261.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 327.47 ms. Allocated memory is still 308.8 MB. Free memory was 261.1 MB in the beginning and 252.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 105.44 ms. Allocated memory is still 308.8 MB. Free memory was 252.1 MB in the beginning and 249.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4362.26 ms. Allocated memory was 308.8 MB in the beginning and 339.2 MB in the end (delta: 30.4 MB). Free memory was 249.1 MB in the beginning and 249.1 MB in the end (delta: 12.8 kB). Peak memory consumption was 30.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0); [L0] assume !(0 <= hbv_inv_main27_1_Int + -1); [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main27_0_Int, hhv_inv_main27_1_Int, hbv_inv_main27_2_Int, hhv_inv_main27_2_Int, hbv_inv_main27_1_Int; [L0] havoc hbv_inv_main27_2_Int, hbv_inv_main27_1_Int; [L0] assume (hhv_inv_main23_3_Int == hbv_inv_main23_2_Int + hhv_inv_main23_2_Int && hhv_inv_main23_4_Int == hbv_inv_main23_1_Int + -1) && 0 <= hbv_inv_main23_1_Int + -1; [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume (hhv_inv_main23_3_Int == hbv_inv_main23_2_Int + hhv_inv_main23_2_Int && hhv_inv_main23_4_Int == hbv_inv_main23_1_Int + -1) && 0 <= hbv_inv_main23_1_Int + -1; [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume ((hhv_inv_main23_2_Int == hhv_inv_main23_0_Int && hhv_inv_main23_3_Int == 0) && hhv_inv_main23_4_Int == hhv_inv_main23_0_Int) && !(0 <= hbv_inv_main23_1_Int + -1); [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main23_0_Int, hbv_inv_main23_2_Int, hhv_inv_main23_1_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume (0 <= hbv_inv_main14_2_Int + -1 && hhv_inv_main14_2_Int == hbv_inv_main14_1_Int + hhv_inv_main14_1_Int) && hhv_inv_main14_3_Int == hbv_inv_main14_2_Int + -1; [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] havoc hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] assume (0 <= hbv_inv_main14_2_Int + -1 && hhv_inv_main14_2_Int == hbv_inv_main14_1_Int + hhv_inv_main14_1_Int) && hhv_inv_main14_3_Int == hbv_inv_main14_2_Int + -1; [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] havoc hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] assume hhv_inv_main14_2_Int == 0 && !(0 <= hbv_inv_main14_1_Int + -1); [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_3_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int; [L0] havoc hbv_inv_main14_1_Int; [L0] assume (hhv_inv_main8_3_Int == hbv_inv_main8_1_Int + -1 && 0 <= hbv_inv_main8_1_Int + -1) && hhv_inv_main8_2_Int == hbv_inv_main8_2_Int + hhv_inv_main8_1_Int; [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int; [L0] havoc hbv_inv_main8_1_Int, hbv_inv_main8_2_Int; [L0] assume (hhv_inv_main8_3_Int == hbv_inv_main8_1_Int + -1 && 0 <= hbv_inv_main8_1_Int + -1) && hhv_inv_main8_2_Int == hbv_inv_main8_2_Int + hhv_inv_main8_1_Int; [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int; [L0] havoc hbv_inv_main8_1_Int, hbv_inv_main8_2_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. UNSAFE Result, 4.3s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 71 SDtfs, 84 SDslu, 306 SDs, 0 SdLazy, 357 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=6, 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, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 4174 SizeOfPredicates, 40 NumberOfNonLiveVariables, 719 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 32/55 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/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-47-55-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-47-55-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-47-55-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-47-55-150.csv Received shutdown request...