java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple_nest.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 01:29:31,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 01:29:31,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 01:29:31,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 01:29:31,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 01:29:31,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 01:29:31,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 01:29:31,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 01:29:31,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 01:29:31,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 01:29:31,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 01:29:31,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 01:29:31,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 01:29:31,386 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 01:29:31,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 01:29:31,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 01:29:31,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 01:29:31,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 01:29:31,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 01:29:31,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 01:29:31,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 01:29:31,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 01:29:31,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 01:29:31,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 01:29:31,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 01:29:31,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 01:29:31,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 01:29:31,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 01:29:31,420 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 01:29:31,420 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 01:29:31,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 01:29:31,421 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 01:29:31,421 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 01:29:31,422 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 01:29:31,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 01:29:31,425 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 01:29:31,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 01:29:31,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 01:29:31,451 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 01:29:31,452 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 01:29:31,453 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 01:29:31,453 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 01:29:31,453 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 01:29:31,453 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 01:29:31,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 01:29:31,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 01:29:31,454 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 01:29:31,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 01:29:31,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:29:31,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 01:29:31,456 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 01:29:31,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 01:29:31,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 01:29:31,456 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 01:29:31,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 01:29:31,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 01:29:31,457 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 01:29:31,458 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 01:29:31,458 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 01:29:31,505 INFO ]: Repository-Root is: /tmp [2018-06-25 01:29:31,523 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 01:29:31,526 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 01:29:31,527 INFO ]: Initializing SmtParser... [2018-06-25 01:29:31,527 INFO ]: SmtParser initialized [2018-06-25 01:29:31,528 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple_nest.c.smt2 [2018-06-25 01:29:31,529 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 01:29:31,616 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple_nest.c.smt2 unknown [2018-06-25 01:29:31,840 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple_nest.c.smt2 [2018-06-25 01:29:31,845 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 01:29:31,851 INFO ]: Walking toolchain with 5 elements. [2018-06-25 01:29:31,851 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 01:29:31,851 INFO ]: Initializing ChcToBoogie... [2018-06-25 01:29:31,852 INFO ]: ChcToBoogie initialized [2018-06-25 01:29:31,855 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:29:31" (1/1) ... [2018-06-25 01:29:31,908 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31 Unit [2018-06-25 01:29:31,908 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 01:29:31,909 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 01:29:31,909 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 01:29:31,909 INFO ]: Boogie Preprocessor initialized [2018-06-25 01:29:31,929 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (1/1) ... [2018-06-25 01:29:31,930 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (1/1) ... [2018-06-25 01:29:31,937 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (1/1) ... [2018-06-25 01:29:31,937 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (1/1) ... [2018-06-25 01:29:31,940 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (1/1) ... [2018-06-25 01:29:31,949 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (1/1) ... [2018-06-25 01:29:31,950 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (1/1) ... [2018-06-25 01:29:31,952 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 01:29:31,952 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 01:29:31,952 INFO ]: Initializing RCFGBuilder... [2018-06-25 01:29:31,952 INFO ]: RCFGBuilder initialized [2018-06-25 01:29:31,953 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 01:29:31,981 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 01:29:31,981 INFO ]: Found specification of procedure gotoProc [2018-06-25 01:29:31,981 INFO ]: Found implementation of procedure gotoProc [2018-06-25 01:29:31,981 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 01:29:31,981 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 01:29:31,981 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:29:32,161 INFO ]: Using library mode [2018-06-25 01:29:32,162 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:29:32 BoogieIcfgContainer [2018-06-25 01:29:32,162 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 01:29:32,162 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 01:29:32,162 INFO ]: Initializing BlockEncodingV2... [2018-06-25 01:29:32,167 INFO ]: BlockEncodingV2 initialized [2018-06-25 01:29:32,168 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:29:32" (1/1) ... [2018-06-25 01:29:32,194 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 01:29:32,196 INFO ]: Using Remove infeasible edges [2018-06-25 01:29:32,196 INFO ]: Using Maximize final states [2018-06-25 01:29:32,199 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 01:29:32,199 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 01:29:32,201 INFO ]: Using Remove sink states [2018-06-25 01:29:32,202 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 01:29:32,202 INFO ]: Using Use SBE [2018-06-25 01:29:32,217 WARN ]: expecting exponential blowup for input size 20 [2018-06-25 01:29:33,518 WARN ]: Simplifying disjunction of 103056 conjuctions. This might take some time... [2018-06-25 01:29:59,741 INFO ]: Simplified to disjunction of 2528 conjuctions. [2018-06-25 01:29:59,826 INFO ]: SBE split 1 edges [2018-06-25 01:29:59,831 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 01:29:59,835 INFO ]: 0 new accepting states [2018-06-25 01:29:59,878 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 01:29:59,880 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:29:59,886 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 01:29:59,886 INFO ]: 0 new accepting states [2018-06-25 01:29:59,886 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 01:29:59,886 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:29:59,889 INFO ]: Encoded RCFG 6 locations, 36 edges [2018-06-25 01:29:59,889 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:29:59 BasicIcfg [2018-06-25 01:29:59,889 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 01:29:59,890 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 01:29:59,890 INFO ]: Initializing TraceAbstraction... [2018-06-25 01:29:59,895 INFO ]: TraceAbstraction initialized [2018-06-25 01:29:59,895 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:29:31" (1/4) ... [2018-06-25 01:29:59,896 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c07bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:29:59, skipping insertion in model container [2018-06-25 01:29:59,896 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:29:31" (2/4) ... [2018-06-25 01:29:59,896 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c07bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:29:59, skipping insertion in model container [2018-06-25 01:29:59,896 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:29:32" (3/4) ... [2018-06-25 01:29:59,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c07bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:29:59, skipping insertion in model container [2018-06-25 01:29:59,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:29:59" (4/4) ... [2018-06-25 01:29:59,899 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 01:29:59,909 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 01:29:59,918 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 01:29:59,980 INFO ]: Using default assertion order modulation [2018-06-25 01:29:59,980 INFO ]: Interprodecural is true [2018-06-25 01:29:59,980 INFO ]: Hoare is false [2018-06-25 01:29:59,980 INFO ]: Compute interpolants for FPandBP [2018-06-25 01:29:59,980 INFO ]: Backedges is TWOTRACK [2018-06-25 01:29:59,980 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 01:29:59,980 INFO ]: Difference is false [2018-06-25 01:29:59,980 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 01:29:59,980 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 01:29:59,995 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 01:30:00,009 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:30:00,009 INFO ]: Found error trace [2018-06-25 01:30:00,010 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:30:00,010 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:30:00,018 INFO ]: Analyzing trace with hash 36355874, now seen corresponding path program 1 times [2018-06-25 01:30:00,020 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:30:00,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:30:00,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:00,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:00,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:00,118 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:00,215 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:30:00,219 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:30:00,219 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:30:00,221 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:30:00,236 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:30:00,236 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:00,239 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 01:30:01,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:30:01,061 INFO ]: Finished difference Result 7 states and 59 transitions. [2018-06-25 01:30:01,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:30:01,062 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:30:01,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:30:01,072 INFO ]: With dead ends: 7 [2018-06-25 01:30:01,072 INFO ]: Without dead ends: 7 [2018-06-25 01:30:01,074 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:01,086 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 01:30:01,102 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 01:30:01,103 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:30:01,104 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-06-25 01:30:01,105 INFO ]: Start accepts. Automaton has 7 states and 59 transitions. Word has length 5 [2018-06-25 01:30:01,106 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:30:01,106 INFO ]: Abstraction has 7 states and 59 transitions. [2018-06-25 01:30:01,106 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:30:01,106 INFO ]: Start isEmpty. Operand 7 states and 59 transitions. [2018-06-25 01:30:01,107 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:30:01,107 INFO ]: Found error trace [2018-06-25 01:30:01,107 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:30:01,107 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:30:01,107 INFO ]: Analyzing trace with hash 1126825638, now seen corresponding path program 1 times [2018-06-25 01:30:01,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:30:01,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:30:01,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:01,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:01,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:01,117 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:01,181 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:30:01,181 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:30:01,181 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:30:01,182 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:30:01,183 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:30:01,183 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:01,183 INFO ]: Start difference. First operand 7 states and 59 transitions. Second operand 3 states. [2018-06-25 01:30:01,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:30:01,430 INFO ]: Finished difference Result 9 states and 88 transitions. [2018-06-25 01:30:01,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:30:01,430 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 01:30:01,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:30:01,431 INFO ]: With dead ends: 9 [2018-06-25 01:30:01,431 INFO ]: Without dead ends: 9 [2018-06-25 01:30:01,432 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:01,432 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:30:01,434 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 01:30:01,434 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:30:01,434 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2018-06-25 01:30:01,435 INFO ]: Start accepts. Automaton has 9 states and 88 transitions. Word has length 6 [2018-06-25 01:30:01,435 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:30:01,435 INFO ]: Abstraction has 9 states and 88 transitions. [2018-06-25 01:30:01,435 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:30:01,435 INFO ]: Start isEmpty. Operand 9 states and 88 transitions. [2018-06-25 01:30:01,435 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:30:01,435 INFO ]: Found error trace [2018-06-25 01:30:01,435 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:30:01,435 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:30:01,435 INFO ]: Analyzing trace with hash 570964761, now seen corresponding path program 1 times [2018-06-25 01:30:01,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:30:01,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:30:01,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:01,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:01,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:01,448 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:01,494 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 01:30:01,494 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:30:01,494 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:30:01,494 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:30:01,494 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:30:01,494 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:01,495 INFO ]: Start difference. First operand 9 states and 88 transitions. Second operand 3 states. [2018-06-25 01:30:01,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:30:01,744 INFO ]: Finished difference Result 13 states and 126 transitions. [2018-06-25 01:30:01,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:30:01,744 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 01:30:01,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:30:01,745 INFO ]: With dead ends: 13 [2018-06-25 01:30:01,745 INFO ]: Without dead ends: 13 [2018-06-25 01:30:01,745 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:01,745 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 01:30:01,748 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 01:30:01,749 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 01:30:01,749 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2018-06-25 01:30:01,750 INFO ]: Start accepts. Automaton has 13 states and 126 transitions. Word has length 7 [2018-06-25 01:30:01,750 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:30:01,750 INFO ]: Abstraction has 13 states and 126 transitions. [2018-06-25 01:30:01,750 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:30:01,750 INFO ]: Start isEmpty. Operand 13 states and 126 transitions. [2018-06-25 01:30:01,750 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:30:01,750 INFO ]: Found error trace [2018-06-25 01:30:01,750 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:30:01,750 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:30:01,750 INFO ]: Analyzing trace with hash 562772236, now seen corresponding path program 1 times [2018-06-25 01:30:01,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:30:01,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:30:01,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:01,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:01,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:01,760 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:01,790 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:30:01,791 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:30:01,791 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:30:01,791 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:30:01,791 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:30:01,791 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:01,791 INFO ]: Start difference. First operand 13 states and 126 transitions. Second operand 3 states. [2018-06-25 01:30:02,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:30:02,504 INFO ]: Finished difference Result 21 states and 203 transitions. [2018-06-25 01:30:02,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:30:02,516 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 01:30:02,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:30:02,517 INFO ]: With dead ends: 21 [2018-06-25 01:30:02,517 INFO ]: Without dead ends: 21 [2018-06-25 01:30:02,517 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:02,517 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 01:30:02,521 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-25 01:30:02,521 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 01:30:02,522 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 189 transitions. [2018-06-25 01:30:02,522 INFO ]: Start accepts. Automaton has 19 states and 189 transitions. Word has length 7 [2018-06-25 01:30:02,522 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:30:02,522 INFO ]: Abstraction has 19 states and 189 transitions. [2018-06-25 01:30:02,522 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:30:02,522 INFO ]: Start isEmpty. Operand 19 states and 189 transitions. [2018-06-25 01:30:02,523 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:30:02,523 INFO ]: Found error trace [2018-06-25 01:30:02,523 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:30:02,523 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:30:02,523 INFO ]: Analyzing trace with hash 519265922, now seen corresponding path program 1 times [2018-06-25 01:30:02,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:30:02,523 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:30:02,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:02,524 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:02,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:02,535 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:02,603 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 01:30:02,603 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:30:02,603 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:30:02,603 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:30:02,603 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:30:02,603 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:02,603 INFO ]: Start difference. First operand 19 states and 189 transitions. Second operand 3 states. [2018-06-25 01:30:02,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:30:02,829 INFO ]: Finished difference Result 19 states and 119 transitions. [2018-06-25 01:30:02,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:30:02,830 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 01:30:02,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:30:02,831 INFO ]: With dead ends: 19 [2018-06-25 01:30:02,831 INFO ]: Without dead ends: 16 [2018-06-25 01:30:02,831 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:02,831 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:30:02,834 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 01:30:02,834 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 01:30:02,834 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 37 transitions. [2018-06-25 01:30:02,834 INFO ]: Start accepts. Automaton has 16 states and 37 transitions. Word has length 8 [2018-06-25 01:30:02,834 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:30:02,834 INFO ]: Abstraction has 16 states and 37 transitions. [2018-06-25 01:30:02,834 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:30:02,834 INFO ]: Start isEmpty. Operand 16 states and 37 transitions. [2018-06-25 01:30:02,835 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 01:30:02,835 INFO ]: Found error trace [2018-06-25 01:30:02,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:30:02,835 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:30:02,835 INFO ]: Analyzing trace with hash -1067698230, now seen corresponding path program 1 times [2018-06-25 01:30:02,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:30:02,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:30:02,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:02,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:02,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:02,849 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:02,908 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 01:30:02,909 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:30:02,909 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:30:02,909 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:30:02,909 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:30:02,909 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:02,909 INFO ]: Start difference. First operand 16 states and 37 transitions. Second operand 3 states. [2018-06-25 01:30:02,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:30:02,971 INFO ]: Finished difference Result 25 states and 61 transitions. [2018-06-25 01:30:02,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:30:02,972 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 01:30:02,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:30:02,972 INFO ]: With dead ends: 25 [2018-06-25 01:30:02,972 INFO ]: Without dead ends: 25 [2018-06-25 01:30:02,972 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:02,973 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 01:30:02,975 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-25 01:30:02,975 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 01:30:02,976 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 58 transitions. [2018-06-25 01:30:02,976 INFO ]: Start accepts. Automaton has 23 states and 58 transitions. Word has length 9 [2018-06-25 01:30:02,976 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:30:02,976 INFO ]: Abstraction has 23 states and 58 transitions. [2018-06-25 01:30:02,976 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:30:02,976 INFO ]: Start isEmpty. Operand 23 states and 58 transitions. [2018-06-25 01:30:02,977 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 01:30:02,977 INFO ]: Found error trace [2018-06-25 01:30:02,977 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:30:02,977 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:30:02,977 INFO ]: Analyzing trace with hash -2016993594, now seen corresponding path program 1 times [2018-06-25 01:30:02,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:30:02,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:30:02,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:02,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:02,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:02,998 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:03,034 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 01:30:03,034 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:30:03,034 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:30:03,034 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:30:03,035 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:30:03,035 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:03,035 INFO ]: Start difference. First operand 23 states and 58 transitions. Second operand 3 states. [2018-06-25 01:30:03,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:30:03,067 INFO ]: Finished difference Result 23 states and 48 transitions. [2018-06-25 01:30:03,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:30:03,067 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 01:30:03,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:30:03,068 INFO ]: With dead ends: 23 [2018-06-25 01:30:03,068 INFO ]: Without dead ends: 23 [2018-06-25 01:30:03,068 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:30:03,068 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 01:30:03,072 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-06-25 01:30:03,072 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 01:30:03,072 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 47 transitions. [2018-06-25 01:30:03,073 INFO ]: Start accepts. Automaton has 22 states and 47 transitions. Word has length 13 [2018-06-25 01:30:03,073 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:30:03,073 INFO ]: Abstraction has 22 states and 47 transitions. [2018-06-25 01:30:03,073 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:30:03,073 INFO ]: Start isEmpty. Operand 22 states and 47 transitions. [2018-06-25 01:30:03,073 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 01:30:03,073 INFO ]: Found error trace [2018-06-25 01:30:03,073 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:30:03,073 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:30:03,074 INFO ]: Analyzing trace with hash -271325559, now seen corresponding path program 1 times [2018-06-25 01:30:03,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:30:03,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:30:03,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:03,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:03,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:30:03,095 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:03,156 INFO ]: Checked inductivity of 66 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 01:30:03,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:30:03,157 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:30:03,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:30:03,238 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:30:03,247 INFO ]: Computing forward predicates... [2018-06-25 01:30:03,354 INFO ]: Checked inductivity of 66 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 01:30:03,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:30:03,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 01:30:03,387 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:30:03,387 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:30:03,387 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:30:03,387 INFO ]: Start difference. First operand 22 states and 47 transitions. Second operand 6 states. [2018-06-25 01:30:03,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:30:03,716 INFO ]: Finished difference Result 44 states and 86 transitions. [2018-06-25 01:30:03,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 01:30:03,718 INFO ]: Start accepts. Automaton has 6 states. Word has length 16 [2018-06-25 01:30:03,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:30:03,718 INFO ]: With dead ends: 44 [2018-06-25 01:30:03,718 INFO ]: Without dead ends: 0 [2018-06-25 01:30:03,719 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-25 01:30:03,719 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 01:30:03,719 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 01:30:03,719 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 01:30:03,719 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 01:30:03,719 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-06-25 01:30:03,719 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:30:03,719 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 01:30:03,719 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:30:03,719 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 01:30:03,719 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 01:30:03,721 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 01:30:03,722 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:30:03 BasicIcfg [2018-06-25 01:30:03,722 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 01:30:03,723 INFO ]: Toolchain (without parser) took 31877.27 ms. Allocated memory was 309.9 MB in the beginning and 645.4 MB in the end (delta: 335.5 MB). Free memory was 264.2 MB in the beginning and 517.2 MB in the end (delta: -252.9 MB). Peak memory consumption was 82.6 MB. Max. memory is 3.6 GB. [2018-06-25 01:30:03,724 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:30:03,725 INFO ]: ChcToBoogie took 56.84 ms. Allocated memory is still 309.9 MB. Free memory was 264.2 MB in the beginning and 262.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:30:03,725 INFO ]: Boogie Preprocessor took 43.31 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:30:03,726 INFO ]: RCFGBuilder took 209.56 ms. Allocated memory is still 309.9 MB. Free memory was 260.3 MB in the beginning and 252.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:30:03,726 INFO ]: BlockEncodingV2 took 27726.99 ms. Allocated memory was 309.9 MB in the beginning and 429.9 MB in the end (delta: 120.1 MB). Free memory was 252.3 MB in the beginning and 237.8 MB in the end (delta: 14.4 MB). Peak memory consumption was 282.3 MB. Max. memory is 3.6 GB. [2018-06-25 01:30:03,727 INFO ]: TraceAbstraction took 3831.65 ms. Allocated memory was 429.9 MB in the beginning and 645.4 MB in the end (delta: 215.5 MB). Free memory was 237.8 MB in the beginning and 517.2 MB in the end (delta: -279.3 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:30:03,731 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.84 ms. Allocated memory is still 309.9 MB. Free memory was 264.2 MB in the beginning and 262.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.31 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 209.56 ms. Allocated memory is still 309.9 MB. Free memory was 260.3 MB in the beginning and 252.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 27726.99 ms. Allocated memory was 309.9 MB in the beginning and 429.9 MB in the end (delta: 120.1 MB). Free memory was 252.3 MB in the beginning and 237.8 MB in the end (delta: 14.4 MB). Peak memory consumption was 282.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3831.65 ms. Allocated memory was 429.9 MB in the beginning and 645.4 MB in the end (delta: 215.5 MB). Free memory was 237.8 MB in the beginning and 517.2 MB in the end (delta: -279.3 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 2 SDslu, 25 SDs, 0 SdLazy, 356 SolverSat, 259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 1463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 157/191 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_nest.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_01-30-03-743.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_nest.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_01-30-03-743.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_nest.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_01-30-03-743.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_nest.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_01-30-03-743.csv Received shutdown request...