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/nested.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:40:24,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:40:24,103 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:40:24,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:40:24,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:40:24,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:40:24,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:40:24,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:40:24,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:40:24,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:40:24,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:40:24,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:40:24,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:40:24,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:40:24,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:40:24,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:40:24,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:40:24,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:40:24,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:40:24,141 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:40:24,142 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:40:24,143 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:40:24,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:40:24,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:40:24,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:40:24,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:40:24,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:40:24,157 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:40:24,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:40:24,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:40:24,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:40:24,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:40:24,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:40:24,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:40:24,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:40:24,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:40:24,166 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:40:24,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:40:24,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:40:24,192 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:40:24,193 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:40:24,194 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:40:24,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:40:24,197 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:40:24,198 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:40:24,198 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:40:24,198 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:40:24,198 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:40:24,198 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:40:24,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:40:24,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:40:24,199 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:40:24,199 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:40:24,199 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:40:24,199 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:40:24,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:40:24,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:40:24,200 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:40:24,202 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:40:24,202 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:40:24,249 INFO ]: Repository-Root is: /tmp [2018-06-26 21:40:24,264 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:40:24,269 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:40:24,271 INFO ]: Initializing SmtParser... [2018-06-26 21:40:24,272 INFO ]: SmtParser initialized [2018-06-26 21:40:24,272 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested.c.smt2 [2018-06-26 21:40:24,274 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 21:40:24,360 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested.c.smt2 unknown [2018-06-26 21:40:24,604 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested.c.smt2 [2018-06-26 21:40:24,608 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:40:24,616 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:40:24,617 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:40:24,617 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:40:24,617 INFO ]: ChcToBoogie initialized [2018-06-26 21:40:24,621 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,677 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24 Unit [2018-06-26 21:40:24,677 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:40:24,677 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:40:24,677 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:40:24,677 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:40:24,697 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,697 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,704 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,704 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,707 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,719 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,720 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,722 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:40:24,722 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:40:24,722 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:40:24,723 INFO ]: RCFGBuilder initialized [2018-06-26 21:40:24,723 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:40:24,749 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:40:24,749 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:40:24,749 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:40:24,749 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:40:24,749 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:40:24,749 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 21:40:24,971 INFO ]: Using library mode [2018-06-26 21:40:24,972 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:40:24 BoogieIcfgContainer [2018-06-26 21:40:24,972 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:40:24,972 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:40:24,972 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:40:24,973 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:40:24,974 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:40:24" (1/1) ... [2018-06-26 21:40:24,987 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:40:24,989 INFO ]: Using Remove infeasible edges [2018-06-26 21:40:24,989 INFO ]: Using Maximize final states [2018-06-26 21:40:24,990 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:40:24,990 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:40:24,991 INFO ]: Using Remove sink states [2018-06-26 21:40:24,992 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:40:24,992 INFO ]: Using Use SBE [2018-06-26 21:40:25,006 WARN ]: expecting exponential blowup for input size 20 [2018-06-26 21:40:30,295 INFO ]: SBE split 1 edges [2018-06-26 21:40:30,305 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:40:30,307 INFO ]: 0 new accepting states [2018-06-26 21:40:30,348 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 21:40:30,349 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:40:30,354 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:40:30,354 INFO ]: 0 new accepting states [2018-06-26 21:40:30,354 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:40:30,354 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:40:30,356 INFO ]: Encoded RCFG 6 locations, 77 edges [2018-06-26 21:40:30,357 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:40:30 BasicIcfg [2018-06-26 21:40:30,357 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:40:30,358 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:40:30,358 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:40:30,362 INFO ]: TraceAbstraction initialized [2018-06-26 21:40:30,362 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:40:24" (1/4) ... [2018-06-26 21:40:30,363 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e41232e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:40:30, skipping insertion in model container [2018-06-26 21:40:30,363 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:40:24" (2/4) ... [2018-06-26 21:40:30,363 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e41232e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:40:30, skipping insertion in model container [2018-06-26 21:40:30,363 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:40:24" (3/4) ... [2018-06-26 21:40:30,363 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e41232e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:40:30, skipping insertion in model container [2018-06-26 21:40:30,363 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:40:30" (4/4) ... [2018-06-26 21:40:30,365 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:40:30,377 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:40:30,386 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:40:30,445 INFO ]: Using default assertion order modulation [2018-06-26 21:40:30,445 INFO ]: Interprodecural is true [2018-06-26 21:40:30,445 INFO ]: Hoare is false [2018-06-26 21:40:30,445 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:40:30,445 INFO ]: Backedges is TWOTRACK [2018-06-26 21:40:30,446 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:40:30,446 INFO ]: Difference is false [2018-06-26 21:40:30,446 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:40:30,446 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:40:30,460 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:40:30,479 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:40:30,479 INFO ]: Found error trace [2018-06-26 21:40:30,480 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:40:30,480 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:30,486 INFO ]: Analyzing trace with hash 37616706, now seen corresponding path program 1 times [2018-06-26 21:40:30,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:30,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:30,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:30,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:30,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:30,571 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:30,636 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:40:30,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:30,638 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:30,640 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:30,650 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:30,651 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:30,653 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:40:31,708 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:31,708 INFO ]: Finished difference Result 7 states and 102 transitions. [2018-06-26 21:40:31,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:31,709 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:40:31,709 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:31,718 INFO ]: With dead ends: 7 [2018-06-26 21:40:31,718 INFO ]: Without dead ends: 7 [2018-06-26 21:40:31,720 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:31,734 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:40:31,751 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:40:31,752 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:40:31,753 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-06-26 21:40:31,754 INFO ]: Start accepts. Automaton has 7 states and 102 transitions. Word has length 5 [2018-06-26 21:40:31,755 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:31,755 INFO ]: Abstraction has 7 states and 102 transitions. [2018-06-26 21:40:31,755 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:31,755 INFO ]: Start isEmpty. Operand 7 states and 102 transitions. [2018-06-26 21:40:31,755 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:40:31,755 INFO ]: Found error trace [2018-06-26 21:40:31,756 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:40:31,756 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:31,756 INFO ]: Analyzing trace with hash 1165712503, now seen corresponding path program 1 times [2018-06-26 21:40:31,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:31,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:31,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:31,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:31,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:31,766 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:31,819 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:40:31,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:31,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:31,821 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:31,821 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:31,821 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:31,821 INFO ]: Start difference. First operand 7 states and 102 transitions. Second operand 3 states. [2018-06-26 21:40:32,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:32,453 INFO ]: Finished difference Result 9 states and 149 transitions. [2018-06-26 21:40:32,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:32,453 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:40:32,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:32,454 INFO ]: With dead ends: 9 [2018-06-26 21:40:32,454 INFO ]: Without dead ends: 9 [2018-06-26 21:40:32,454 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:32,455 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:40:32,458 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:40:32,458 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:40:32,459 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2018-06-26 21:40:32,459 INFO ]: Start accepts. Automaton has 9 states and 149 transitions. Word has length 6 [2018-06-26 21:40:32,459 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:32,459 INFO ]: Abstraction has 9 states and 149 transitions. [2018-06-26 21:40:32,459 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:32,459 INFO ]: Start isEmpty. Operand 9 states and 149 transitions. [2018-06-26 21:40:32,459 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:40:32,459 INFO ]: Found error trace [2018-06-26 21:40:32,459 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:40:32,459 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:32,459 INFO ]: Analyzing trace with hash 1729456988, now seen corresponding path program 1 times [2018-06-26 21:40:32,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:32,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:32,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:32,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:32,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:32,474 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:32,517 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:40:32,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:32,517 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:32,517 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:32,518 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:32,518 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:32,518 INFO ]: Start difference. First operand 9 states and 149 transitions. Second operand 3 states. [2018-06-26 21:40:32,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:32,758 INFO ]: Finished difference Result 13 states and 272 transitions. [2018-06-26 21:40:32,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:32,759 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 21:40:32,759 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:32,760 INFO ]: With dead ends: 13 [2018-06-26 21:40:32,760 INFO ]: Without dead ends: 13 [2018-06-26 21:40:32,760 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:32,760 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:40:32,764 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 21:40:32,764 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 21:40:32,766 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 261 transitions. [2018-06-26 21:40:32,766 INFO ]: Start accepts. Automaton has 12 states and 261 transitions. Word has length 7 [2018-06-26 21:40:32,766 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:32,766 INFO ]: Abstraction has 12 states and 261 transitions. [2018-06-26 21:40:32,766 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:32,766 INFO ]: Start isEmpty. Operand 12 states and 261 transitions. [2018-06-26 21:40:32,766 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:40:32,766 INFO ]: Found error trace [2018-06-26 21:40:32,766 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:40:32,767 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:32,767 INFO ]: Analyzing trace with hash 2113192797, now seen corresponding path program 1 times [2018-06-26 21:40:32,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:32,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:32,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:32,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:32,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:32,785 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:32,808 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:40:32,808 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:32,808 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:32,808 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:32,808 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:32,808 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:32,808 INFO ]: Start difference. First operand 12 states and 261 transitions. Second operand 3 states. [2018-06-26 21:40:33,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:33,023 INFO ]: Finished difference Result 13 states and 165 transitions. [2018-06-26 21:40:33,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:33,023 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:40:33,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:33,024 INFO ]: With dead ends: 13 [2018-06-26 21:40:33,024 INFO ]: Without dead ends: 13 [2018-06-26 21:40:33,024 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:33,024 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:40:33,028 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:40:33,028 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:40:33,029 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 165 transitions. [2018-06-26 21:40:33,029 INFO ]: Start accepts. Automaton has 13 states and 165 transitions. Word has length 8 [2018-06-26 21:40:33,029 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:33,029 INFO ]: Abstraction has 13 states and 165 transitions. [2018-06-26 21:40:33,029 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:33,029 INFO ]: Start isEmpty. Operand 13 states and 165 transitions. [2018-06-26 21:40:33,029 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:40:33,029 INFO ]: Found error trace [2018-06-26 21:40:33,030 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:40:33,030 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:33,030 INFO ]: Analyzing trace with hash 2071634352, now seen corresponding path program 1 times [2018-06-26 21:40:33,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:33,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:33,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:33,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:33,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:33,045 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:33,094 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:40:33,094 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:33,094 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:33,094 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:33,094 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:33,094 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:33,094 INFO ]: Start difference. First operand 13 states and 165 transitions. Second operand 3 states. [2018-06-26 21:40:33,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:33,345 INFO ]: Finished difference Result 22 states and 323 transitions. [2018-06-26 21:40:33,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:33,345 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:40:33,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:33,347 INFO ]: With dead ends: 22 [2018-06-26 21:40:33,347 INFO ]: Without dead ends: 22 [2018-06-26 21:40:33,347 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:33,347 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 21:40:33,352 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-26 21:40:33,352 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 21:40:33,353 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 307 transitions. [2018-06-26 21:40:33,353 INFO ]: Start accepts. Automaton has 19 states and 307 transitions. Word has length 8 [2018-06-26 21:40:33,353 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:33,353 INFO ]: Abstraction has 19 states and 307 transitions. [2018-06-26 21:40:33,353 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:33,353 INFO ]: Start isEmpty. Operand 19 states and 307 transitions. [2018-06-26 21:40:33,354 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:40:33,354 INFO ]: Found error trace [2018-06-26 21:40:33,354 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:40:33,354 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:33,354 INFO ]: Analyzing trace with hash 2072557873, now seen corresponding path program 1 times [2018-06-26 21:40:33,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:33,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:33,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:33,355 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:33,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:33,364 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:33,382 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:40:33,382 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:33,382 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:33,382 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:33,382 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:33,382 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:33,383 INFO ]: Start difference. First operand 19 states and 307 transitions. Second operand 3 states. [2018-06-26 21:40:33,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:33,637 INFO ]: Finished difference Result 16 states and 175 transitions. [2018-06-26 21:40:33,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:33,637 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:40:33,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:33,638 INFO ]: With dead ends: 16 [2018-06-26 21:40:33,638 INFO ]: Without dead ends: 16 [2018-06-26 21:40:33,638 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:33,638 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 21:40:33,641 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 21:40:33,641 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 21:40:33,641 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 175 transitions. [2018-06-26 21:40:33,641 INFO ]: Start accepts. Automaton has 16 states and 175 transitions. Word has length 8 [2018-06-26 21:40:33,641 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:33,642 INFO ]: Abstraction has 16 states and 175 transitions. [2018-06-26 21:40:33,642 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:33,642 INFO ]: Start isEmpty. Operand 16 states and 175 transitions. [2018-06-26 21:40:33,642 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:40:33,642 INFO ]: Found error trace [2018-06-26 21:40:33,642 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:40:33,642 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:33,642 INFO ]: Analyzing trace with hash -1569303585, now seen corresponding path program 1 times [2018-06-26 21:40:33,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:33,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:33,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:33,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:33,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:33,650 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:33,686 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 21:40:33,686 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:33,686 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:33,686 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:33,686 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:33,686 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:33,686 INFO ]: Start difference. First operand 16 states and 175 transitions. Second operand 3 states. [2018-06-26 21:40:33,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:33,814 INFO ]: Finished difference Result 27 states and 284 transitions. [2018-06-26 21:40:33,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:33,815 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 21:40:33,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:33,816 INFO ]: With dead ends: 27 [2018-06-26 21:40:33,816 INFO ]: Without dead ends: 27 [2018-06-26 21:40:33,816 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:33,816 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 21:40:33,820 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-06-26 21:40:33,820 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 21:40:33,821 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 261 transitions. [2018-06-26 21:40:33,821 INFO ]: Start accepts. Automaton has 24 states and 261 transitions. Word has length 10 [2018-06-26 21:40:33,821 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:33,821 INFO ]: Abstraction has 24 states and 261 transitions. [2018-06-26 21:40:33,821 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:33,821 INFO ]: Start isEmpty. Operand 24 states and 261 transitions. [2018-06-26 21:40:33,822 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:40:33,822 INFO ]: Found error trace [2018-06-26 21:40:33,822 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:40:33,822 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:33,822 INFO ]: Analyzing trace with hash -617405850, now seen corresponding path program 1 times [2018-06-26 21:40:33,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:33,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:33,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:33,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:33,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:33,833 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:33,887 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 21:40:33,887 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:33,887 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:33,888 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:33,888 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:33,888 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:33,888 INFO ]: Start difference. First operand 24 states and 261 transitions. Second operand 3 states. [2018-06-26 21:40:34,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:34,003 INFO ]: Finished difference Result 24 states and 218 transitions. [2018-06-26 21:40:34,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:34,004 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 21:40:34,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:34,005 INFO ]: With dead ends: 24 [2018-06-26 21:40:34,005 INFO ]: Without dead ends: 24 [2018-06-26 21:40:34,005 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:34,005 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 21:40:34,009 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 21:40:34,009 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 21:40:34,012 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 218 transitions. [2018-06-26 21:40:34,012 INFO ]: Start accepts. Automaton has 24 states and 218 transitions. Word has length 10 [2018-06-26 21:40:34,012 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:34,012 INFO ]: Abstraction has 24 states and 218 transitions. [2018-06-26 21:40:34,012 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:34,012 INFO ]: Start isEmpty. Operand 24 states and 218 transitions. [2018-06-26 21:40:34,012 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 21:40:34,012 INFO ]: Found error trace [2018-06-26 21:40:34,012 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:40:34,012 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:34,012 INFO ]: Analyzing trace with hash -861254941, now seen corresponding path program 1 times [2018-06-26 21:40:34,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:34,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:34,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:34,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:34,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:34,028 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:34,069 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 21:40:34,069 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:40:34,070 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:40:34,070 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:40:34,070 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:40:34,070 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:34,070 INFO ]: Start difference. First operand 24 states and 218 transitions. Second operand 3 states. [2018-06-26 21:40:34,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:34,176 INFO ]: Finished difference Result 19 states and 117 transitions. [2018-06-26 21:40:34,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:40:34,176 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 21:40:34,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:34,177 INFO ]: With dead ends: 19 [2018-06-26 21:40:34,177 INFO ]: Without dead ends: 16 [2018-06-26 21:40:34,177 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:40:34,177 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 21:40:34,179 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 21:40:34,179 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 21:40:34,179 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 37 transitions. [2018-06-26 21:40:34,179 INFO ]: Start accepts. Automaton has 16 states and 37 transitions. Word has length 11 [2018-06-26 21:40:34,179 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:34,179 INFO ]: Abstraction has 16 states and 37 transitions. [2018-06-26 21:40:34,180 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:40:34,180 INFO ]: Start isEmpty. Operand 16 states and 37 transitions. [2018-06-26 21:40:34,180 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 21:40:34,180 INFO ]: Found error trace [2018-06-26 21:40:34,180 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:40:34,180 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:40:34,180 INFO ]: Analyzing trace with hash 1444831744, now seen corresponding path program 1 times [2018-06-26 21:40:34,180 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:40:34,180 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:40:34,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:34,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:34,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:40:34,204 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:34,248 INFO ]: Checked inductivity of 36 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 21:40:34,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:40:34,248 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-26 21:40:34,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:40:34,321 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:40:34,331 INFO ]: Computing forward predicates... [2018-06-26 21:40:34,364 INFO ]: Checked inductivity of 36 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 21:40:34,397 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 21:40:34,397 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2018-06-26 21:40:34,397 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:40:34,398 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:40:34,398 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:40:34,398 INFO ]: Start difference. First operand 16 states and 37 transitions. Second operand 5 states. [2018-06-26 21:40:34,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:40:34,599 INFO ]: Finished difference Result 13 states and 30 transitions. [2018-06-26 21:40:34,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:40:34,599 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-26 21:40:34,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:40:34,599 INFO ]: With dead ends: 13 [2018-06-26 21:40:34,600 INFO ]: Without dead ends: 0 [2018-06-26 21:40:34,600 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:40:34,600 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 21:40:34,600 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 21:40:34,600 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 21:40:34,600 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 21:40:34,600 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-06-26 21:40:34,600 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:40:34,600 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 21:40:34,600 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:40:34,600 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 21:40:34,600 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 21:40:34,602 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:40:34,604 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:40:34 BasicIcfg [2018-06-26 21:40:34,604 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:40:34,605 INFO ]: Toolchain (without parser) took 9995.74 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 790.1 MB). Free memory was 259.6 MB in the beginning and 496.0 MB in the end (delta: -236.4 MB). Peak memory consumption was 553.8 MB. Max. memory is 3.6 GB. [2018-06-26 21:40:34,606 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:40:34,607 INFO ]: ChcToBoogie took 60.12 ms. Allocated memory is still 305.1 MB. Free memory was 259.6 MB in the beginning and 257.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:40:34,607 INFO ]: Boogie Preprocessor took 44.68 ms. Allocated memory is still 305.1 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:40:34,608 INFO ]: RCFGBuilder took 249.33 ms. Allocated memory is still 305.1 MB. Free memory was 255.6 MB in the beginning and 246.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:40:34,608 INFO ]: BlockEncodingV2 took 5384.63 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 773.8 MB). Free memory was 246.6 MB in the beginning and 355.1 MB in the end (delta: -108.5 MB). Peak memory consumption was 690.5 MB. Max. memory is 3.6 GB. [2018-06-26 21:40:34,609 INFO ]: TraceAbstraction took 4245.55 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.3 MB). Free memory was 355.1 MB in the beginning and 496.0 MB in the end (delta: -140.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:40:34,613 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, 77 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.12 ms. Allocated memory is still 305.1 MB. Free memory was 259.6 MB in the beginning and 257.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.68 ms. Allocated memory is still 305.1 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 249.33 ms. Allocated memory is still 305.1 MB. Free memory was 255.6 MB in the beginning and 246.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 5384.63 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 773.8 MB). Free memory was 246.6 MB in the beginning and 355.1 MB in the end (delta: -108.5 MB). Peak memory consumption was 690.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4245.55 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.3 MB). Free memory was 355.1 MB in the beginning and 496.0 MB in the end (delta: -140.8 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, 4.1s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 44 SDtfs, 4 SDslu, 30 SDs, 0 SdLazy, 1144 SolverSat, 727 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=7, 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, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 1303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 135/145 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/nested.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-40-34-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-40-34-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-40-34-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-40-34-626.csv Received shutdown request...