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/barthe2-big2_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:45:08,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:45:08,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:45:08,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:45:08,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:45:08,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:45:08,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:45:08,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:45:08,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:45:08,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:45:08,773 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:45:08,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:45:08,774 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:45:08,775 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:45:08,776 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:45:08,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:45:08,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:45:08,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:45:08,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:45:08,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:45:08,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:45:08,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:45:08,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:45:08,799 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:45:08,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:45:08,800 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:45:08,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:45:08,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:45:08,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:45:08,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:45:08,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:45:08,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:45:08,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:45:08,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:45:08,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:45:08,807 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:45:08,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:45:08,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:45:08,831 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:45:08,832 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:45:08,834 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:45:08,835 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:45:08,835 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:45:08,835 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:45:08,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:45:08,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:45:08,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:45:08,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:45:08,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:45:08,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:45:08,836 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:45:08,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:45:08,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:45:08,838 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:45:08,838 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:45:08,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:45:08,838 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:45:08,840 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:45:08,840 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:45:08,888 INFO ]: Repository-Root is: /tmp [2018-06-24 20:45:08,904 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:45:08,912 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:45:08,913 INFO ]: Initializing SmtParser... [2018-06-24 20:45:08,913 INFO ]: SmtParser initialized [2018-06-24 20:45:08,914 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_safe.c-1.smt2 [2018-06-24 20:45:08,915 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:45:09,000 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_safe.c-1.smt2 unknown [2018-06-24 20:45:09,220 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_safe.c-1.smt2 [2018-06-24 20:45:09,224 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:45:09,230 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:45:09,230 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:45:09,230 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:45:09,231 INFO ]: ChcToBoogie initialized [2018-06-24 20:45:09,234 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,296 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09 Unit [2018-06-24 20:45:09,296 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:45:09,297 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:45:09,297 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:45:09,297 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:45:09,319 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,319 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,325 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,325 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,331 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,333 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,341 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,343 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:45:09,344 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:45:09,344 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:45:09,344 INFO ]: RCFGBuilder initialized [2018-06-24 20:45:09,350 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (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:45:09,367 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:45:09,367 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:45:09,367 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:45:09,367 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:45:09,367 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:45:09,367 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:45:09,807 INFO ]: Using library mode [2018-06-24 20:45:09,807 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:45:09 BoogieIcfgContainer [2018-06-24 20:45:09,807 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:45:09,808 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:45:09,808 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:45:09,809 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:45:09,809 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:45:09" (1/1) ... [2018-06-24 20:45:09,825 INFO ]: Initial Icfg 17 locations, 22 edges [2018-06-24 20:45:09,826 INFO ]: Using Remove infeasible edges [2018-06-24 20:45:09,826 INFO ]: Using Maximize final states [2018-06-24 20:45:09,827 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:45:09,827 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:45:09,831 INFO ]: Using Remove sink states [2018-06-24 20:45:09,832 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:45:09,832 INFO ]: Using Use SBE [2018-06-24 20:45:09,854 INFO ]: SBE split 6 edges [2018-06-24 20:45:09,859 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:45:09,861 INFO ]: 0 new accepting states [2018-06-24 20:45:09,921 INFO ]: Removed 9 edges and 4 locations by large block encoding [2018-06-24 20:45:09,924 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:45:09,925 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:45:09,925 INFO ]: 0 new accepting states [2018-06-24 20:45:09,925 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:45:09,925 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:45:09,925 INFO ]: Encoded RCFG 11 locations, 22 edges [2018-06-24 20:45:09,926 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:45:09 BasicIcfg [2018-06-24 20:45:09,926 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:45:09,927 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:45:09,927 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:45:09,930 INFO ]: TraceAbstraction initialized [2018-06-24 20:45:09,930 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:45:09" (1/4) ... [2018-06-24 20:45:09,931 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d91081f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:45:09, skipping insertion in model container [2018-06-24 20:45:09,931 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:09" (2/4) ... [2018-06-24 20:45:09,931 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d91081f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:45:09, skipping insertion in model container [2018-06-24 20:45:09,931 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:45:09" (3/4) ... [2018-06-24 20:45:09,932 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d91081f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:45:09, skipping insertion in model container [2018-06-24 20:45:09,932 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:45:09" (4/4) ... [2018-06-24 20:45:09,933 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:45:09,945 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:45:09,953 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:45:09,990 INFO ]: Using default assertion order modulation [2018-06-24 20:45:09,990 INFO ]: Interprodecural is true [2018-06-24 20:45:09,990 INFO ]: Hoare is false [2018-06-24 20:45:09,990 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:45:09,990 INFO ]: Backedges is TWOTRACK [2018-06-24 20:45:09,990 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:45:09,990 INFO ]: Difference is false [2018-06-24 20:45:09,990 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:45:09,990 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:45:10,002 INFO ]: Start isEmpty. Operand 11 states. [2018-06-24 20:45:10,012 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:45:10,012 INFO ]: Found error trace [2018-06-24 20:45:10,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:10,013 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:10,018 INFO ]: Analyzing trace with hash -700595996, now seen corresponding path program 1 times [2018-06-24 20:45:10,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:10,020 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:10,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:10,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:10,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:10,103 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:10,401 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:45:10,404 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:45:10,404 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-24 20:45:10,406 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:45:10,421 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:45:10,421 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:45:10,425 INFO ]: Start difference. First operand 11 states. Second operand 8 states. [2018-06-24 20:45:10,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:10,972 INFO ]: Finished difference Result 30 states and 68 transitions. [2018-06-24 20:45:10,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:45:10,973 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:45:10,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:10,983 INFO ]: With dead ends: 30 [2018-06-24 20:45:10,983 INFO ]: Without dead ends: 29 [2018-06-24 20:45:10,985 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:45:11,003 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:45:11,022 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 16. [2018-06-24 20:45:11,023 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:45:11,024 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2018-06-24 20:45:11,025 INFO ]: Start accepts. Automaton has 16 states and 35 transitions. Word has length 10 [2018-06-24 20:45:11,025 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:11,025 INFO ]: Abstraction has 16 states and 35 transitions. [2018-06-24 20:45:11,025 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:45:11,025 INFO ]: Start isEmpty. Operand 16 states and 35 transitions. [2018-06-24 20:45:11,025 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:45:11,026 INFO ]: Found error trace [2018-06-24 20:45:11,026 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:11,026 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:11,026 INFO ]: Analyzing trace with hash 787120855, now seen corresponding path program 1 times [2018-06-24 20:45:11,026 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:11,026 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:11,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:11,027 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:11,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:11,044 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:11,473 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:45:11,473 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:45:11,474 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-24 20:45:11,475 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:45:11,475 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:45:11,475 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:45:11,476 INFO ]: Start difference. First operand 16 states and 35 transitions. Second operand 7 states. [2018-06-24 20:45:12,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:12,037 INFO ]: Finished difference Result 24 states and 54 transitions. [2018-06-24 20:45:12,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:45:12,037 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-24 20:45:12,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:12,039 INFO ]: With dead ends: 24 [2018-06-24 20:45:12,039 INFO ]: Without dead ends: 23 [2018-06-24 20:45:12,040 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:45:12,040 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:45:12,043 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-24 20:45:12,043 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:45:12,044 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 44 transitions. [2018-06-24 20:45:12,044 INFO ]: Start accepts. Automaton has 19 states and 44 transitions. Word has length 11 [2018-06-24 20:45:12,044 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:12,044 INFO ]: Abstraction has 19 states and 44 transitions. [2018-06-24 20:45:12,044 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:45:12,045 INFO ]: Start isEmpty. Operand 19 states and 44 transitions. [2018-06-24 20:45:12,045 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:45:12,045 INFO ]: Found error trace [2018-06-24 20:45:12,045 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:12,045 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:12,045 INFO ]: Analyzing trace with hash 788044376, now seen corresponding path program 1 times [2018-06-24 20:45:12,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:12,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:12,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:12,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:12,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:12,065 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:12,114 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:45:12,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:12,114 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:45:12,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:12,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:12,164 INFO ]: Computing forward predicates... [2018-06-24 20:45:12,182 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:45:12,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:12,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:45:12,203 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:45:12,203 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:45:12,204 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:45:12,204 INFO ]: Start difference. First operand 19 states and 44 transitions. Second operand 5 states. [2018-06-24 20:45:12,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:12,266 INFO ]: Finished difference Result 29 states and 67 transitions. [2018-06-24 20:45:12,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:45:12,267 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-24 20:45:12,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:12,268 INFO ]: With dead ends: 29 [2018-06-24 20:45:12,268 INFO ]: Without dead ends: 28 [2018-06-24 20:45:12,268 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 12 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:45:12,268 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:45:12,272 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-06-24 20:45:12,272 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:45:12,273 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 49 transitions. [2018-06-24 20:45:12,273 INFO ]: Start accepts. Automaton has 21 states and 49 transitions. Word has length 11 [2018-06-24 20:45:12,273 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:12,273 INFO ]: Abstraction has 21 states and 49 transitions. [2018-06-24 20:45:12,273 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:45:12,273 INFO ]: Start isEmpty. Operand 21 states and 49 transitions. [2018-06-24 20:45:12,274 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:45:12,274 INFO ]: Found error trace [2018-06-24 20:45:12,274 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:12,274 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:12,274 INFO ]: Analyzing trace with hash -1075894115, now seen corresponding path program 1 times [2018-06-24 20:45:12,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:12,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:12,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:12,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:12,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:12,288 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:12,398 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:45:12,398 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:12,398 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:45:12,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:12,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:12,444 INFO ]: Computing forward predicates... [2018-06-24 20:45:12,517 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:45:12,537 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:45:12,537 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-06-24 20:45:12,538 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:45:12,538 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:45:12,538 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:45:12,538 INFO ]: Start difference. First operand 21 states and 49 transitions. Second operand 11 states. [2018-06-24 20:45:13,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:13,319 INFO ]: Finished difference Result 38 states and 84 transitions. [2018-06-24 20:45:13,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:45:13,319 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-24 20:45:13,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:13,320 INFO ]: With dead ends: 38 [2018-06-24 20:45:13,320 INFO ]: Without dead ends: 34 [2018-06-24 20:45:13,320 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:45:13,320 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:45:13,325 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-06-24 20:45:13,326 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:45:13,326 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. [2018-06-24 20:45:13,326 INFO ]: Start accepts. Automaton has 23 states and 54 transitions. Word has length 11 [2018-06-24 20:45:13,326 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:13,326 INFO ]: Abstraction has 23 states and 54 transitions. [2018-06-24 20:45:13,326 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:45:13,327 INFO ]: Start isEmpty. Operand 23 states and 54 transitions. [2018-06-24 20:45:13,327 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:45:13,327 INFO ]: Found error trace [2018-06-24 20:45:13,327 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:13,327 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:13,327 INFO ]: Analyzing trace with hash -268736761, now seen corresponding path program 1 times [2018-06-24 20:45:13,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:13,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:13,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:13,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:13,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:13,345 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:13,458 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:45:13,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:13,458 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:45:13,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:13,485 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:13,487 INFO ]: Computing forward predicates... [2018-06-24 20:45:13,541 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:45:13,560 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:13,560 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-24 20:45:13,561 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:45:13,561 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:45:13,561 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:45:13,561 INFO ]: Start difference. First operand 23 states and 54 transitions. Second operand 12 states. [2018-06-24 20:45:13,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:13,938 INFO ]: Finished difference Result 46 states and 101 transitions. [2018-06-24 20:45:13,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:45:13,939 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-24 20:45:13,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:13,939 INFO ]: With dead ends: 46 [2018-06-24 20:45:13,939 INFO ]: Without dead ends: 41 [2018-06-24 20:45:13,940 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:45:13,940 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:45:13,943 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 25. [2018-06-24 20:45:13,943 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:45:13,944 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 55 transitions. [2018-06-24 20:45:13,944 INFO ]: Start accepts. Automaton has 25 states and 55 transitions. Word has length 11 [2018-06-24 20:45:13,944 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:13,944 INFO ]: Abstraction has 25 states and 55 transitions. [2018-06-24 20:45:13,944 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:45:13,944 INFO ]: Start isEmpty. Operand 25 states and 55 transitions. [2018-06-24 20:45:13,944 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:45:13,944 INFO ]: Found error trace [2018-06-24 20:45:13,944 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:13,945 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:13,945 INFO ]: Analyzing trace with hash -1734009068, now seen corresponding path program 1 times [2018-06-24 20:45:13,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:13,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:13,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:13,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:13,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:13,957 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:14,035 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:45:14,035 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:45:14,035 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-24 20:45:14,035 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:45:14,035 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:45:14,035 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:45:14,035 INFO ]: Start difference. First operand 25 states and 55 transitions. Second operand 8 states. [2018-06-24 20:45:14,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:14,181 INFO ]: Finished difference Result 34 states and 75 transitions. [2018-06-24 20:45:14,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:45:14,182 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-24 20:45:14,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:14,183 INFO ]: With dead ends: 34 [2018-06-24 20:45:14,183 INFO ]: Without dead ends: 33 [2018-06-24 20:45:14,183 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:45:14,183 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:45:14,186 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-06-24 20:45:14,186 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:45:14,186 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2018-06-24 20:45:14,186 INFO ]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 11 [2018-06-24 20:45:14,186 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:14,186 INFO ]: Abstraction has 22 states and 46 transitions. [2018-06-24 20:45:14,186 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:45:14,186 INFO ]: Start isEmpty. Operand 22 states and 46 transitions. [2018-06-24 20:45:14,187 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:45:14,187 INFO ]: Found error trace [2018-06-24 20:45:14,187 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:14,187 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:14,187 INFO ]: Analyzing trace with hash -1733085547, now seen corresponding path program 1 times [2018-06-24 20:45:14,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:14,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:14,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:14,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:14,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:14,197 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:14,249 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:45:14,249 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:45:14,249 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-24 20:45:14,249 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:45:14,250 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:45:14,250 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:45:14,250 INFO ]: Start difference. First operand 22 states and 46 transitions. Second operand 8 states. [2018-06-24 20:45:14,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:14,400 INFO ]: Finished difference Result 33 states and 70 transitions. [2018-06-24 20:45:14,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:45:14,402 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-24 20:45:14,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:14,402 INFO ]: With dead ends: 33 [2018-06-24 20:45:14,402 INFO ]: Without dead ends: 30 [2018-06-24 20:45:14,403 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:45:14,403 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:45:14,406 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-06-24 20:45:14,406 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:45:14,406 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2018-06-24 20:45:14,406 INFO ]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 11 [2018-06-24 20:45:14,406 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:14,406 INFO ]: Abstraction has 24 states and 52 transitions. [2018-06-24 20:45:14,406 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:45:14,407 INFO ]: Start isEmpty. Operand 24 states and 52 transitions. [2018-06-24 20:45:14,407 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:45:14,407 INFO ]: Found error trace [2018-06-24 20:45:14,407 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:14,407 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:14,407 INFO ]: Analyzing trace with hash -1704456396, now seen corresponding path program 1 times [2018-06-24 20:45:14,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:14,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:14,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:14,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:14,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:14,419 INFO ]: Conjunction of SSA is sat [2018-06-24 20:45:14,421 INFO ]: Counterexample might be feasible [2018-06-24 20:45:14,439 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:45:14,440 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:45:14 BasicIcfg [2018-06-24 20:45:14,440 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:45:14,441 INFO ]: Toolchain (without parser) took 5216.33 ms. Allocated memory was 297.3 MB in the beginning and 342.9 MB in the end (delta: 45.6 MB). Free memory was 251.7 MB in the beginning and 163.6 MB in the end (delta: 88.1 MB). Peak memory consumption was 133.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:14,442 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 297.3 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:45:14,446 INFO ]: ChcToBoogie took 66.27 ms. Allocated memory is still 297.3 MB. Free memory was 250.7 MB in the beginning and 248.7 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:45:14,446 INFO ]: Boogie Preprocessor took 46.30 ms. Allocated memory is still 297.3 MB. Free memory was 248.7 MB in the beginning and 247.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:14,447 INFO ]: RCFGBuilder took 463.72 ms. Allocated memory is still 297.3 MB. Free memory was 247.6 MB in the beginning and 234.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:14,447 INFO ]: BlockEncodingV2 took 118.23 ms. Allocated memory is still 297.3 MB. Free memory was 234.6 MB in the beginning and 230.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:14,448 INFO ]: TraceAbstraction took 4513.53 ms. Allocated memory was 297.3 MB in the beginning and 342.9 MB in the end (delta: 45.6 MB). Free memory was 230.6 MB in the beginning and 163.6 MB in the end (delta: 67.0 MB). Peak memory consumption was 112.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:14,458 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 17 locations, 22 edges - StatisticsResult: Encoded RCFG 11 locations, 22 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 297.3 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.27 ms. Allocated memory is still 297.3 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.30 ms. Allocated memory is still 297.3 MB. Free memory was 248.7 MB in the beginning and 247.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 463.72 ms. Allocated memory is still 297.3 MB. Free memory was 247.6 MB in the beginning and 234.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 118.23 ms. Allocated memory is still 297.3 MB. Free memory was 234.6 MB in the beginning and 230.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4513.53 ms. Allocated memory was 297.3 MB in the beginning and 342.9 MB in the end (delta: 45.6 MB). Free memory was 230.6 MB in the beginning and 163.6 MB in the end (delta: 67.0 MB). Peak memory consumption was 112.6 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_main49_1_Int + -1 * hbv_inv_main49_2_Int && !(hbv_inv_main49_3_Int == 0)); [L0] hhv_inv_main43_0_Int, hhv_inv_main43_1_Int, hhv_inv_main43_2_Int, hhv_inv_main43_3_Int, hhv_inv_main43_4_Int := hhv_inv_main49_0_Int, hhv_inv_main49_1_Int, hbv_inv_main49_1_Int, hbv_inv_main49_2_Int, hhv_inv_main49_2_Int; [L0] havoc hbv_inv_main49_3_Int, hbv_inv_main49_2_Int, hbv_inv_main49_1_Int; [L0] assume ((0 <= hhv_inv_main43_2_Int + -1 * hbv_inv_main43_3_Int && !(hbv_inv_main43_1_Int == 0)) && hhv_inv_main43_3_Int == hbv_inv_main43_3_Int + 1) && hhv_inv_main43_4_Int == 2 * hbv_inv_main43_2_Int; [L0] hhv_inv_main43_0_Int, hhv_inv_main43_1_Int, hhv_inv_main43_2_Int, hhv_inv_main43_3_Int, hhv_inv_main43_4_Int := hhv_inv_main43_0_Int, hhv_inv_main43_1_Int, hhv_inv_main43_2_Int, hbv_inv_main43_3_Int, hbv_inv_main43_2_Int; [L0] havoc hbv_inv_main43_2_Int, hbv_inv_main43_3_Int, hbv_inv_main43_1_Int; [L0] assume !(0 <= hhv_inv_main43_2_Int + -1 * hbv_inv_main43_1_Int && !(hbv_inv_main43_2_Int == 0)) && hhv_inv_main43_3_Int == 1; [L0] hhv_inv_main37_0_Int, hhv_inv_main37_1_Int, hhv_inv_main37_2_Int, hhv_inv_main37_3_Int, hhv_inv_main37_4_Int := hhv_inv_main43_0_Int, hhv_inv_main43_1_Int, hhv_inv_main43_2_Int, hbv_inv_main43_1_Int, hhv_inv_main43_4_Int; [L0] havoc hbv_inv_main43_2_Int, hbv_inv_main43_1_Int; [L0] assume hhv_inv_main37_3_Int == 1 && !(!(hbv_inv_main37_2_Int == 0) && 0 <= hhv_inv_main37_2_Int + -1 * hbv_inv_main37_1_Int); [L0] hhv_inv_main31_0_Int, hhv_inv_main31_1_Int, hhv_inv_main31_2_Int, hhv_inv_main31_3_Int, hhv_inv_main31_4_Int := hhv_inv_main37_0_Int, hhv_inv_main37_1_Int, hhv_inv_main37_2_Int, hbv_inv_main37_1_Int, hhv_inv_main37_4_Int; [L0] havoc hbv_inv_main37_2_Int, hbv_inv_main37_1_Int; [L0] assume ((hhv_inv_main31_3_Int == 1 && hhv_inv_main31_2_Int == hhv_inv_main31_0_Int) && !(!(hbv_inv_main31_3_Int == 0) && 0 <= hbv_inv_main31_1_Int + -1 * hbv_inv_main31_2_Int)) && hhv_inv_main31_4_Int == 1; [L0] hhv_inv_main20_0_Int, hhv_inv_main20_1_Int, hhv_inv_main20_2_Int, hhv_inv_main20_3_Int := hhv_inv_main31_0_Int, hbv_inv_main31_1_Int, hbv_inv_main31_2_Int, hhv_inv_main31_1_Int; [L0] havoc hbv_inv_main31_3_Int, hbv_inv_main31_1_Int, hbv_inv_main31_2_Int; [L0] assume !(!(hbv_inv_main20_2_Int == 0) && 0 <= hhv_inv_main20_1_Int + -1 * hbv_inv_main20_1_Int) && hhv_inv_main20_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_main20_0_Int, hhv_inv_main20_1_Int, hbv_inv_main20_1_Int, hhv_inv_main20_3_Int; [L0] havoc hbv_inv_main20_1_Int, hbv_inv_main20_2_Int; [L0] assume hhv_inv_main14_2_Int == 0 && !(!(hbv_inv_main14_2_Int == 0) && 0 <= hhv_inv_main14_1_Int + -1 * hbv_inv_main14_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_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hhv_inv_main14_3_Int; [L0] havoc hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. UNSAFE Result, 4.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 378 SDslu, 714 SDs, 0 SdLazy, 911 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=5, 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, 7 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 3103 SizeOfPredicates, 20 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 4/9 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/barthe2-big2_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-45-14-475.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-45-14-475.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-45-14-475.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-45-14-475.csv Received shutdown request...