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/xy10.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 01:40:58,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 01:40:58,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 01:40:58,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 01:40:58,867 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 01:40:58,868 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 01:40:58,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 01:40:58,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 01:40:58,873 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 01:40:58,874 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 01:40:58,875 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 01:40:58,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 01:40:58,876 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 01:40:58,877 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 01:40:58,878 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 01:40:58,878 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 01:40:58,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 01:40:58,884 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 01:40:58,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 01:40:58,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 01:40:58,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 01:40:58,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 01:40:58,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 01:40:58,891 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 01:40:58,892 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 01:40:58,893 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 01:40:58,894 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 01:40:58,895 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 01:40:58,896 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 01:40:58,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 01:40:58,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 01:40:58,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 01:40:58,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 01:40:58,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 01:40:58,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 01:40:58,899 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:40:58,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 01:40:58,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 01:40:58,914 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 01:40:58,914 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 01:40:58,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 01:40:58,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 01:40:58,916 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 01:40:58,916 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 01:40:58,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 01:40:58,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 01:40:58,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 01:40:58,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 01:40:58,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:40:58,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 01:40:58,918 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 01:40:58,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 01:40:58,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 01:40:58,919 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 01:40:58,919 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 01:40:58,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 01:40:58,919 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 01:40:58,921 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 01:40:58,921 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 01:40:58,972 INFO ]: Repository-Root is: /tmp [2018-06-25 01:40:58,988 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 01:40:58,991 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 01:40:58,993 INFO ]: Initializing SmtParser... [2018-06-25 01:40:58,993 INFO ]: SmtParser initialized [2018-06-25 01:40:58,994 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/xy10.c.smt2 [2018-06-25 01:40:58,996 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:40:59,104 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/xy10.c.smt2 unknown [2018-06-25 01:40:59,336 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/xy10.c.smt2 [2018-06-25 01:40:59,341 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 01:40:59,349 INFO ]: Walking toolchain with 5 elements. [2018-06-25 01:40:59,349 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 01:40:59,349 INFO ]: Initializing ChcToBoogie... [2018-06-25 01:40:59,349 INFO ]: ChcToBoogie initialized [2018-06-25 01:40:59,353 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,417 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59 Unit [2018-06-25 01:40:59,417 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 01:40:59,417 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 01:40:59,417 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 01:40:59,418 INFO ]: Boogie Preprocessor initialized [2018-06-25 01:40:59,439 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,439 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,445 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,446 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,448 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,454 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,455 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,457 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 01:40:59,462 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 01:40:59,462 INFO ]: Initializing RCFGBuilder... [2018-06-25 01:40:59,462 INFO ]: RCFGBuilder initialized [2018-06-25 01:40:59,467 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (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:40:59,479 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 01:40:59,479 INFO ]: Found specification of procedure gotoProc [2018-06-25 01:40:59,479 INFO ]: Found implementation of procedure gotoProc [2018-06-25 01:40:59,479 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 01:40:59,479 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 01:40:59,479 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:40:59,666 INFO ]: Using library mode [2018-06-25 01:40:59,667 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:40:59 BoogieIcfgContainer [2018-06-25 01:40:59,667 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 01:40:59,667 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 01:40:59,668 INFO ]: Initializing BlockEncodingV2... [2018-06-25 01:40:59,676 INFO ]: BlockEncodingV2 initialized [2018-06-25 01:40:59,677 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:40:59" (1/1) ... [2018-06-25 01:40:59,693 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 01:40:59,695 INFO ]: Using Remove infeasible edges [2018-06-25 01:40:59,696 INFO ]: Using Maximize final states [2018-06-25 01:40:59,696 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 01:40:59,697 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 01:40:59,700 INFO ]: Using Remove sink states [2018-06-25 01:40:59,701 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 01:40:59,701 INFO ]: Using Use SBE [2018-06-25 01:40:59,721 WARN ]: expecting exponential blowup for input size 16 [2018-06-25 01:41:00,785 WARN ]: Simplifying disjunction of 78240 conjuctions. This might take some time... [2018-06-25 01:41:21,002 INFO ]: Simplified to disjunction of 2192 conjuctions. [2018-06-25 01:41:21,115 INFO ]: SBE split 1 edges [2018-06-25 01:41:21,128 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 01:41:21,130 INFO ]: 0 new accepting states [2018-06-25 01:41:21,189 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 01:41:21,191 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:41:21,198 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 01:41:21,198 INFO ]: 0 new accepting states [2018-06-25 01:41:21,198 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 01:41:21,198 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:41:21,199 INFO ]: Encoded RCFG 6 locations, 42 edges [2018-06-25 01:41:21,199 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:41:21 BasicIcfg [2018-06-25 01:41:21,199 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 01:41:21,204 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 01:41:21,204 INFO ]: Initializing TraceAbstraction... [2018-06-25 01:41:21,208 INFO ]: TraceAbstraction initialized [2018-06-25 01:41:21,209 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:40:59" (1/4) ... [2018-06-25 01:41:21,210 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e277f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:41:21, skipping insertion in model container [2018-06-25 01:41:21,210 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:40:59" (2/4) ... [2018-06-25 01:41:21,210 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e277f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:41:21, skipping insertion in model container [2018-06-25 01:41:21,210 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:40:59" (3/4) ... [2018-06-25 01:41:21,210 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e277f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:41:21, skipping insertion in model container [2018-06-25 01:41:21,210 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:41:21" (4/4) ... [2018-06-25 01:41:21,213 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 01:41:21,223 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 01:41:21,232 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 01:41:21,286 INFO ]: Using default assertion order modulation [2018-06-25 01:41:21,286 INFO ]: Interprodecural is true [2018-06-25 01:41:21,286 INFO ]: Hoare is false [2018-06-25 01:41:21,286 INFO ]: Compute interpolants for FPandBP [2018-06-25 01:41:21,286 INFO ]: Backedges is TWOTRACK [2018-06-25 01:41:21,286 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 01:41:21,287 INFO ]: Difference is false [2018-06-25 01:41:21,287 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 01:41:21,287 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 01:41:21,301 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 01:41:21,316 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:41:21,317 INFO ]: Found error trace [2018-06-25 01:41:21,317 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:41:21,318 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:41:21,323 INFO ]: Analyzing trace with hash 36540386, now seen corresponding path program 1 times [2018-06-25 01:41:21,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:41:21,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:41:21,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:21,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:41:21,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:21,430 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:21,531 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:41:21,534 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:41:21,535 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:41:21,536 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:41:21,552 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:41:21,553 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:41:21,556 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 01:41:22,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:41:22,534 INFO ]: Finished difference Result 7 states and 56 transitions. [2018-06-25 01:41:22,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:41:22,535 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:41:22,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:41:22,545 INFO ]: With dead ends: 7 [2018-06-25 01:41:22,545 INFO ]: Without dead ends: 7 [2018-06-25 01:41:22,547 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:41:22,566 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 01:41:22,584 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 01:41:22,586 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:41:22,586 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-06-25 01:41:22,588 INFO ]: Start accepts. Automaton has 7 states and 56 transitions. Word has length 5 [2018-06-25 01:41:22,589 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:41:22,589 INFO ]: Abstraction has 7 states and 56 transitions. [2018-06-25 01:41:22,589 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:41:22,589 INFO ]: Start isEmpty. Operand 7 states and 56 transitions. [2018-06-25 01:41:22,589 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:41:22,589 INFO ]: Found error trace [2018-06-25 01:41:22,589 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:41:22,589 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:41:22,590 INFO ]: Analyzing trace with hash 1132402321, now seen corresponding path program 1 times [2018-06-25 01:41:22,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:41:22,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:41:22,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:22,591 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:41:22,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:22,599 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:22,659 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:41:22,659 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:41:22,660 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:41:22,661 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:41:22,661 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:41:22,661 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:41:22,661 INFO ]: Start difference. First operand 7 states and 56 transitions. Second operand 3 states. [2018-06-25 01:41:22,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:41:22,959 INFO ]: Finished difference Result 9 states and 78 transitions. [2018-06-25 01:41:22,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:41:22,960 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 01:41:22,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:41:22,961 INFO ]: With dead ends: 9 [2018-06-25 01:41:22,961 INFO ]: Without dead ends: 9 [2018-06-25 01:41:22,961 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:41:22,961 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:41:22,964 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 01:41:22,964 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:41:22,964 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2018-06-25 01:41:22,965 INFO ]: Start accepts. Automaton has 9 states and 78 transitions. Word has length 6 [2018-06-25 01:41:22,965 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:41:22,965 INFO ]: Abstraction has 9 states and 78 transitions. [2018-06-25 01:41:22,965 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:41:22,965 INFO ]: Start isEmpty. Operand 9 states and 78 transitions. [2018-06-25 01:41:22,965 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:41:22,965 INFO ]: Found error trace [2018-06-25 01:41:22,965 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:41:22,965 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:41:22,965 INFO ]: Analyzing trace with hash 744324356, now seen corresponding path program 1 times [2018-06-25 01:41:22,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:41:22,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:41:22,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:22,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:41:22,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:22,975 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:23,018 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:41:23,018 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:41:23,019 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:41:23,019 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:41:23,019 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:41:23,019 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:41:23,019 INFO ]: Start difference. First operand 9 states and 78 transitions. Second operand 3 states. [2018-06-25 01:41:23,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:41:23,231 INFO ]: Finished difference Result 13 states and 129 transitions. [2018-06-25 01:41:23,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:41:23,232 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 01:41:23,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:41:23,233 INFO ]: With dead ends: 13 [2018-06-25 01:41:23,233 INFO ]: Without dead ends: 13 [2018-06-25 01:41:23,233 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:41:23,233 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 01:41:23,238 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 01:41:23,239 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 01:41:23,239 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2018-06-25 01:41:23,240 INFO ]: Start accepts. Automaton has 12 states and 123 transitions. Word has length 7 [2018-06-25 01:41:23,240 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:41:23,240 INFO ]: Abstraction has 12 states and 123 transitions. [2018-06-25 01:41:23,240 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:41:23,240 INFO ]: Start isEmpty. Operand 12 states and 123 transitions. [2018-06-25 01:41:23,240 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:41:23,240 INFO ]: Found error trace [2018-06-25 01:41:23,240 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:41:23,240 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:41:23,240 INFO ]: Analyzing trace with hash 745247877, now seen corresponding path program 1 times [2018-06-25 01:41:23,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:41:23,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:41:23,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:23,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:41:23,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:23,251 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:23,282 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:41:23,283 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:41:23,283 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:41:23,283 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:41:23,283 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:41:23,283 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:41:23,283 INFO ]: Start difference. First operand 12 states and 123 transitions. Second operand 3 states. [2018-06-25 01:41:23,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:41:23,845 INFO ]: Finished difference Result 16 states and 132 transitions. [2018-06-25 01:41:23,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:41:23,845 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 01:41:23,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:41:23,845 INFO ]: With dead ends: 16 [2018-06-25 01:41:23,845 INFO ]: Without dead ends: 12 [2018-06-25 01:41:23,846 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:41:23,846 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 01:41:23,847 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 01:41:23,847 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 01:41:23,847 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2018-06-25 01:41:23,848 INFO ]: Start accepts. Automaton has 12 states and 35 transitions. Word has length 7 [2018-06-25 01:41:23,848 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:41:23,848 INFO ]: Abstraction has 12 states and 35 transitions. [2018-06-25 01:41:23,848 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:41:23,848 INFO ]: Start isEmpty. Operand 12 states and 35 transitions. [2018-06-25 01:41:23,848 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:41:23,848 INFO ]: Found error trace [2018-06-25 01:41:23,848 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:41:23,848 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:41:23,848 INFO ]: Analyzing trace with hash 1617458495, now seen corresponding path program 1 times [2018-06-25 01:41:23,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:41:23,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:41:23,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:23,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:41:23,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:23,867 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:23,904 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:41:23,904 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:41:23,904 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:41:23,904 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:41:23,904 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:41:23,904 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:41:23,905 INFO ]: Start difference. First operand 12 states and 35 transitions. Second operand 3 states. [2018-06-25 01:41:23,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:41:23,955 INFO ]: Finished difference Result 15 states and 46 transitions. [2018-06-25 01:41:23,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:41:23,955 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 01:41:23,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:41:23,956 INFO ]: With dead ends: 15 [2018-06-25 01:41:23,956 INFO ]: Without dead ends: 15 [2018-06-25 01:41:23,956 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-25 01:41:23,956 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 01:41:23,958 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 01:41:23,959 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 01:41:23,959 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2018-06-25 01:41:23,959 INFO ]: Start accepts. Automaton has 15 states and 46 transitions. Word has length 8 [2018-06-25 01:41:23,959 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:41:23,959 INFO ]: Abstraction has 15 states and 46 transitions. [2018-06-25 01:41:23,959 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:41:23,959 INFO ]: Start isEmpty. Operand 15 states and 46 transitions. [2018-06-25 01:41:23,960 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 01:41:23,960 INFO ]: Found error trace [2018-06-25 01:41:23,960 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:41:23,960 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:41:23,960 INFO ]: Analyzing trace with hash 797730189, now seen corresponding path program 1 times [2018-06-25 01:41:23,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:41:23,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:41:23,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:23,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:41:23,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:23,980 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:24,034 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 01:41:24,034 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:41:24,034 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:41:24,034 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:41:24,034 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:41:24,034 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:41:24,035 INFO ]: Start difference. First operand 15 states and 46 transitions. Second operand 3 states. [2018-06-25 01:41:24,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:41:24,062 INFO ]: Finished difference Result 15 states and 36 transitions. [2018-06-25 01:41:24,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:41:24,062 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 01:41:24,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:41:24,062 INFO ]: With dead ends: 15 [2018-06-25 01:41:24,062 INFO ]: Without dead ends: 15 [2018-06-25 01:41:24,062 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:41:24,062 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 01:41:24,064 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-25 01:41:24,064 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 01:41:24,065 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-06-25 01:41:24,065 INFO ]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 11 [2018-06-25 01:41:24,065 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:41:24,065 INFO ]: Abstraction has 14 states and 35 transitions. [2018-06-25 01:41:24,065 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:41:24,065 INFO ]: Start isEmpty. Operand 14 states and 35 transitions. [2018-06-25 01:41:24,065 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 01:41:24,065 INFO ]: Found error trace [2018-06-25 01:41:24,065 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:41:24,065 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:41:24,066 INFO ]: Analyzing trace with hash -745795199, now seen corresponding path program 1 times [2018-06-25 01:41:24,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:41:24,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:41:24,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:24,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:41:24,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:24,097 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:24,202 INFO ]: Checked inductivity of 28 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 01:41:24,202 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:41:24,202 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) [2018-06-25 01:41:24,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:41:24,269 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:24,276 INFO ]: Computing forward predicates... [2018-06-25 01:41:24,308 INFO ]: Checked inductivity of 28 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 01:41:24,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:41:24,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 01:41:24,343 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:41:24,343 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:41:24,343 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:41:24,343 INFO ]: Start difference. First operand 14 states and 35 transitions. Second operand 5 states. [2018-06-25 01:41:24,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:41:24,985 INFO ]: Finished difference Result 25 states and 60 transitions. [2018-06-25 01:41:24,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 01:41:24,986 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-25 01:41:24,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:41:24,988 INFO ]: With dead ends: 25 [2018-06-25 01:41:24,989 INFO ]: Without dead ends: 25 [2018-06-25 01:41:24,989 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:41:24,989 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 01:41:24,992 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-25 01:41:24,992 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 01:41:24,993 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. [2018-06-25 01:41:24,993 INFO ]: Start accepts. Automaton has 21 states and 52 transitions. Word has length 12 [2018-06-25 01:41:24,993 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:41:24,993 INFO ]: Abstraction has 21 states and 52 transitions. [2018-06-25 01:41:24,993 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:41:24,993 INFO ]: Start isEmpty. Operand 21 states and 52 transitions. [2018-06-25 01:41:24,994 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 01:41:24,994 INFO ]: Found error trace [2018-06-25 01:41:24,994 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:41:24,994 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:41:24,994 INFO ]: Analyzing trace with hash -922193998, now seen corresponding path program 2 times [2018-06-25 01:41:24,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:41:24,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:41:24,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:24,995 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:41:24,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:41:25,019 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:41:25,126 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 01:41:25,126 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:41:25,126 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:41:25,126 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:41:25,126 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:41:25,126 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:41:25,126 INFO ]: Start difference. First operand 21 states and 52 transitions. Second operand 3 states. [2018-06-25 01:41:25,148 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:41:25,148 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-25 01:41:25,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:41:25,149 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 01:41:25,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:41:25,149 INFO ]: With dead ends: 12 [2018-06-25 01:41:25,149 INFO ]: Without dead ends: 0 [2018-06-25 01:41:25,149 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:41:25,149 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 01:41:25,149 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 01:41:25,149 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 01:41:25,149 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 01:41:25,150 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-06-25 01:41:25,150 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:41:25,150 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 01:41:25,150 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:41:25,150 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 01:41:25,150 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 01:41:25,152 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 01:41:25,156 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:41:25 BasicIcfg [2018-06-25 01:41:25,156 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 01:41:25,157 INFO ]: Toolchain (without parser) took 25815.51 ms. Allocated memory was 307.8 MB in the beginning and 433.1 MB in the end (delta: 125.3 MB). Free memory was 263.1 MB in the beginning and 339.0 MB in the end (delta: -75.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. [2018-06-25 01:41:25,159 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:41:25,159 INFO ]: ChcToBoogie took 67.83 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.1 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:41:25,160 INFO ]: Boogie Preprocessor took 39.84 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 259.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 01:41:25,160 INFO ]: RCFGBuilder took 204.82 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 251.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. [2018-06-25 01:41:25,161 INFO ]: BlockEncodingV2 took 21532.01 ms. Allocated memory was 307.8 MB in the beginning and 433.1 MB in the end (delta: 125.3 MB). Free memory was 251.1 MB in the beginning and 256.8 MB in the end (delta: -5.7 MB). Peak memory consumption was 230.6 MB. Max. memory is 3.6 GB. [2018-06-25 01:41:25,161 INFO ]: TraceAbstraction took 3952.22 ms. Allocated memory is still 433.1 MB. Free memory was 256.8 MB in the beginning and 339.0 MB in the end (delta: -82.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:41:25,169 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, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.83 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.84 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 259.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 204.82 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 251.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 21532.01 ms. Allocated memory was 307.8 MB in the beginning and 433.1 MB in the end (delta: 125.3 MB). Free memory was 251.1 MB in the beginning and 256.8 MB in the end (delta: -5.7 MB). Peak memory consumption was 230.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3952.22 ms. Allocated memory is still 433.1 MB. Free memory was 256.8 MB in the beginning and 339.0 MB in the end (delta: -82.2 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.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 3 SDslu, 28 SDs, 0 SdLazy, 343 SolverSat, 229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 1196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 120/126 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/xy10.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_01-41-25-182.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/xy10.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_01-41-25-182.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/xy10.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_01-41-25-182.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/xy10.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_01-41-25-182.csv Received shutdown request...