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/NetBSD_glob3_iny.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 01:19:37,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 01:19:37,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 01:19:37,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 01:19:37,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 01:19:37,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 01:19:37,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 01:19:37,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 01:19:37,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 01:19:37,951 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 01:19:37,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 01:19:37,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 01:19:37,955 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 01:19:37,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 01:19:37,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 01:19:37,959 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 01:19:37,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 01:19:37,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 01:19:37,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 01:19:37,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 01:19:37,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 01:19:37,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 01:19:37,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 01:19:37,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 01:19:37,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 01:19:37,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 01:19:37,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 01:19:37,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 01:19:37,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 01:19:37,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 01:19:37,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 01:19:37,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 01:19:37,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 01:19:37,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 01:19:37,993 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 01:19:37,993 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 01:19:38,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 01:19:38,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 01:19:38,009 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 01:19:38,009 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 01:19:38,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 01:19:38,010 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 01:19:38,010 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 01:19:38,011 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 01:19:38,011 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 01:19:38,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 01:19:38,011 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 01:19:38,012 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 01:19:38,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:19:38,012 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 01:19:38,012 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 01:19:38,012 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 01:19:38,012 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 01:19:38,016 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 01:19:38,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 01:19:38,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 01:19:38,016 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 01:19:38,017 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 01:19:38,018 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 01:19:38,066 INFO ]: Repository-Root is: /tmp [2018-06-25 01:19:38,078 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 01:19:38,081 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 01:19:38,082 INFO ]: Initializing SmtParser... [2018-06-25 01:19:38,082 INFO ]: SmtParser initialized [2018-06-25 01:19:38,083 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/NetBSD_glob3_iny.c.smt2 [2018-06-25 01:19:38,084 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 01:19:38,171 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/NetBSD_glob3_iny.c.smt2 unknown [2018-06-25 01:19:38,588 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/NetBSD_glob3_iny.c.smt2 [2018-06-25 01:19:38,593 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 01:19:38,598 INFO ]: Walking toolchain with 5 elements. [2018-06-25 01:19:38,598 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 01:19:38,599 INFO ]: Initializing ChcToBoogie... [2018-06-25 01:19:38,599 INFO ]: ChcToBoogie initialized [2018-06-25 01:19:38,602 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:19:38" (1/1) ... [2018-06-25 01:19:38,653 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38 Unit [2018-06-25 01:19:38,654 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 01:19:38,654 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 01:19:38,654 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 01:19:38,654 INFO ]: Boogie Preprocessor initialized [2018-06-25 01:19:38,675 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (1/1) ... [2018-06-25 01:19:38,675 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (1/1) ... [2018-06-25 01:19:38,696 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (1/1) ... [2018-06-25 01:19:38,697 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (1/1) ... [2018-06-25 01:19:38,716 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (1/1) ... [2018-06-25 01:19:38,717 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (1/1) ... [2018-06-25 01:19:38,720 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (1/1) ... [2018-06-25 01:19:38,733 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 01:19:38,733 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 01:19:38,733 INFO ]: Initializing RCFGBuilder... [2018-06-25 01:19:38,733 INFO ]: RCFGBuilder initialized [2018-06-25 01:19:38,734 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 01:19:38,755 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 01:19:38,755 INFO ]: Found specification of procedure gotoProc [2018-06-25 01:19:38,755 INFO ]: Found implementation of procedure gotoProc [2018-06-25 01:19:38,755 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 01:19:38,755 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 01:19:38,755 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:19:39,081 INFO ]: Using library mode [2018-06-25 01:19:39,081 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:19:39 BoogieIcfgContainer [2018-06-25 01:19:39,081 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 01:19:39,082 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 01:19:39,082 INFO ]: Initializing BlockEncodingV2... [2018-06-25 01:19:39,083 INFO ]: BlockEncodingV2 initialized [2018-06-25 01:19:39,083 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:19:39" (1/1) ... [2018-06-25 01:19:39,098 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 01:19:39,099 INFO ]: Using Remove infeasible edges [2018-06-25 01:19:39,099 INFO ]: Using Maximize final states [2018-06-25 01:19:39,100 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 01:19:39,100 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 01:19:39,102 INFO ]: Using Remove sink states [2018-06-25 01:19:39,102 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 01:19:39,102 INFO ]: Using Use SBE [2018-06-25 01:19:39,108 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 01:19:39,280 WARN ]: aborting because of expected exponential blowup for input size 84 [2018-06-25 01:19:39,291 WARN ]: aborting because of expected exponential blowup for input size 84 [2018-06-25 01:19:39,291 INFO ]: SBE split 1 edges [2018-06-25 01:19:39,300 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 01:19:39,302 INFO ]: 0 new accepting states [2018-06-25 01:19:39,493 INFO ]: Removed 12 edges and 2 locations by large block encoding [2018-06-25 01:19:39,495 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:19:39,497 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 01:19:39,497 INFO ]: 0 new accepting states [2018-06-25 01:19:39,497 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 01:19:39,497 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:19:39,497 INFO ]: Encoded RCFG 6 locations, 14 edges [2018-06-25 01:19:39,497 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:19:39 BasicIcfg [2018-06-25 01:19:39,498 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 01:19:39,500 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 01:19:39,500 INFO ]: Initializing TraceAbstraction... [2018-06-25 01:19:39,504 INFO ]: TraceAbstraction initialized [2018-06-25 01:19:39,504 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:19:38" (1/4) ... [2018-06-25 01:19:39,505 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6890ec1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:19:39, skipping insertion in model container [2018-06-25 01:19:39,505 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:19:38" (2/4) ... [2018-06-25 01:19:39,505 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6890ec1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:19:39, skipping insertion in model container [2018-06-25 01:19:39,505 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:19:39" (3/4) ... [2018-06-25 01:19:39,505 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6890ec1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:19:39, skipping insertion in model container [2018-06-25 01:19:39,505 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:19:39" (4/4) ... [2018-06-25 01:19:39,508 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 01:19:39,520 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 01:19:39,529 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 01:19:39,573 INFO ]: Using default assertion order modulation [2018-06-25 01:19:39,574 INFO ]: Interprodecural is true [2018-06-25 01:19:39,574 INFO ]: Hoare is false [2018-06-25 01:19:39,574 INFO ]: Compute interpolants for FPandBP [2018-06-25 01:19:39,574 INFO ]: Backedges is TWOTRACK [2018-06-25 01:19:39,574 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 01:19:39,574 INFO ]: Difference is false [2018-06-25 01:19:39,574 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 01:19:39,574 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 01:19:39,585 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 01:19:39,595 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:19:39,595 INFO ]: Found error trace [2018-06-25 01:19:39,598 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:19:39,598 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:39,604 INFO ]: Analyzing trace with hash 35687018, now seen corresponding path program 1 times [2018-06-25 01:19:39,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:39,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:39,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:39,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:39,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:39,693 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:39,799 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:39,802 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:19:39,802 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:19:39,804 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:19:39,818 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:19:39,819 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:19:39,821 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 01:19:40,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:40,039 INFO ]: Finished difference Result 7 states and 15 transitions. [2018-06-25 01:19:40,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:19:40,041 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:19:40,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:40,050 INFO ]: With dead ends: 7 [2018-06-25 01:19:40,050 INFO ]: Without dead ends: 7 [2018-06-25 01:19:40,055 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:19:40,072 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 01:19:40,092 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 01:19:40,093 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:19:40,094 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-06-25 01:19:40,095 INFO ]: Start accepts. Automaton has 7 states and 15 transitions. Word has length 5 [2018-06-25 01:19:40,095 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:40,096 INFO ]: Abstraction has 7 states and 15 transitions. [2018-06-25 01:19:40,096 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:19:40,096 INFO ]: Start isEmpty. Operand 7 states and 15 transitions. [2018-06-25 01:19:40,096 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:19:40,096 INFO ]: Found error trace [2018-06-25 01:19:40,096 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:19:40,097 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:40,097 INFO ]: Analyzing trace with hash 35776391, now seen corresponding path program 1 times [2018-06-25 01:19:40,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:40,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:40,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:40,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:40,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:40,107 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:40,168 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:40,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:19:40,169 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:19:40,170 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:19:40,170 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:19:40,170 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:19:40,170 INFO ]: Start difference. First operand 7 states and 15 transitions. Second operand 3 states. [2018-06-25 01:19:40,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:40,319 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-25 01:19:40,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:19:40,320 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:19:40,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:40,320 INFO ]: With dead ends: 9 [2018-06-25 01:19:40,320 INFO ]: Without dead ends: 9 [2018-06-25 01:19:40,321 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:19:40,321 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:19:40,322 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:19:40,322 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:19:40,322 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-06-25 01:19:40,323 INFO ]: Start accepts. Automaton has 7 states and 15 transitions. Word has length 5 [2018-06-25 01:19:40,323 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:40,323 INFO ]: Abstraction has 7 states and 15 transitions. [2018-06-25 01:19:40,323 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:19:40,323 INFO ]: Start isEmpty. Operand 7 states and 15 transitions. [2018-06-25 01:19:40,324 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:19:40,324 INFO ]: Found error trace [2018-06-25 01:19:40,324 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:19:40,324 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:40,324 INFO ]: Analyzing trace with hash 35895555, now seen corresponding path program 1 times [2018-06-25 01:19:40,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:40,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:40,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:40,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:40,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:40,337 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:40,396 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:40,396 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:19:40,397 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:19:40,397 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:19:40,397 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:19:40,397 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:19:40,397 INFO ]: Start difference. First operand 7 states and 15 transitions. Second operand 3 states. [2018-06-25 01:19:40,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:40,498 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-25 01:19:40,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:19:40,499 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:19:40,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:40,499 INFO ]: With dead ends: 9 [2018-06-25 01:19:40,499 INFO ]: Without dead ends: 9 [2018-06-25 01:19:40,499 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:19:40,499 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:19:40,501 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:19:40,501 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:19:40,501 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-06-25 01:19:40,501 INFO ]: Start accepts. Automaton has 7 states and 15 transitions. Word has length 5 [2018-06-25 01:19:40,501 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:40,501 INFO ]: Abstraction has 7 states and 15 transitions. [2018-06-25 01:19:40,501 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:19:40,501 INFO ]: Start isEmpty. Operand 7 states and 15 transitions. [2018-06-25 01:19:40,502 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:19:40,502 INFO ]: Found error trace [2018-06-25 01:19:40,502 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:19:40,502 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:40,502 INFO ]: Analyzing trace with hash 1105541410, now seen corresponding path program 1 times [2018-06-25 01:19:40,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:40,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:40,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:40,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:40,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:40,575 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:40,923 WARN ]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 01:19:40,923 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:40,923 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:19:40,923 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:19:40,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:40,981 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:40,987 INFO ]: Computing forward predicates... [2018-06-25 01:19:41,995 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:42,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:19:42,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:19:42,029 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:19:42,030 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:19:42,030 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:19:42,030 INFO ]: Start difference. First operand 7 states and 15 transitions. Second operand 5 states. [2018-06-25 01:19:42,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:42,370 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-25 01:19:42,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 01:19:42,370 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:19:42,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:42,370 INFO ]: With dead ends: 11 [2018-06-25 01:19:42,370 INFO ]: Without dead ends: 11 [2018-06-25 01:19:42,371 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:19:42,371 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 01:19:42,372 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 01:19:42,372 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:19:42,372 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-25 01:19:42,372 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2018-06-25 01:19:42,372 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:42,372 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-25 01:19:42,372 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:19:42,373 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-25 01:19:42,373 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:19:42,373 INFO ]: Found error trace [2018-06-25 01:19:42,373 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:19:42,373 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:42,373 INFO ]: Analyzing trace with hash 1107388452, now seen corresponding path program 1 times [2018-06-25 01:19:42,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:42,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:42,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:42,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:42,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:42,428 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:42,538 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:42,538 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:19:42,538 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 01:19:42,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:42,606 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:42,609 INFO ]: Computing forward predicates... [2018-06-25 01:19:43,370 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:43,401 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:19:43,401 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:19:43,401 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:19:43,402 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:19:43,402 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:19:43,402 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 5 states. [2018-06-25 01:19:43,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:43,689 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-25 01:19:43,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 01:19:43,690 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:19:43,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:43,690 INFO ]: With dead ends: 14 [2018-06-25 01:19:43,690 INFO ]: Without dead ends: 14 [2018-06-25 01:19:43,690 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:19:43,690 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 01:19:43,692 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-25 01:19:43,692 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:19:43,692 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-25 01:19:43,692 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2018-06-25 01:19:43,692 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:43,692 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-25 01:19:43,692 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:19:43,692 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-25 01:19:43,692 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:19:43,692 INFO ]: Found error trace [2018-06-25 01:19:43,692 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:19:43,692 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:43,693 INFO ]: Analyzing trace with hash 1108311973, now seen corresponding path program 1 times [2018-06-25 01:19:43,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:43,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:43,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:43,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:43,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:43,725 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:43,799 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:43,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:19:43,799 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 01:19:43,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:43,840 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:43,842 INFO ]: Computing forward predicates... [2018-06-25 01:19:44,357 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:44,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:19:44,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:19:44,386 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:19:44,386 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:19:44,386 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:19:44,386 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 5 states. [2018-06-25 01:19:44,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:44,434 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-25 01:19:44,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 01:19:44,434 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:19:44,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:44,435 INFO ]: With dead ends: 12 [2018-06-25 01:19:44,435 INFO ]: Without dead ends: 12 [2018-06-25 01:19:44,435 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:19:44,435 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 01:19:44,436 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-25 01:19:44,436 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:19:44,437 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-25 01:19:44,437 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2018-06-25 01:19:44,437 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:44,437 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-25 01:19:44,437 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:19:44,437 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-25 01:19:44,437 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:19:44,437 INFO ]: Found error trace [2018-06-25 01:19:44,437 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:19:44,437 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:44,437 INFO ]: Analyzing trace with hash 1112929578, now seen corresponding path program 1 times [2018-06-25 01:19:44,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:44,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:44,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:44,438 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:44,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:44,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:44,547 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:44,547 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:19:44,547 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 01:19:44,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:44,602 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:44,607 INFO ]: Computing forward predicates... [2018-06-25 01:19:47,537 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:47,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:19:47,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:19:47,557 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:19:47,557 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:19:47,557 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:19:47,557 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 5 states. [2018-06-25 01:19:47,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:47,630 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-25 01:19:47,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 01:19:47,630 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:19:47,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:47,630 INFO ]: With dead ends: 13 [2018-06-25 01:19:47,630 INFO ]: Without dead ends: 13 [2018-06-25 01:19:47,631 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:19:47,631 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 01:19:47,632 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-25 01:19:47,632 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:19:47,632 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-25 01:19:47,633 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2018-06-25 01:19:47,633 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:47,633 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-25 01:19:47,633 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:19:47,633 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-25 01:19:47,633 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:19:47,633 INFO ]: Found error trace [2018-06-25 01:19:47,633 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:19:47,633 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:47,633 INFO ]: Analyzing trace with hash -88710806, now seen corresponding path program 2 times [2018-06-25 01:19:47,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:47,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:47,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:47,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:47,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:47,675 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:48,302 WARN ]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 01:19:48,537 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 01:19:48,538 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:48,538 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:19:48,538 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 01:19:48,554 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:19:48,637 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 01:19:48,637 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:48,640 INFO ]: Computing forward predicates... [2018-06-25 01:19:51,484 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 01:19:51,486 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:19:51,487 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:19:53,742 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:53,761 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:19:53,761 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:19:53,762 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:19:53,762 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:19:53,762 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:19:53,762 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 6 states. [2018-06-25 01:19:53,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:53,853 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-25 01:19:53,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:19:53,854 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:19:53,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:53,854 INFO ]: With dead ends: 13 [2018-06-25 01:19:53,854 INFO ]: Without dead ends: 13 [2018-06-25 01:19:53,855 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-25 01:19:53,855 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 01:19:53,856 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 01:19:53,856 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:19:53,857 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-06-25 01:19:53,857 INFO ]: Start accepts. Automaton has 9 states and 17 transitions. Word has length 7 [2018-06-25 01:19:53,857 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:53,857 INFO ]: Abstraction has 9 states and 17 transitions. [2018-06-25 01:19:53,857 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:19:53,857 INFO ]: Start isEmpty. Operand 9 states and 17 transitions. [2018-06-25 01:19:53,857 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:19:53,857 INFO ]: Found error trace [2018-06-25 01:19:53,857 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:19:53,857 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:53,857 INFO ]: Analyzing trace with hash 83064100, now seen corresponding path program 1 times [2018-06-25 01:19:53,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:53,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:53,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:53,858 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:19:53,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:53,899 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:54,065 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:54,065 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:19:54,065 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 01:19:54,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:54,115 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:54,117 INFO ]: Computing forward predicates... [2018-06-25 01:19:57,775 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:57,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:19:57,794 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:19:57,794 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:19:57,794 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:19:57,794 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:19:57,794 INFO ]: Start difference. First operand 9 states and 17 transitions. Second operand 6 states. [2018-06-25 01:19:57,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:19:57,876 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-25 01:19:57,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:19:57,877 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:19:57,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:19:57,877 INFO ]: With dead ends: 17 [2018-06-25 01:19:57,877 INFO ]: Without dead ends: 17 [2018-06-25 01:19:57,877 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-25 01:19:57,878 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 01:19:57,879 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 9. [2018-06-25 01:19:57,879 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:19:57,879 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-06-25 01:19:57,879 INFO ]: Start accepts. Automaton has 9 states and 17 transitions. Word has length 7 [2018-06-25 01:19:57,879 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:19:57,879 INFO ]: Abstraction has 9 states and 17 transitions. [2018-06-25 01:19:57,879 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:19:57,879 INFO ]: Start isEmpty. Operand 9 states and 17 transitions. [2018-06-25 01:19:57,880 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:19:57,880 INFO ]: Found error trace [2018-06-25 01:19:57,880 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 01:19:57,880 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:19:57,880 INFO ]: Analyzing trace with hash 1544176162, now seen corresponding path program 3 times [2018-06-25 01:19:57,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:19:57,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:19:57,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:57,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:19:57,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:19:57,929 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:58,244 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:19:58,244 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:19:58,244 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 01:19:58,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 01:19:58,327 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 01:19:58,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:19:58,330 INFO ]: Computing forward predicates... [2018-06-25 01:20:04,913 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:20:04,929 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:20:04,944 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 01:20:04,945 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:20:04,946 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 01:20:11,537 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:20:11,558 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:20:11,558 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-25 01:20:11,558 INFO ]: Interpolant automaton has 8 states [2018-06-25 01:20:11,558 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 01:20:11,558 INFO ]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 01:20:11,558 INFO ]: Start difference. First operand 9 states and 17 transitions. Second operand 8 states. [2018-06-25 01:20:11,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:20:11,764 INFO ]: Finished difference Result 18 states and 26 transitions. [2018-06-25 01:20:11,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 01:20:11,764 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-25 01:20:11,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:20:11,765 INFO ]: With dead ends: 18 [2018-06-25 01:20:11,765 INFO ]: Without dead ends: 18 [2018-06-25 01:20:11,765 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2018-06-25 01:20:11,765 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 01:20:11,766 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-06-25 01:20:11,766 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 01:20:11,767 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-25 01:20:11,767 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 8 [2018-06-25 01:20:11,767 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:20:11,767 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-25 01:20:11,767 INFO ]: Interpolant automaton has 8 states. [2018-06-25 01:20:11,767 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-25 01:20:11,767 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 01:20:11,767 INFO ]: Found error trace [2018-06-25 01:20:11,767 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 01:20:11,767 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:20:11,767 INFO ]: Analyzing trace with hash -1803975260, now seen corresponding path program 2 times [2018-06-25 01:20:11,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:20:11,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:20:11,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:20:11,768 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:20:11,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:20:11,841 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:20:12,096 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:20:12,096 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:20:12,096 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 01:20:12,102 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 01:20:12,198 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 01:20:12,198 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:20:12,203 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-25 01:20:43,740 INFO ]: Timeout while computing interpolants [2018-06-25 01:20:43,940 WARN ]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:20:43,941 WARN ]: Verification canceled [2018-06-25 01:20:43,943 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 01:20:43,944 WARN ]: Timeout [2018-06-25 01:20:43,944 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:20:43 BasicIcfg [2018-06-25 01:20:43,944 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 01:20:43,948 INFO ]: Toolchain (without parser) took 65354.16 ms. Allocated memory was 304.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 241.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 01:20:43,949 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:20:43,949 INFO ]: ChcToBoogie took 55.23 ms. Allocated memory is still 304.6 MB. Free memory was 241.1 MB in the beginning and 239.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:20:43,950 INFO ]: Boogie Preprocessor took 79.01 ms. Allocated memory is still 304.6 MB. Free memory was 239.1 MB in the beginning and 237.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:20:43,950 INFO ]: RCFGBuilder took 347.84 ms. Allocated memory is still 304.6 MB. Free memory was 237.1 MB in the beginning and 217.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:20:43,951 INFO ]: BlockEncodingV2 took 416.01 ms. Allocated memory is still 304.6 MB. Free memory was 217.1 MB in the beginning and 197.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 3.6 GB. [2018-06-25 01:20:43,954 INFO ]: TraceAbstraction took 64444.59 ms. Allocated memory was 304.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 197.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-25 01:20:43,961 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, 14 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.23 ms. Allocated memory is still 304.6 MB. Free memory was 241.1 MB in the beginning and 239.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 79.01 ms. Allocated memory is still 304.6 MB. Free memory was 239.1 MB in the beginning and 237.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 347.84 ms. Allocated memory is still 304.6 MB. Free memory was 237.1 MB in the beginning and 217.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 416.01 ms. Allocated memory is still 304.6 MB. Free memory was 217.1 MB in the beginning and 197.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 64444.59 ms. Allocated memory was 304.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 197.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. 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 analyzing trace of length 10 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 31 quantified variables from 43 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 64.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 0 SDslu, 72 SDs, 0 SdLazy, 148 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 40 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2062 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 0/32 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/NetBSD_glob3_iny.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_01-20-43-977.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/NetBSD_glob3_iny.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_01-20-43-977.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/NetBSD_glob3_iny.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_01-20-43-977.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/NetBSD_glob3_iny.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_01-20-43-977.csv Completed graceful shutdown