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/dillig07.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:49:40,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:49:40,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:49:40,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:49:40,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:49:40,949 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:49:40,950 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:49:40,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:49:40,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:49:40,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:49:40,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:49:40,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:49:40,962 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:49:40,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:49:40,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:49:40,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:49:40,966 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:49:40,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:49:40,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:49:40,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:49:40,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:49:40,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:49:40,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:49:40,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:49:40,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:49:40,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:49:40,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:49:40,977 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:49:40,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:49:40,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:49:40,979 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:49:40,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:49:40,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:49:40,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:49:40,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:49:40,982 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:49:40,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:49:40,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:49:40,995 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:49:40,996 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:49:40,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:49:40,997 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:49:40,997 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:49:40,997 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:49:40,998 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:49:40,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:49:40,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:49:40,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:49:40,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:49:40,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:49:40,999 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:49:40,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:49:41,000 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:49:41,000 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:49:41,000 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:49:41,000 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:49:41,001 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:49:41,002 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:49:41,002 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:49:41,055 INFO ]: Repository-Root is: /tmp [2018-06-25 00:49:41,078 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:49:41,083 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:49:41,085 INFO ]: Initializing SmtParser... [2018-06-25 00:49:41,085 INFO ]: SmtParser initialized [2018-06-25 00:49:41,086 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig07.c.smt2 [2018-06-25 00:49:41,087 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 00:49:41,179 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig07.c.smt2 unknown [2018-06-25 00:49:41,416 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig07.c.smt2 [2018-06-25 00:49:41,424 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:49:41,430 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:49:41,431 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:49:41,433 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:49:41,433 INFO ]: ChcToBoogie initialized [2018-06-25 00:49:41,437 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,493 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41 Unit [2018-06-25 00:49:41,493 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:49:41,494 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:49:41,494 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:49:41,494 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:49:41,515 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,516 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,522 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,522 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,528 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,530 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,531 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,533 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:49:41,533 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:49:41,534 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:49:41,534 INFO ]: RCFGBuilder initialized [2018-06-25 00:49:41,534 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (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-25 00:49:41,550 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:49:41,550 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:49:41,550 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:49:41,550 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:49:41,550 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:49:41,550 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 00:49:41,732 INFO ]: Using library mode [2018-06-25 00:49:41,733 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:49:41 BoogieIcfgContainer [2018-06-25 00:49:41,733 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:49:41,734 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:49:41,734 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:49:41,735 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:49:41,736 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:49:41" (1/1) ... [2018-06-25 00:49:41,774 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:49:41,775 INFO ]: Using Remove infeasible edges [2018-06-25 00:49:41,776 INFO ]: Using Maximize final states [2018-06-25 00:49:41,776 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:49:41,776 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:49:41,778 INFO ]: Using Remove sink states [2018-06-25 00:49:41,779 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:49:41,779 INFO ]: Using Use SBE [2018-06-25 00:49:41,803 WARN ]: expecting exponential blowup for input size 19 [2018-06-25 00:49:42,838 WARN ]: Simplifying disjunction of 74176 conjuctions. This might take some time... [2018-06-25 00:50:07,211 INFO ]: Simplified to disjunction of 2800 conjuctions. [2018-06-25 00:50:07,301 INFO ]: SBE split 1 edges [2018-06-25 00:50:07,307 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:50:07,309 INFO ]: 0 new accepting states [2018-06-25 00:50:07,359 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:50:07,361 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:50:07,368 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:50:07,369 INFO ]: 0 new accepting states [2018-06-25 00:50:07,369 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:50:07,369 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:50:07,370 INFO ]: Encoded RCFG 6 locations, 34 edges [2018-06-25 00:50:07,370 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:50:07 BasicIcfg [2018-06-25 00:50:07,370 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:50:07,373 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:50:07,373 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:50:07,377 INFO ]: TraceAbstraction initialized [2018-06-25 00:50:07,377 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:49:41" (1/4) ... [2018-06-25 00:50:07,378 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a0a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:50:07, skipping insertion in model container [2018-06-25 00:50:07,378 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:49:41" (2/4) ... [2018-06-25 00:50:07,378 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a0a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:50:07, skipping insertion in model container [2018-06-25 00:50:07,378 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:49:41" (3/4) ... [2018-06-25 00:50:07,379 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a0a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:50:07, skipping insertion in model container [2018-06-25 00:50:07,379 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:50:07" (4/4) ... [2018-06-25 00:50:07,381 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:50:07,390 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:50:07,403 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:50:07,467 INFO ]: Using default assertion order modulation [2018-06-25 00:50:07,467 INFO ]: Interprodecural is true [2018-06-25 00:50:07,467 INFO ]: Hoare is false [2018-06-25 00:50:07,467 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:50:07,467 INFO ]: Backedges is TWOTRACK [2018-06-25 00:50:07,467 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:50:07,467 INFO ]: Difference is false [2018-06-25 00:50:07,468 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:50:07,468 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:50:07,481 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:50:07,496 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:50:07,496 INFO ]: Found error trace [2018-06-25 00:50:07,497 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:50:07,497 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:07,504 INFO ]: Analyzing trace with hash 36294370, now seen corresponding path program 1 times [2018-06-25 00:50:07,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:07,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:07,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:07,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:07,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:07,612 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:07,720 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:50:07,722 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:50:07,722 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:50:07,724 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:50:07,739 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:50:07,739 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:50:07,742 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:50:08,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:08,527 INFO ]: Finished difference Result 7 states and 48 transitions. [2018-06-25 00:50:08,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:50:08,529 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:50:08,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:08,539 INFO ]: With dead ends: 7 [2018-06-25 00:50:08,539 INFO ]: Without dead ends: 7 [2018-06-25 00:50:08,541 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 00:50:08,562 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:50:08,579 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:50:08,580 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:50:08,581 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-06-25 00:50:08,582 INFO ]: Start accepts. Automaton has 7 states and 48 transitions. Word has length 5 [2018-06-25 00:50:08,583 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:08,583 INFO ]: Abstraction has 7 states and 48 transitions. [2018-06-25 00:50:08,583 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:50:08,583 INFO ]: Start isEmpty. Operand 7 states and 48 transitions. [2018-06-25 00:50:08,583 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:50:08,583 INFO ]: Found error trace [2018-06-25 00:50:08,583 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:50:08,584 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:08,584 INFO ]: Analyzing trace with hash 1124678764, now seen corresponding path program 1 times [2018-06-25 00:50:08,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:08,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:08,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:08,585 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:08,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:08,593 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:08,654 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:50:08,654 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:50:08,654 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:50:08,655 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:50:08,656 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:50:08,656 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:50:08,656 INFO ]: Start difference. First operand 7 states and 48 transitions. Second operand 3 states. [2018-06-25 00:50:09,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:09,050 INFO ]: Finished difference Result 9 states and 65 transitions. [2018-06-25 00:50:09,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:50:09,050 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:50:09,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:09,051 INFO ]: With dead ends: 9 [2018-06-25 00:50:09,051 INFO ]: Without dead ends: 8 [2018-06-25 00:50:09,052 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 00:50:09,052 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:50:09,053 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:50:09,053 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:50:09,053 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-06-25 00:50:09,053 INFO ]: Start accepts. Automaton has 8 states and 30 transitions. Word has length 6 [2018-06-25 00:50:09,053 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:09,053 INFO ]: Abstraction has 8 states and 30 transitions. [2018-06-25 00:50:09,053 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:50:09,053 INFO ]: Start isEmpty. Operand 8 states and 30 transitions. [2018-06-25 00:50:09,054 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:50:09,054 INFO ]: Found error trace [2018-06-25 00:50:09,054 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:50:09,054 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:09,054 INFO ]: Analyzing trace with hash 505124729, now seen corresponding path program 1 times [2018-06-25 00:50:09,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:09,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:09,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:09,055 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:09,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:09,067 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:09,092 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:50:09,092 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:50:09,092 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:50:09,092 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:50:09,092 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:50:09,092 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:50:09,092 INFO ]: Start difference. First operand 8 states and 30 transitions. Second operand 3 states. [2018-06-25 00:50:09,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:09,143 INFO ]: Finished difference Result 11 states and 42 transitions. [2018-06-25 00:50:09,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:50:09,143 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 00:50:09,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:09,144 INFO ]: With dead ends: 11 [2018-06-25 00:50:09,144 INFO ]: Without dead ends: 11 [2018-06-25 00:50:09,144 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 00:50:09,144 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:50:09,146 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:50:09,146 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:50:09,146 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2018-06-25 00:50:09,147 INFO ]: Start accepts. Automaton has 11 states and 42 transitions. Word has length 7 [2018-06-25 00:50:09,147 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:09,147 INFO ]: Abstraction has 11 states and 42 transitions. [2018-06-25 00:50:09,147 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:50:09,147 INFO ]: Start isEmpty. Operand 11 states and 42 transitions. [2018-06-25 00:50:09,147 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:50:09,147 INFO ]: Found error trace [2018-06-25 00:50:09,147 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:50:09,147 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:09,147 INFO ]: Analyzing trace with hash -1701267767, now seen corresponding path program 1 times [2018-06-25 00:50:09,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:09,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:09,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:09,149 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:09,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:09,158 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:09,198 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:50:09,198 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:50:09,198 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:50:09,199 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:50:09,199 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:50:09,199 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:50:09,199 INFO ]: Start difference. First operand 11 states and 42 transitions. Second operand 3 states. [2018-06-25 00:50:09,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:09,439 INFO ]: Finished difference Result 14 states and 38 transitions. [2018-06-25 00:50:09,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:50:09,440 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:50:09,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:09,441 INFO ]: With dead ends: 14 [2018-06-25 00:50:09,441 INFO ]: Without dead ends: 14 [2018-06-25 00:50:09,441 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 00:50:09,441 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:50:09,443 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 00:50:09,443 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:50:09,444 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2018-06-25 00:50:09,444 INFO ]: Start accepts. Automaton has 14 states and 38 transitions. Word has length 8 [2018-06-25 00:50:09,444 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:09,444 INFO ]: Abstraction has 14 states and 38 transitions. [2018-06-25 00:50:09,444 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:50:09,444 INFO ]: Start isEmpty. Operand 14 states and 38 transitions. [2018-06-25 00:50:09,444 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:50:09,444 INFO ]: Found error trace [2018-06-25 00:50:09,444 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:50:09,444 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:09,445 INFO ]: Analyzing trace with hash 859820694, now seen corresponding path program 1 times [2018-06-25 00:50:09,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:09,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:09,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:09,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:09,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:09,467 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:09,546 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:50:09,547 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:50:09,547 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:50:09,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:09,587 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:09,593 INFO ]: Computing forward predicates... [2018-06-25 00:50:09,726 INFO ]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:50:09,758 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:50:09,758 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-06-25 00:50:09,759 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:50:09,759 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:50:09,759 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:50:09,759 INFO ]: Start difference. First operand 14 states and 38 transitions. Second operand 6 states. [2018-06-25 00:50:10,385 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 00:50:11,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:11,166 INFO ]: Finished difference Result 43 states and 132 transitions. [2018-06-25 00:50:11,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:50:11,167 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-25 00:50:11,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:11,170 INFO ]: With dead ends: 43 [2018-06-25 00:50:11,170 INFO ]: Without dead ends: 43 [2018-06-25 00:50:11,170 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:50:11,170 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 00:50:11,175 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 24. [2018-06-25 00:50:11,175 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 00:50:11,176 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-06-25 00:50:11,176 INFO ]: Start accepts. Automaton has 24 states and 88 transitions. Word has length 9 [2018-06-25 00:50:11,176 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:11,176 INFO ]: Abstraction has 24 states and 88 transitions. [2018-06-25 00:50:11,177 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:50:11,177 INFO ]: Start isEmpty. Operand 24 states and 88 transitions. [2018-06-25 00:50:11,177 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:50:11,177 INFO ]: Found error trace [2018-06-25 00:50:11,177 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:50:11,177 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:11,177 INFO ]: Analyzing trace with hash -1319600756, now seen corresponding path program 1 times [2018-06-25 00:50:11,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:11,178 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:11,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:11,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:11,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:11,194 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:11,259 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:50:11,259 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:50:11,259 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:50:11,259 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:50:11,259 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:50:11,259 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:50:11,260 INFO ]: Start difference. First operand 24 states and 88 transitions. Second operand 3 states. [2018-06-25 00:50:11,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:11,433 INFO ]: Finished difference Result 24 states and 57 transitions. [2018-06-25 00:50:11,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:50:11,433 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:50:11,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:11,434 INFO ]: With dead ends: 24 [2018-06-25 00:50:11,434 INFO ]: Without dead ends: 24 [2018-06-25 00:50:11,434 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 00:50:11,434 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 00:50:11,437 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 00:50:11,437 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 00:50:11,438 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 57 transitions. [2018-06-25 00:50:11,438 INFO ]: Start accepts. Automaton has 24 states and 57 transitions. Word has length 12 [2018-06-25 00:50:11,438 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:11,438 INFO ]: Abstraction has 24 states and 57 transitions. [2018-06-25 00:50:11,438 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:50:11,438 INFO ]: Start isEmpty. Operand 24 states and 57 transitions. [2018-06-25 00:50:11,439 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:50:11,439 INFO ]: Found error trace [2018-06-25 00:50:11,439 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:50:11,439 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:11,439 INFO ]: Analyzing trace with hash -1985286247, now seen corresponding path program 1 times [2018-06-25 00:50:11,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:11,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:11,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:11,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:11,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:11,465 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:11,536 INFO ]: Checked inductivity of 36 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 00:50:11,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:50:11,536 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:50:11,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:11,592 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:11,595 INFO ]: Computing forward predicates... [2018-06-25 00:50:11,612 INFO ]: Checked inductivity of 36 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 00:50:11,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:50:11,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 00:50:11,645 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:50:11,645 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:50:11,645 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:50:11,645 INFO ]: Start difference. First operand 24 states and 57 transitions. Second operand 5 states. [2018-06-25 00:50:11,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:11,799 INFO ]: Finished difference Result 45 states and 99 transitions. [2018-06-25 00:50:11,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:50:11,799 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-25 00:50:11,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:11,800 INFO ]: With dead ends: 45 [2018-06-25 00:50:11,800 INFO ]: Without dead ends: 45 [2018-06-25 00:50:11,800 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:50:11,800 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 00:50:11,804 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-06-25 00:50:11,804 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 00:50:11,805 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 71 transitions. [2018-06-25 00:50:11,805 INFO ]: Start accepts. Automaton has 31 states and 71 transitions. Word has length 13 [2018-06-25 00:50:11,805 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:11,805 INFO ]: Abstraction has 31 states and 71 transitions. [2018-06-25 00:50:11,805 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:50:11,805 INFO ]: Start isEmpty. Operand 31 states and 71 transitions. [2018-06-25 00:50:11,806 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 00:50:11,806 INFO ]: Found error trace [2018-06-25 00:50:11,806 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:50:11,806 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:11,806 INFO ]: Analyzing trace with hash 951661684, now seen corresponding path program 2 times [2018-06-25 00:50:11,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:11,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:11,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:11,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:50:11,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:11,829 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:11,860 INFO ]: Checked inductivity of 55 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 00:50:11,860 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:50:11,860 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:50:11,860 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:50:11,860 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:50:11,860 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:50:11,861 INFO ]: Start difference. First operand 31 states and 71 transitions. Second operand 3 states. [2018-06-25 00:50:11,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:11,902 INFO ]: Finished difference Result 26 states and 34 transitions. [2018-06-25 00:50:11,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:50:11,903 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-25 00:50:11,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:11,903 INFO ]: With dead ends: 26 [2018-06-25 00:50:11,903 INFO ]: Without dead ends: 25 [2018-06-25 00:50:11,903 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 00:50:11,904 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 00:50:11,906 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-06-25 00:50:11,906 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 00:50:11,907 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-06-25 00:50:11,907 INFO ]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 15 [2018-06-25 00:50:11,907 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:11,907 INFO ]: Abstraction has 24 states and 32 transitions. [2018-06-25 00:50:11,907 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:50:11,907 INFO ]: Start isEmpty. Operand 24 states and 32 transitions. [2018-06-25 00:50:11,907 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:50:11,907 INFO ]: Found error trace [2018-06-25 00:50:11,907 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:50:11,908 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:50:11,908 INFO ]: Analyzing trace with hash 1265226524, now seen corresponding path program 3 times [2018-06-25 00:50:11,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:50:11,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:50:11,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:11,908 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:50:11,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:50:11,939 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:12,016 INFO ]: Checked inductivity of 78 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-25 00:50:12,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:50:12,017 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:50:12,023 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:50:12,149 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 00:50:12,149 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:50:12,153 INFO ]: Computing forward predicates... [2018-06-25 00:50:12,174 INFO ]: Checked inductivity of 78 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-25 00:50:12,208 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:50:12,208 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 00:50:12,209 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:50:12,209 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:50:12,209 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:50:12,209 INFO ]: Start difference. First operand 24 states and 32 transitions. Second operand 6 states. [2018-06-25 00:50:12,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:50:12,518 INFO ]: Finished difference Result 39 states and 49 transitions. [2018-06-25 00:50:12,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:50:12,518 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-25 00:50:12,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:50:12,518 INFO ]: With dead ends: 39 [2018-06-25 00:50:12,519 INFO ]: Without dead ends: 0 [2018-06-25 00:50:12,519 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:50:12,519 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 00:50:12,519 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 00:50:12,519 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 00:50:12,519 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 00:50:12,519 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-25 00:50:12,519 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:50:12,519 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 00:50:12,519 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:50:12,519 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 00:50:12,519 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 00:50:12,521 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:50:12,523 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:50:12 BasicIcfg [2018-06-25 00:50:12,523 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:50:12,523 INFO ]: Toolchain (without parser) took 31099.10 ms. Allocated memory was 304.6 MB in the beginning and 435.2 MB in the end (delta: 130.5 MB). Free memory was 260.0 MB in the beginning and 191.9 MB in the end (delta: 68.1 MB). Peak memory consumption was 198.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:50:12,524 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:50:12,527 INFO ]: ChcToBoogie took 63.07 ms. Allocated memory is still 304.6 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:50:12,527 INFO ]: Boogie Preprocessor took 38.95 ms. Allocated memory is still 304.6 MB. Free memory was 257.0 MB in the beginning and 256.0 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-25 00:50:12,529 INFO ]: RCFGBuilder took 199.79 ms. Allocated memory is still 304.6 MB. Free memory was 256.0 MB in the beginning and 247.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:50:12,530 INFO ]: BlockEncodingV2 took 25636.22 ms. Allocated memory was 304.6 MB in the beginning and 435.2 MB in the end (delta: 130.5 MB). Free memory was 247.0 MB in the beginning and 152.0 MB in the end (delta: 95.0 MB). Peak memory consumption was 227.8 MB. Max. memory is 3.6 GB. [2018-06-25 00:50:12,530 INFO ]: TraceAbstraction took 5150.00 ms. Allocated memory is still 435.2 MB. Free memory was 152.0 MB in the beginning and 191.9 MB in the end (delta: -39.9 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:50:12,540 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, 34 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.07 ms. Allocated memory is still 304.6 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.95 ms. Allocated memory is still 304.6 MB. Free memory was 257.0 MB in the beginning and 256.0 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 199.79 ms. Allocated memory is still 304.6 MB. Free memory was 256.0 MB in the beginning and 247.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 25636.22 ms. Allocated memory was 304.6 MB in the beginning and 435.2 MB in the end (delta: 130.5 MB). Free memory was 247.0 MB in the beginning and 152.0 MB in the end (delta: 95.0 MB). Peak memory consumption was 227.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5150.00 ms. Allocated memory is still 435.2 MB. Free memory was 152.0 MB in the beginning and 191.9 MB in the end (delta: -39.9 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, 5.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 2 SDslu, 46 SDs, 0 SdLazy, 400 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 9 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 3468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 702 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 229/341 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/dillig07.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-50-12-558.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig07.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-50-12-558.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig07.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-50-12-558.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig07.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-50-12-558.csv Received shutdown request...