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/dillig03.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:48:29,698 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:48:29,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:48:29,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:48:29,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:48:29,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:48:29,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:48:29,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:48:29,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:48:29,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:48:29,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:48:29,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:48:29,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:48:29,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:48:29,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:48:29,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:48:29,743 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:48:29,745 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:48:29,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:48:29,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:48:29,749 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:48:29,751 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:48:29,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:48:29,752 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:48:29,753 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:48:29,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:48:29,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:48:29,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:48:29,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:48:29,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:48:29,763 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:48:29,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:48:29,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:48:29,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:48:29,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:48:29,772 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:48:29,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:48:29,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:48:29,797 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:48:29,797 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:48:29,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:48:29,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:48:29,802 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:48:29,802 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:48:29,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:48:29,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:48:29,803 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:48:29,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:48:29,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:48:29,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:48:29,803 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:48:29,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:48:29,804 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:48:29,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:48:29,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:48:29,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:48:29,805 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:48:29,807 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:48:29,808 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:48:29,857 INFO ]: Repository-Root is: /tmp [2018-06-25 00:48:29,874 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:48:29,879 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:48:29,881 INFO ]: Initializing SmtParser... [2018-06-25 00:48:29,881 INFO ]: SmtParser initialized [2018-06-25 00:48:29,882 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig03.c.smt2 [2018-06-25 00:48:29,883 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:48:29,975 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig03.c.smt2 unknown [2018-06-25 00:48:30,180 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig03.c.smt2 [2018-06-25 00:48:30,184 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:48:30,192 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:48:30,193 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:48:30,193 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:48:30,193 INFO ]: ChcToBoogie initialized [2018-06-25 00:48:30,196 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,258 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30 Unit [2018-06-25 00:48:30,258 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:48:30,259 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:48:30,259 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:48:30,259 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:48:30,274 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,274 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,279 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,280 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,283 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,284 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,286 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,287 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:48:30,288 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:48:30,288 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:48:30,288 INFO ]: RCFGBuilder initialized [2018-06-25 00:48:30,289 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (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:48:30,305 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:48:30,305 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:48:30,305 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:48:30,305 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:48:30,305 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:48:30,305 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 00:48:30,511 INFO ]: Using library mode [2018-06-25 00:48:30,511 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:48:30 BoogieIcfgContainer [2018-06-25 00:48:30,511 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:48:30,512 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:48:30,514 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:48:30,515 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:48:30,516 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:48:30" (1/1) ... [2018-06-25 00:48:30,541 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:48:30,542 INFO ]: Using Remove infeasible edges [2018-06-25 00:48:30,543 INFO ]: Using Maximize final states [2018-06-25 00:48:30,543 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:48:30,544 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:48:30,555 INFO ]: Using Remove sink states [2018-06-25 00:48:30,556 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:48:30,556 INFO ]: Using Use SBE [2018-06-25 00:48:30,570 WARN ]: expecting exponential blowup for input size 20 [2018-06-25 00:48:32,166 WARN ]: Simplifying disjunction of 142144 conjuctions. This might take some time... [2018-06-25 00:49:06,928 INFO ]: Simplified to disjunction of 2496 conjuctions. [2018-06-25 00:49:07,013 INFO ]: SBE split 1 edges [2018-06-25 00:49:07,019 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:49:07,021 INFO ]: 0 new accepting states [2018-06-25 00:49:07,076 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:49:07,077 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:49:07,081 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:49:07,082 INFO ]: 0 new accepting states [2018-06-25 00:49:07,082 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:49:07,082 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:49:07,083 INFO ]: Encoded RCFG 6 locations, 36 edges [2018-06-25 00:49:07,083 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:49:07 BasicIcfg [2018-06-25 00:49:07,083 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:49:07,086 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:49:07,086 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:49:07,089 INFO ]: TraceAbstraction initialized [2018-06-25 00:49:07,091 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:48:30" (1/4) ... [2018-06-25 00:49:07,091 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f04cdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:49:07, skipping insertion in model container [2018-06-25 00:49:07,092 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:30" (2/4) ... [2018-06-25 00:49:07,092 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f04cdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:49:07, skipping insertion in model container [2018-06-25 00:49:07,092 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:48:30" (3/4) ... [2018-06-25 00:49:07,092 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f04cdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:49:07, skipping insertion in model container [2018-06-25 00:49:07,092 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:49:07" (4/4) ... [2018-06-25 00:49:07,093 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:49:07,104 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:49:07,113 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:49:07,168 INFO ]: Using default assertion order modulation [2018-06-25 00:49:07,169 INFO ]: Interprodecural is true [2018-06-25 00:49:07,169 INFO ]: Hoare is false [2018-06-25 00:49:07,169 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:49:07,169 INFO ]: Backedges is TWOTRACK [2018-06-25 00:49:07,169 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:49:07,169 INFO ]: Difference is false [2018-06-25 00:49:07,169 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:49:07,169 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:49:07,183 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:49:07,196 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:49:07,196 INFO ]: Found error trace [2018-06-25 00:49:07,197 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:49:07,197 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:07,204 INFO ]: Analyzing trace with hash 36355874, now seen corresponding path program 1 times [2018-06-25 00:49:07,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:07,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:07,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:07,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:07,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:07,304 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:07,408 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:49:07,412 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:49:07,436 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:49:07,437 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:49:07,452 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:49:07,452 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:49:07,455 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:49:08,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:08,287 INFO ]: Finished difference Result 7 states and 58 transitions. [2018-06-25 00:49:08,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:49:08,288 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:49:08,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:08,297 INFO ]: With dead ends: 7 [2018-06-25 00:49:08,297 INFO ]: Without dead ends: 7 [2018-06-25 00:49:08,299 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:49:08,317 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:49:08,334 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:49:08,335 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:49:08,336 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-06-25 00:49:08,337 INFO ]: Start accepts. Automaton has 7 states and 58 transitions. Word has length 5 [2018-06-25 00:49:08,338 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:08,338 INFO ]: Abstraction has 7 states and 58 transitions. [2018-06-25 00:49:08,338 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:49:08,338 INFO ]: Start isEmpty. Operand 7 states and 58 transitions. [2018-06-25 00:49:08,339 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:49:08,339 INFO ]: Found error trace [2018-06-25 00:49:08,339 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:49:08,339 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:08,339 INFO ]: Analyzing trace with hash 1126766056, now seen corresponding path program 1 times [2018-06-25 00:49:08,339 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:08,339 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:08,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:08,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:08,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:08,348 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:08,416 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:49:08,416 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:49:08,416 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:49:08,417 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:49:08,417 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:49:08,418 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:49:08,418 INFO ]: Start difference. First operand 7 states and 58 transitions. Second operand 3 states. [2018-06-25 00:49:08,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:08,900 INFO ]: Finished difference Result 9 states and 89 transitions. [2018-06-25 00:49:08,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:49:08,900 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:49:08,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:08,901 INFO ]: With dead ends: 9 [2018-06-25 00:49:08,901 INFO ]: Without dead ends: 9 [2018-06-25 00:49:08,902 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:49:08,902 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:49:08,905 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:49:08,905 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:49:08,906 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2018-06-25 00:49:08,906 INFO ]: Start accepts. Automaton has 9 states and 89 transitions. Word has length 6 [2018-06-25 00:49:08,906 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:08,906 INFO ]: Abstraction has 9 states and 89 transitions. [2018-06-25 00:49:08,906 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:49:08,906 INFO ]: Start isEmpty. Operand 9 states and 89 transitions. [2018-06-25 00:49:08,906 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:49:08,906 INFO ]: Found error trace [2018-06-25 00:49:08,906 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:49:08,907 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:08,907 INFO ]: Analyzing trace with hash 1126170236, now seen corresponding path program 1 times [2018-06-25 00:49:08,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:08,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:08,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:08,907 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:08,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:08,914 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:08,927 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:49:08,928 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:49:08,928 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:49:08,928 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:49:08,928 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:49:08,928 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:49:08,928 INFO ]: Start difference. First operand 9 states and 89 transitions. Second operand 3 states. [2018-06-25 00:49:09,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:09,110 INFO ]: Finished difference Result 13 states and 132 transitions. [2018-06-25 00:49:09,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:49:09,110 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:49:09,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:09,111 INFO ]: With dead ends: 13 [2018-06-25 00:49:09,111 INFO ]: Without dead ends: 13 [2018-06-25 00:49:09,112 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:49:09,112 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:49:09,115 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:49:09,115 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:49:09,116 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2018-06-25 00:49:09,116 INFO ]: Start accepts. Automaton has 13 states and 132 transitions. Word has length 6 [2018-06-25 00:49:09,116 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:09,116 INFO ]: Abstraction has 13 states and 132 transitions. [2018-06-25 00:49:09,116 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:49:09,116 INFO ]: Start isEmpty. Operand 13 states and 132 transitions. [2018-06-25 00:49:09,117 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:49:09,117 INFO ]: Found error trace [2018-06-25 00:49:09,117 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:49:09,117 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:09,117 INFO ]: Analyzing trace with hash 1126646892, now seen corresponding path program 1 times [2018-06-25 00:49:09,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:09,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:09,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:09,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:09,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:09,124 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:09,159 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:49:09,159 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:49:09,159 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:49:09,159 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:49:09,160 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:49:09,160 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:49:09,160 INFO ]: Start difference. First operand 13 states and 132 transitions. Second operand 3 states. [2018-06-25 00:49:09,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:09,330 INFO ]: Finished difference Result 21 states and 205 transitions. [2018-06-25 00:49:09,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:49:09,330 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:49:09,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:09,331 INFO ]: With dead ends: 21 [2018-06-25 00:49:09,332 INFO ]: Without dead ends: 21 [2018-06-25 00:49:09,332 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:49:09,332 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:49:09,336 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-25 00:49:09,336 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 00:49:09,337 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2018-06-25 00:49:09,337 INFO ]: Start accepts. Automaton has 19 states and 191 transitions. Word has length 6 [2018-06-25 00:49:09,337 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:09,337 INFO ]: Abstraction has 19 states and 191 transitions. [2018-06-25 00:49:09,337 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:49:09,337 INFO ]: Start isEmpty. Operand 19 states and 191 transitions. [2018-06-25 00:49:09,338 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:49:09,338 INFO ]: Found error trace [2018-06-25 00:49:09,338 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:09,338 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:09,338 INFO ]: Analyzing trace with hash 348116627, now seen corresponding path program 1 times [2018-06-25 00:49:09,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:09,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:09,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:09,339 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:09,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:09,353 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:09,567 WARN ]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-25 00:49:09,615 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:49:09,616 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:49:09,616 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:49:09,616 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:49:09,616 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:49:09,616 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:49:09,616 INFO ]: Start difference. First operand 19 states and 191 transitions. Second operand 3 states. [2018-06-25 00:49:09,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:09,910 INFO ]: Finished difference Result 29 states and 304 transitions. [2018-06-25 00:49:09,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:49:09,911 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:49:09,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:09,912 INFO ]: With dead ends: 29 [2018-06-25 00:49:09,912 INFO ]: Without dead ends: 29 [2018-06-25 00:49:09,913 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:49:09,913 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 00:49:09,918 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-25 00:49:09,919 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 00:49:09,920 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 290 transitions. [2018-06-25 00:49:09,920 INFO ]: Start accepts. Automaton has 27 states and 290 transitions. Word has length 8 [2018-06-25 00:49:09,920 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:09,920 INFO ]: Abstraction has 27 states and 290 transitions. [2018-06-25 00:49:09,920 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:49:09,920 INFO ]: Start isEmpty. Operand 27 states and 290 transitions. [2018-06-25 00:49:09,921 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:49:09,921 INFO ]: Found error trace [2018-06-25 00:49:09,921 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:09,921 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:09,921 INFO ]: Analyzing trace with hash -1671003434, now seen corresponding path program 1 times [2018-06-25 00:49:09,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:09,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:09,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:09,922 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:09,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:09,930 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:09,945 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:49:09,945 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:49:09,945 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:49:09,945 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:49:09,945 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:49:09,945 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:49:09,946 INFO ]: Start difference. First operand 27 states and 290 transitions. Second operand 3 states. [2018-06-25 00:49:10,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:10,068 INFO ]: Finished difference Result 27 states and 199 transitions. [2018-06-25 00:49:10,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:49:10,069 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:49:10,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:10,069 INFO ]: With dead ends: 27 [2018-06-25 00:49:10,070 INFO ]: Without dead ends: 24 [2018-06-25 00:49:10,070 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:49:10,070 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 00:49:10,073 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 00:49:10,073 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 00:49:10,073 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2018-06-25 00:49:10,073 INFO ]: Start accepts. Automaton has 24 states and 66 transitions. Word has length 10 [2018-06-25 00:49:10,073 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:10,073 INFO ]: Abstraction has 24 states and 66 transitions. [2018-06-25 00:49:10,074 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:49:10,074 INFO ]: Start isEmpty. Operand 24 states and 66 transitions. [2018-06-25 00:49:10,074 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:49:10,074 INFO ]: Found error trace [2018-06-25 00:49:10,074 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:10,074 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:10,074 INFO ]: Analyzing trace with hash -1528089319, now seen corresponding path program 1 times [2018-06-25 00:49:10,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:10,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:10,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:10,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:10,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:10,093 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:10,178 INFO ]: Checked inductivity of 36 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 00:49:10,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:10,178 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:49:10,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:10,236 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:10,244 INFO ]: Computing forward predicates... [2018-06-25 00:49:10,334 INFO ]: Checked inductivity of 36 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 00:49:10,367 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:10,367 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:49:10,367 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:49:10,368 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:49:10,368 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:49:10,368 INFO ]: Start difference. First operand 24 states and 66 transitions. Second operand 5 states. [2018-06-25 00:49:10,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:10,878 INFO ]: Finished difference Result 53 states and 142 transitions. [2018-06-25 00:49:10,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:49:10,879 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-25 00:49:10,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:10,880 INFO ]: With dead ends: 53 [2018-06-25 00:49:10,880 INFO ]: Without dead ends: 51 [2018-06-25 00:49:10,881 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:49:10,881 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-25 00:49:10,885 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-06-25 00:49:10,885 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 00:49:10,886 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 110 transitions. [2018-06-25 00:49:10,886 INFO ]: Start accepts. Automaton has 39 states and 110 transitions. Word has length 13 [2018-06-25 00:49:10,886 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:10,886 INFO ]: Abstraction has 39 states and 110 transitions. [2018-06-25 00:49:10,886 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:49:10,886 INFO ]: Start isEmpty. Operand 39 states and 110 transitions. [2018-06-25 00:49:10,887 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 00:49:10,887 INFO ]: Found error trace [2018-06-25 00:49:10,887 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:10,887 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:10,887 INFO ]: Analyzing trace with hash 733359510, now seen corresponding path program 1 times [2018-06-25 00:49:10,887 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:10,887 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:10,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:10,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:10,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:10,911 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:10,967 INFO ]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 00:49:10,967 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:49:10,967 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:49:10,968 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:49:10,968 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:49:10,968 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:49:10,968 INFO ]: Start difference. First operand 39 states and 110 transitions. Second operand 3 states. [2018-06-25 00:49:11,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:11,055 INFO ]: Finished difference Result 39 states and 86 transitions. [2018-06-25 00:49:11,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:49:11,056 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-25 00:49:11,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:11,056 INFO ]: With dead ends: 39 [2018-06-25 00:49:11,056 INFO ]: Without dead ends: 39 [2018-06-25 00:49:11,057 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:49:11,057 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 00:49:11,061 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-06-25 00:49:11,061 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 00:49:11,062 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 83 transitions. [2018-06-25 00:49:11,062 INFO ]: Start accepts. Automaton has 38 states and 83 transitions. Word has length 20 [2018-06-25 00:49:11,062 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:11,062 INFO ]: Abstraction has 38 states and 83 transitions. [2018-06-25 00:49:11,062 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:49:11,062 INFO ]: Start isEmpty. Operand 38 states and 83 transitions. [2018-06-25 00:49:11,063 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 00:49:11,063 INFO ]: Found error trace [2018-06-25 00:49:11,063 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:11,063 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:11,063 INFO ]: Analyzing trace with hash -982344590, now seen corresponding path program 1 times [2018-06-25 00:49:11,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:11,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:11,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:11,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:11,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:11,088 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:11,200 INFO ]: Checked inductivity of 120 backedges. 29 proven. 71 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 00:49:11,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:11,201 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:49:11,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:11,284 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:11,289 INFO ]: Computing forward predicates... [2018-06-25 00:49:11,422 INFO ]: Checked inductivity of 120 backedges. 37 proven. 63 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 00:49:11,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:11,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-25 00:49:11,455 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:49:11,456 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:49:11,456 INFO ]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:49:11,456 INFO ]: Start difference. First operand 38 states and 83 transitions. Second operand 8 states. [2018-06-25 00:49:12,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:12,209 INFO ]: Finished difference Result 99 states and 219 transitions. [2018-06-25 00:49:12,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:49:12,209 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-25 00:49:12,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:12,210 INFO ]: With dead ends: 99 [2018-06-25 00:49:12,210 INFO ]: Without dead ends: 99 [2018-06-25 00:49:12,210 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:49:12,210 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-25 00:49:12,215 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 49. [2018-06-25 00:49:12,215 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-25 00:49:12,216 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 106 transitions. [2018-06-25 00:49:12,216 INFO ]: Start accepts. Automaton has 49 states and 106 transitions. Word has length 20 [2018-06-25 00:49:12,216 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:12,216 INFO ]: Abstraction has 49 states and 106 transitions. [2018-06-25 00:49:12,216 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:49:12,216 INFO ]: Start isEmpty. Operand 49 states and 106 transitions. [2018-06-25 00:49:12,217 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 00:49:12,217 INFO ]: Found error trace [2018-06-25 00:49:12,217 INFO ]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:12,217 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:12,217 INFO ]: Analyzing trace with hash -1713476077, now seen corresponding path program 2 times [2018-06-25 00:49:12,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:12,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:12,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:12,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:49:12,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:12,243 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:12,370 INFO ]: Checked inductivity of 276 backedges. 45 proven. 192 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 00:49:12,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:12,370 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:49:12,384 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:49:12,479 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:49:12,479 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:12,591 INFO ]: Computing forward predicates... [2018-06-25 00:49:12,914 INFO ]: Checked inductivity of 276 backedges. 45 proven. 192 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 00:49:12,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:12,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:49:12,934 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:49:12,934 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:49:12,934 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:49:12,934 INFO ]: Start difference. First operand 49 states and 106 transitions. Second operand 8 states. [2018-06-25 00:49:13,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:13,788 INFO ]: Finished difference Result 159 states and 362 transitions. [2018-06-25 00:49:13,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 00:49:13,788 INFO ]: Start accepts. Automaton has 8 states. Word has length 28 [2018-06-25 00:49:13,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:13,790 INFO ]: With dead ends: 159 [2018-06-25 00:49:13,790 INFO ]: Without dead ends: 159 [2018-06-25 00:49:13,790 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-06-25 00:49:13,790 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-25 00:49:13,796 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 65. [2018-06-25 00:49:13,796 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-25 00:49:13,797 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 146 transitions. [2018-06-25 00:49:13,797 INFO ]: Start accepts. Automaton has 65 states and 146 transitions. Word has length 28 [2018-06-25 00:49:13,797 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:13,797 INFO ]: Abstraction has 65 states and 146 transitions. [2018-06-25 00:49:13,797 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:49:13,797 INFO ]: Start isEmpty. Operand 65 states and 146 transitions. [2018-06-25 00:49:13,798 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 00:49:13,798 INFO ]: Found error trace [2018-06-25 00:49:13,799 INFO ]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:13,799 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:13,799 INFO ]: Analyzing trace with hash -1663683016, now seen corresponding path program 2 times [2018-06-25 00:49:13,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:13,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:13,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:13,800 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:49:13,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:13,823 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:13,974 INFO ]: Checked inductivity of 465 backedges. 59 proven. 356 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-25 00:49:13,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:13,974 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:49:13,980 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:49:14,076 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:49:14,076 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:14,085 INFO ]: Computing forward predicates... [2018-06-25 00:49:14,608 INFO ]: Checked inductivity of 465 backedges. 67 proven. 348 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-25 00:49:14,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:14,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-25 00:49:14,637 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:49:14,638 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:49:14,638 INFO ]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:49:14,638 INFO ]: Start difference. First operand 65 states and 146 transitions. Second operand 11 states. [2018-06-25 00:49:16,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:16,601 INFO ]: Finished difference Result 258 states and 594 transitions. [2018-06-25 00:49:16,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 00:49:16,602 INFO ]: Start accepts. Automaton has 11 states. Word has length 35 [2018-06-25 00:49:16,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:16,603 INFO ]: With dead ends: 258 [2018-06-25 00:49:16,603 INFO ]: Without dead ends: 258 [2018-06-25 00:49:16,604 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=290, Invalid=640, Unknown=0, NotChecked=0, Total=930 [2018-06-25 00:49:16,604 INFO ]: Start minimizeSevpa. Operand 258 states. [2018-06-25 00:49:16,612 INFO ]: Finished minimizeSevpa. Reduced states from 258 to 76. [2018-06-25 00:49:16,612 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-25 00:49:16,613 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 169 transitions. [2018-06-25 00:49:16,613 INFO ]: Start accepts. Automaton has 76 states and 169 transitions. Word has length 35 [2018-06-25 00:49:16,613 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:16,613 INFO ]: Abstraction has 76 states and 169 transitions. [2018-06-25 00:49:16,613 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:49:16,613 INFO ]: Start isEmpty. Operand 76 states and 169 transitions. [2018-06-25 00:49:16,614 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-25 00:49:16,614 INFO ]: Found error trace [2018-06-25 00:49:16,614 INFO ]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:16,615 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:16,615 INFO ]: Analyzing trace with hash -242818599, now seen corresponding path program 3 times [2018-06-25 00:49:16,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:16,615 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:16,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:16,616 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:49:16,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:16,642 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:16,931 INFO ]: Checked inductivity of 741 backedges. 75 proven. 597 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-25 00:49:16,931 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:16,931 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 00:49:16,947 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:49:17,071 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-06-25 00:49:17,071 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:17,079 INFO ]: Computing forward predicates... [2018-06-25 00:49:17,495 INFO ]: Checked inductivity of 741 backedges. 75 proven. 597 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-25 00:49:17,516 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:17,516 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-25 00:49:17,516 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:49:17,517 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:49:17,517 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:49:17,517 INFO ]: Start difference. First operand 76 states and 169 transitions. Second operand 11 states. [2018-06-25 00:49:18,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:18,777 INFO ]: Finished difference Result 348 states and 812 transitions. [2018-06-25 00:49:18,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 00:49:18,779 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-25 00:49:18,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:18,781 INFO ]: With dead ends: 348 [2018-06-25 00:49:18,781 INFO ]: Without dead ends: 348 [2018-06-25 00:49:18,782 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 48 SyntacticMatches, 24 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=405, Invalid=1077, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 00:49:18,782 INFO ]: Start minimizeSevpa. Operand 348 states. [2018-06-25 00:49:18,795 INFO ]: Finished minimizeSevpa. Reduced states from 348 to 92. [2018-06-25 00:49:18,795 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-25 00:49:18,796 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 209 transitions. [2018-06-25 00:49:18,796 INFO ]: Start accepts. Automaton has 92 states and 209 transitions. Word has length 43 [2018-06-25 00:49:18,797 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:18,797 INFO ]: Abstraction has 92 states and 209 transitions. [2018-06-25 00:49:18,797 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:49:18,797 INFO ]: Start isEmpty. Operand 92 states and 209 transitions. [2018-06-25 00:49:18,798 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-25 00:49:18,798 INFO ]: Found error trace [2018-06-25 00:49:18,798 INFO ]: trace histogram [8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:18,798 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:18,798 INFO ]: Analyzing trace with hash 1467946930, now seen corresponding path program 3 times [2018-06-25 00:49:18,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:18,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:18,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:18,800 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:49:18,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:18,946 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:19,892 INFO ]: Checked inductivity of 1035 backedges. 89 proven. 866 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-25 00:49:19,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:19,892 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:49:19,898 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:49:20,153 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-06-25 00:49:20,153 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:20,163 INFO ]: Computing forward predicates... [2018-06-25 00:49:20,710 INFO ]: Checked inductivity of 1035 backedges. 97 proven. 858 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-25 00:49:20,738 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:20,738 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-25 00:49:20,738 INFO ]: Interpolant automaton has 14 states [2018-06-25 00:49:20,738 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 00:49:20,738 INFO ]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:49:20,739 INFO ]: Start difference. First operand 92 states and 209 transitions. Second operand 14 states. [2018-06-25 00:49:22,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:22,725 INFO ]: Finished difference Result 498 states and 1167 transitions. [2018-06-25 00:49:22,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-25 00:49:22,752 INFO ]: Start accepts. Automaton has 14 states. Word has length 50 [2018-06-25 00:49:22,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:22,755 INFO ]: With dead ends: 498 [2018-06-25 00:49:22,755 INFO ]: Without dead ends: 498 [2018-06-25 00:49:22,757 INFO ]: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 29 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=873, Invalid=2433, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 00:49:22,757 INFO ]: Start minimizeSevpa. Operand 498 states. [2018-06-25 00:49:22,765 INFO ]: Finished minimizeSevpa. Reduced states from 498 to 103. [2018-06-25 00:49:22,766 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-25 00:49:22,767 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 232 transitions. [2018-06-25 00:49:22,767 INFO ]: Start accepts. Automaton has 103 states and 232 transitions. Word has length 50 [2018-06-25 00:49:22,767 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:22,767 INFO ]: Abstraction has 103 states and 232 transitions. [2018-06-25 00:49:22,767 INFO ]: Interpolant automaton has 14 states. [2018-06-25 00:49:22,767 INFO ]: Start isEmpty. Operand 103 states and 232 transitions. [2018-06-25 00:49:22,769 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-25 00:49:22,769 INFO ]: Found error trace [2018-06-25 00:49:22,769 INFO ]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:22,769 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:22,770 INFO ]: Analyzing trace with hash 1381738835, now seen corresponding path program 4 times [2018-06-25 00:49:22,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:22,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:22,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:22,770 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:49:22,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:22,797 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:23,002 INFO ]: Checked inductivity of 1431 backedges. 105 proven. 1227 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-25 00:49:23,002 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:23,002 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:49:23,009 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:49:23,174 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:49:23,174 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:23,188 INFO ]: Computing forward predicates... [2018-06-25 00:49:25,011 INFO ]: Checked inductivity of 1431 backedges. 105 proven. 1227 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-25 00:49:25,031 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:25,031 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-25 00:49:25,032 INFO ]: Interpolant automaton has 14 states [2018-06-25 00:49:25,032 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 00:49:25,032 INFO ]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:49:25,032 INFO ]: Start difference. First operand 103 states and 232 transitions. Second operand 14 states. [2018-06-25 00:49:28,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:28,309 INFO ]: Finished difference Result 618 states and 1460 transitions. [2018-06-25 00:49:28,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-06-25 00:49:28,330 INFO ]: Start accepts. Automaton has 14 states. Word has length 58 [2018-06-25 00:49:28,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:28,334 INFO ]: With dead ends: 618 [2018-06-25 00:49:28,334 INFO ]: Without dead ends: 618 [2018-06-25 00:49:28,335 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 60 SyntacticMatches, 39 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1136, Invalid=3556, Unknown=0, NotChecked=0, Total=4692 [2018-06-25 00:49:28,335 INFO ]: Start minimizeSevpa. Operand 618 states. [2018-06-25 00:49:28,353 INFO ]: Finished minimizeSevpa. Reduced states from 618 to 119. [2018-06-25 00:49:28,353 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-25 00:49:28,359 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 272 transitions. [2018-06-25 00:49:28,359 INFO ]: Start accepts. Automaton has 119 states and 272 transitions. Word has length 58 [2018-06-25 00:49:28,359 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:28,359 INFO ]: Abstraction has 119 states and 272 transitions. [2018-06-25 00:49:28,359 INFO ]: Interpolant automaton has 14 states. [2018-06-25 00:49:28,359 INFO ]: Start isEmpty. Operand 119 states and 272 transitions. [2018-06-25 00:49:28,360 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-25 00:49:28,360 INFO ]: Found error trace [2018-06-25 00:49:28,360 INFO ]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:28,360 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:28,360 INFO ]: Analyzing trace with hash -1420045576, now seen corresponding path program 4 times [2018-06-25 00:49:28,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:28,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:28,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:28,361 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:49:28,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:28,406 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:28,745 INFO ]: Checked inductivity of 1830 backedges. 119 proven. 1601 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-25 00:49:28,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:28,745 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:49:28,751 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:49:28,904 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:49:28,904 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:28,921 INFO ]: Computing forward predicates... [2018-06-25 00:49:29,631 INFO ]: Checked inductivity of 1830 backedges. 127 proven. 1593 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-25 00:49:29,652 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:29,652 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-06-25 00:49:29,652 INFO ]: Interpolant automaton has 17 states [2018-06-25 00:49:29,652 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 00:49:29,652 INFO ]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-06-25 00:49:29,652 INFO ]: Start difference. First operand 119 states and 272 transitions. Second operand 17 states. [2018-06-25 00:49:33,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:49:33,443 INFO ]: Finished difference Result 819 states and 1938 transitions. [2018-06-25 00:49:33,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-06-25 00:49:33,463 INFO ]: Start accepts. Automaton has 17 states. Word has length 65 [2018-06-25 00:49:33,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:49:33,468 INFO ]: With dead ends: 819 [2018-06-25 00:49:33,468 INFO ]: Without dead ends: 819 [2018-06-25 00:49:33,470 INFO ]: 0 DeclaredPredicates, 202 GetRequests, 66 SyntacticMatches, 44 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3265 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2083, Invalid=6659, Unknown=0, NotChecked=0, Total=8742 [2018-06-25 00:49:33,471 INFO ]: Start minimizeSevpa. Operand 819 states. [2018-06-25 00:49:33,491 INFO ]: Finished minimizeSevpa. Reduced states from 819 to 130. [2018-06-25 00:49:33,491 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-25 00:49:33,492 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 295 transitions. [2018-06-25 00:49:33,492 INFO ]: Start accepts. Automaton has 130 states and 295 transitions. Word has length 65 [2018-06-25 00:49:33,492 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:49:33,492 INFO ]: Abstraction has 130 states and 295 transitions. [2018-06-25 00:49:33,492 INFO ]: Interpolant automaton has 17 states. [2018-06-25 00:49:33,493 INFO ]: Start isEmpty. Operand 130 states and 295 transitions. [2018-06-25 00:49:33,494 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-25 00:49:33,494 INFO ]: Found error trace [2018-06-25 00:49:33,494 INFO ]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:49:33,494 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:49:33,494 INFO ]: Analyzing trace with hash -1845248359, now seen corresponding path program 5 times [2018-06-25 00:49:33,494 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:49:33,494 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:49:33,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:33,504 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:49:33,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:49:33,533 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:34,573 INFO ]: Checked inductivity of 2346 backedges. 135 proven. 2082 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-06-25 00:49:34,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:49:34,574 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:49:34,579 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:49:34,932 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-06-25 00:49:34,932 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:49:34,989 INFO ]: Computing forward predicates... [2018-06-25 00:49:35,785 INFO ]: Checked inductivity of 2346 backedges. 135 proven. 2082 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-06-25 00:49:35,806 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:49:35,806 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-25 00:49:35,806 INFO ]: Interpolant automaton has 17 states [2018-06-25 00:49:35,807 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 00:49:35,807 INFO ]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-06-25 00:49:35,807 INFO ]: Start difference. First operand 130 states and 295 transitions. Second operand 17 states. Received shutdown request... [2018-06-25 00:49:38,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-25 00:49:38,324 WARN ]: Verification canceled [2018-06-25 00:49:38,326 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:49:38,327 WARN ]: Timeout [2018-06-25 00:49:38,327 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:49:38 BasicIcfg [2018-06-25 00:49:38,327 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:49:38,328 INFO ]: Toolchain (without parser) took 68142.90 ms. Allocated memory was 307.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 262.1 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-25 00:49:38,328 INFO ]: SmtParser took 0.07 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 00:49:38,329 INFO ]: ChcToBoogie took 65.94 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 00:49:38,329 INFO ]: Boogie Preprocessor took 28.25 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: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:49:38,330 INFO ]: RCFGBuilder took 223.74 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 250.1 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:49:38,330 INFO ]: BlockEncodingV2 took 36571.21 ms. Allocated memory was 307.8 MB in the beginning and 681.1 MB in the end (delta: 373.3 MB). Free memory was 250.1 MB in the beginning and 337.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 362.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:49:38,331 INFO ]: TraceAbstraction took 31241.43 ms. Allocated memory was 681.1 MB in the beginning and 1.5 GB in the end (delta: 825.2 MB). Free memory was 337.9 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 798.8 MB. Max. memory is 3.6 GB. [2018-06-25 00:49:38,339 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.94 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 28.25 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: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 223.74 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 250.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 36571.21 ms. Allocated memory was 307.8 MB in the beginning and 681.1 MB in the end (delta: 373.3 MB). Free memory was 250.1 MB in the beginning and 337.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 362.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 31241.43 ms. Allocated memory was 681.1 MB in the beginning and 1.5 GB in the end (delta: 825.2 MB). Free memory was 337.9 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 798.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (130states) and interpolant automaton (currently 60 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 31.1s OverallTime, 16 OverallIterations, 13 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 2 SDslu, 264 SDs, 0 SdLazy, 11676 SolverSat, 3741 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1036 GetRequests, 438 SyntacticMatches, 215 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7769 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=15, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 2182 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 831 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 806 ConstructedInterpolants, 38 QuantifiedInterpolants, 245207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 8667 ConjunctsInSsa, 1279 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 2728/16704 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig03.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-49-38-354.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig03.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-49-38-354.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig03.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-49-38-354.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig03.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-49-38-354.csv Completed graceful shutdown