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/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:52:42,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:52:42,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:52:42,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:52:42,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:52:42,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:52:42,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:52:42,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:52:42,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:52:42,907 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:52:42,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:52:42,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:52:42,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:52:42,911 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:52:42,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:52:42,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:52:42,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:52:42,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:52:42,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:52:42,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:52:42,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:52:42,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:52:42,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:52:42,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:52:42,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:52:42,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:52:42,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:52:42,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:52:42,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:52:42,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:52:42,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:52:42,946 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:52:42,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:52:42,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:52:42,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:52:42,947 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:52:42,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:52:42,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:52:42,973 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:52:42,974 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:52:42,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:52:42,975 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:52:42,975 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:52:42,975 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:52:42,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:52:42,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:52:42,976 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:52:42,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:52:42,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:52:42,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:52:42,976 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:52:42,977 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:52:42,978 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:52:42,978 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:52:42,978 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:52:42,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:52:42,979 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:52:42,980 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:52:42,980 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:52:43,032 INFO ]: Repository-Root is: /tmp [2018-06-24 20:52:43,049 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:52:43,054 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:52:43,056 INFO ]: Initializing SmtParser... [2018-06-24 20:52:43,056 INFO ]: SmtParser initialized [2018-06-24 20:52:43,056 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 [2018-06-24 20:52:43,058 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-24 20:52:43,135 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 unknown [2018-06-24 20:52:43,332 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 [2018-06-24 20:52:43,340 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:52:43,349 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:52:43,350 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:52:43,350 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:52:43,350 INFO ]: ChcToBoogie initialized [2018-06-24 20:52:43,353 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,413 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43 Unit [2018-06-24 20:52:43,413 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:52:43,414 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:52:43,414 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:52:43,414 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:52:43,433 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,433 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,437 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,437 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,441 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,442 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,443 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,446 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:52:43,446 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:52:43,446 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:52:43,446 INFO ]: RCFGBuilder initialized [2018-06-24 20:52:43,447 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (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-24 20:52:43,468 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:52:43,468 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:52:43,468 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:52:43,468 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:52:43,468 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:52:43,468 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-24 20:52:43,743 INFO ]: Using library mode [2018-06-24 20:52:43,743 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:43 BoogieIcfgContainer [2018-06-24 20:52:43,743 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:52:43,744 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:52:43,744 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:52:43,745 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:52:43,746 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:43" (1/1) ... [2018-06-24 20:52:43,759 INFO ]: Initial Icfg 13 locations, 17 edges [2018-06-24 20:52:43,761 INFO ]: Using Remove infeasible edges [2018-06-24 20:52:43,761 INFO ]: Using Maximize final states [2018-06-24 20:52:43,762 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:52:43,762 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:52:43,764 INFO ]: Using Remove sink states [2018-06-24 20:52:43,765 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:52:43,765 INFO ]: Using Use SBE [2018-06-24 20:52:43,771 INFO ]: SBE split 0 edges [2018-06-24 20:52:43,776 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:52:43,777 INFO ]: 0 new accepting states [2018-06-24 20:52:43,821 INFO ]: Removed 6 edges and 3 locations by large block encoding [2018-06-24 20:52:43,823 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:43,828 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:52:43,828 INFO ]: 0 new accepting states [2018-06-24 20:52:43,828 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:52:43,828 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:43,828 INFO ]: Encoded RCFG 8 locations, 12 edges [2018-06-24 20:52:43,829 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:52:43 BasicIcfg [2018-06-24 20:52:43,829 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:52:43,834 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:52:43,834 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:52:43,837 INFO ]: TraceAbstraction initialized [2018-06-24 20:52:43,837 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:52:43" (1/4) ... [2018-06-24 20:52:43,839 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4ba0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:52:43, skipping insertion in model container [2018-06-24 20:52:43,839 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:43" (2/4) ... [2018-06-24 20:52:43,839 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4ba0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:52:43, skipping insertion in model container [2018-06-24 20:52:43,839 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:43" (3/4) ... [2018-06-24 20:52:43,839 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4ba0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:52:43, skipping insertion in model container [2018-06-24 20:52:43,839 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:52:43" (4/4) ... [2018-06-24 20:52:43,841 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:52:43,851 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:52:43,859 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:52:43,901 INFO ]: Using default assertion order modulation [2018-06-24 20:52:43,901 INFO ]: Interprodecural is true [2018-06-24 20:52:43,901 INFO ]: Hoare is false [2018-06-24 20:52:43,901 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:52:43,901 INFO ]: Backedges is TWOTRACK [2018-06-24 20:52:43,902 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:52:43,902 INFO ]: Difference is false [2018-06-24 20:52:43,902 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:52:43,902 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:52:43,913 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 20:52:43,923 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:52:43,923 INFO ]: Found error trace [2018-06-24 20:52:43,924 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:43,924 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:43,928 INFO ]: Analyzing trace with hash -1922653189, now seen corresponding path program 1 times [2018-06-24 20:52:43,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:43,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:43,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:43,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:43,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,020 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:44,079 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:44,080 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:44,080 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:52:44,082 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:52:44,094 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:52:44,094 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:52:44,097 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 20:52:44,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:44,153 INFO ]: Finished difference Result 10 states and 17 transitions. [2018-06-24 20:52:44,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:52:44,154 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 20:52:44,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:44,161 INFO ]: With dead ends: 10 [2018-06-24 20:52:44,161 INFO ]: Without dead ends: 10 [2018-06-24 20:52:44,163 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-24 20:52:44,176 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:52:44,193 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-24 20:52:44,194 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:52:44,195 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-24 20:52:44,196 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-24 20:52:44,197 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:44,197 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-24 20:52:44,197 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:52:44,197 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-24 20:52:44,197 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:52:44,197 INFO ]: Found error trace [2018-06-24 20:52:44,197 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:44,197 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:44,197 INFO ]: Analyzing trace with hash -1921729668, now seen corresponding path program 1 times [2018-06-24 20:52:44,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:44,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:44,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:44,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,206 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:44,366 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:44,366 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:44,366 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:52:44,367 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:44,367 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:44,368 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:44,368 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 4 states. [2018-06-24 20:52:44,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:44,650 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-24 20:52:44,651 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:44,651 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:52:44,651 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:44,652 INFO ]: With dead ends: 13 [2018-06-24 20:52:44,652 INFO ]: Without dead ends: 13 [2018-06-24 20:52:44,652 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:44,652 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:52:44,654 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-24 20:52:44,654 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:52:44,654 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-24 20:52:44,654 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 7 [2018-06-24 20:52:44,655 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:44,655 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-24 20:52:44,655 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:44,655 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-24 20:52:44,655 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:52:44,655 INFO ]: Found error trace [2018-06-24 20:52:44,656 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:44,656 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:44,656 INFO ]: Analyzing trace with hash -879261931, now seen corresponding path program 1 times [2018-06-24 20:52:44,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:44,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:44,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:44,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,674 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:44,769 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:44,769 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:44,769 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:52:44,769 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:44,769 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:44,769 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:44,770 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 4 states. [2018-06-24 20:52:44,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:44,938 INFO ]: Finished difference Result 23 states and 36 transitions. [2018-06-24 20:52:44,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:44,939 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 20:52:44,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:44,941 INFO ]: With dead ends: 23 [2018-06-24 20:52:44,941 INFO ]: Without dead ends: 23 [2018-06-24 20:52:44,942 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:44,942 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:52:44,945 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-24 20:52:44,945 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:52:44,946 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2018-06-24 20:52:44,946 INFO ]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 9 [2018-06-24 20:52:44,946 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:44,946 INFO ]: Abstraction has 16 states and 26 transitions. [2018-06-24 20:52:44,946 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:44,946 INFO ]: Start isEmpty. Operand 16 states and 26 transitions. [2018-06-24 20:52:44,946 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:52:44,946 INFO ]: Found error trace [2018-06-24 20:52:44,946 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:44,947 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:44,947 INFO ]: Analyzing trace with hash -878338410, now seen corresponding path program 1 times [2018-06-24 20:52:44,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:44,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:44,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:44,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,962 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:45,070 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:45,070 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:45,070 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:52:45,070 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:45,070 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:45,070 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:45,070 INFO ]: Start difference. First operand 16 states and 26 transitions. Second operand 4 states. [2018-06-24 20:52:45,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:45,126 INFO ]: Finished difference Result 21 states and 36 transitions. [2018-06-24 20:52:45,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:45,126 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 20:52:45,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:45,127 INFO ]: With dead ends: 21 [2018-06-24 20:52:45,127 INFO ]: Without dead ends: 21 [2018-06-24 20:52:45,128 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:45,128 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:52:45,129 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-24 20:52:45,129 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:52:45,130 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-06-24 20:52:45,130 INFO ]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 9 [2018-06-24 20:52:45,130 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:45,130 INFO ]: Abstraction has 17 states and 27 transitions. [2018-06-24 20:52:45,130 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:45,130 INFO ]: Start isEmpty. Operand 17 states and 27 transitions. [2018-06-24 20:52:45,130 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:52:45,130 INFO ]: Found error trace [2018-06-24 20:52:45,130 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:45,131 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:45,131 INFO ]: Analyzing trace with hash 1783249112, now seen corresponding path program 1 times [2018-06-24 20:52:45,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:45,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:45,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:45,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:45,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:45,142 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:45,178 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:45,179 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:45,179 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:52:45,179 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:45,179 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:45,179 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:45,179 INFO ]: Start difference. First operand 17 states and 27 transitions. Second operand 4 states. [2018-06-24 20:52:45,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:45,233 INFO ]: Finished difference Result 23 states and 31 transitions. [2018-06-24 20:52:45,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:45,234 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 20:52:45,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:45,234 INFO ]: With dead ends: 23 [2018-06-24 20:52:45,234 INFO ]: Without dead ends: 20 [2018-06-24 20:52:45,235 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:45,235 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:52:45,237 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-24 20:52:45,237 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:52:45,237 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-24 20:52:45,237 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2018-06-24 20:52:45,238 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:45,238 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-24 20:52:45,238 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:45,238 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-24 20:52:45,238 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:52:45,238 INFO ]: Found error trace [2018-06-24 20:52:45,238 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:45,238 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:45,238 INFO ]: Analyzing trace with hash -1458952064, now seen corresponding path program 1 times [2018-06-24 20:52:45,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:45,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:45,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:45,239 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:45,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:45,259 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:45,462 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:45,463 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:45,463 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-24 20:52:45,469 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:45,502 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:45,522 INFO ]: Computing forward predicates... [2018-06-24 20:52:45,628 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:45,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:45,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-24 20:52:45,650 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:52:45,651 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:52:45,651 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:45,651 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 10 states. [2018-06-24 20:52:45,822 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-24 20:52:46,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:46,388 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-24 20:52:46,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:52:46,388 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:52:46,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:46,389 INFO ]: With dead ends: 25 [2018-06-24 20:52:46,389 INFO ]: Without dead ends: 25 [2018-06-24 20:52:46,389 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:52:46,389 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:52:46,391 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-24 20:52:46,391 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:52:46,392 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-24 20:52:46,392 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2018-06-24 20:52:46,392 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:46,392 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-24 20:52:46,392 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:52:46,392 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-24 20:52:46,392 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:52:46,392 INFO ]: Found error trace [2018-06-24 20:52:46,392 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:46,392 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:46,393 INFO ]: Analyzing trace with hash -525488355, now seen corresponding path program 1 times [2018-06-24 20:52:46,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:46,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:46,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:46,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:46,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:46,405 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:46,490 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:46,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:46,491 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-24 20:52:46,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:46,526 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:46,528 INFO ]: Computing forward predicates... [2018-06-24 20:52:46,633 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:46,652 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:46,652 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-24 20:52:46,653 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:52:46,653 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:52:46,653 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:46,653 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 10 states. [2018-06-24 20:52:46,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:46,940 INFO ]: Finished difference Result 22 states and 28 transitions. [2018-06-24 20:52:46,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:52:46,941 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:52:46,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:46,941 INFO ]: With dead ends: 22 [2018-06-24 20:52:46,941 INFO ]: Without dead ends: 22 [2018-06-24 20:52:46,942 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:52:46,942 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:52:46,944 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-06-24 20:52:46,944 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:52:46,944 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-06-24 20:52:46,944 INFO ]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 10 [2018-06-24 20:52:46,944 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:46,944 INFO ]: Abstraction has 17 states and 22 transitions. [2018-06-24 20:52:46,944 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:52:46,944 INFO ]: Start isEmpty. Operand 17 states and 22 transitions. [2018-06-24 20:52:46,945 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:52:46,945 INFO ]: Found error trace [2018-06-24 20:52:46,945 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:46,945 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:46,945 INFO ]: Analyzing trace with hash 854659313, now seen corresponding path program 2 times [2018-06-24 20:52:46,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:46,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:46,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:46,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:46,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:46,963 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:47,015 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:52:47,015 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:47,015 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-24 20:52:47,021 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:47,068 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:47,068 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:47,070 INFO ]: Computing forward predicates... [2018-06-24 20:52:47,123 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:47,146 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:47,146 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-24 20:52:47,146 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:52:47,146 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:52:47,146 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:47,146 INFO ]: Start difference. First operand 17 states and 22 transitions. Second operand 10 states. [2018-06-24 20:52:47,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:47,388 INFO ]: Finished difference Result 29 states and 36 transitions. [2018-06-24 20:52:47,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:52:47,388 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-24 20:52:47,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:47,388 INFO ]: With dead ends: 29 [2018-06-24 20:52:47,388 INFO ]: Without dead ends: 15 [2018-06-24 20:52:47,389 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:52:47,389 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:52:47,390 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:52:47,390 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:52:47,391 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-24 20:52:47,391 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2018-06-24 20:52:47,391 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:47,391 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-24 20:52:47,391 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:52:47,391 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-24 20:52:47,391 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:52:47,391 INFO ]: Found error trace [2018-06-24 20:52:47,391 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:47,391 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:47,392 INFO ]: Analyzing trace with hash -241227468, now seen corresponding path program 2 times [2018-06-24 20:52:47,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:47,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:47,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:47,393 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:47,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:47,407 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:47,609 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:47,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:47,609 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-24 20:52:47,616 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:47,635 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:47,635 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:47,637 INFO ]: Computing forward predicates... [2018-06-24 20:52:47,828 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:47,855 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:47,855 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-06-24 20:52:47,855 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:52:47,855 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:52:47,855 INFO ]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:52:47,856 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 15 states. [2018-06-24 20:52:48,325 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-24 20:52:48,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:48,411 INFO ]: Finished difference Result 25 states and 30 transitions. [2018-06-24 20:52:48,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:52:48,412 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-24 20:52:48,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:48,412 INFO ]: With dead ends: 25 [2018-06-24 20:52:48,412 INFO ]: Without dead ends: 25 [2018-06-24 20:52:48,413 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:52:48,413 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:52:48,415 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-24 20:52:48,415 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:52:48,415 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-24 20:52:48,415 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2018-06-24 20:52:48,415 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:48,415 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-24 20:52:48,415 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:52:48,415 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-24 20:52:48,416 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:52:48,416 INFO ]: Found error trace [2018-06-24 20:52:48,416 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:48,416 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:48,417 INFO ]: Analyzing trace with hash 2079346535, now seen corresponding path program 3 times [2018-06-24 20:52:48,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:48,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:48,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:48,417 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:48,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:48,448 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:48,578 INFO ]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:48,578 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:48,578 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:48,584 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:48,664 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:52:48,664 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:48,667 INFO ]: Computing forward predicates... [2018-06-24 20:52:48,921 INFO ]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:48,941 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:48,941 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-24 20:52:48,941 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:52:48,941 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:52:48,941 INFO ]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:52:48,941 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 18 states. [2018-06-24 20:52:49,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:49,276 INFO ]: Finished difference Result 31 states and 37 transitions. [2018-06-24 20:52:49,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:52:49,279 INFO ]: Start accepts. Automaton has 18 states. Word has length 16 [2018-06-24 20:52:49,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:49,280 INFO ]: With dead ends: 31 [2018-06-24 20:52:49,280 INFO ]: Without dead ends: 31 [2018-06-24 20:52:49,280 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:52:49,280 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:52:49,282 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-06-24 20:52:49,282 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:52:49,282 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-06-24 20:52:49,282 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2018-06-24 20:52:49,282 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:49,282 INFO ]: Abstraction has 19 states and 22 transitions. [2018-06-24 20:52:49,282 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:52:49,282 INFO ]: Start isEmpty. Operand 19 states and 22 transitions. [2018-06-24 20:52:49,288 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:52:49,288 INFO ]: Found error trace [2018-06-24 20:52:49,288 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:49,288 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:49,289 INFO ]: Analyzing trace with hash 34968015, now seen corresponding path program 4 times [2018-06-24 20:52:49,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:49,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:49,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:49,289 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:49,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:49,314 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:49,384 INFO ]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 20:52:49,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:49,384 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-24 20:52:49,402 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:49,432 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:49,432 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:49,435 INFO ]: Computing forward predicates... [2018-06-24 20:52:49,516 INFO ]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:52:49,538 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:49,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2018-06-24 20:52:49,538 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:52:49,539 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:52:49,539 INFO ]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:52:49,539 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 12 states. [2018-06-24 20:52:49,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:49,989 INFO ]: Finished difference Result 26 states and 31 transitions. [2018-06-24 20:52:49,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:52:49,989 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-24 20:52:49,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:49,989 INFO ]: With dead ends: 26 [2018-06-24 20:52:49,989 INFO ]: Without dead ends: 0 [2018-06-24 20:52:49,990 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=646, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:52:49,990 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 20:52:49,990 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 20:52:49,990 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 20:52:49,990 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 20:52:49,990 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-24 20:52:49,990 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:49,990 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 20:52:49,990 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:52:49,990 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 20:52:49,990 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 20:52:49,993 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:52:49,994 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:52:49 BasicIcfg [2018-06-24 20:52:49,994 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:52:49,995 INFO ]: Toolchain (without parser) took 6654.32 ms. Allocated memory was 302.0 MB in the beginning and 380.1 MB in the end (delta: 78.1 MB). Free memory was 255.4 MB in the beginning and 214.1 MB in the end (delta: 41.3 MB). Peak memory consumption was 119.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:49,996 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:52:49,996 INFO ]: ChcToBoogie took 64.01 ms. Allocated memory is still 302.0 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:49,996 INFO ]: Boogie Preprocessor took 31.52 ms. Allocated memory is still 302.0 MB. Free memory was 253.4 MB in the beginning and 252.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:52:49,997 INFO ]: RCFGBuilder took 296.99 ms. Allocated memory is still 302.0 MB. Free memory was 252.4 MB in the beginning and 242.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:49,997 INFO ]: BlockEncodingV2 took 85.20 ms. Allocated memory is still 302.0 MB. Free memory was 242.4 MB in the beginning and 240.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:49,998 INFO ]: TraceAbstraction took 6160.42 ms. Allocated memory was 302.0 MB in the beginning and 380.1 MB in the end (delta: 78.1 MB). Free memory was 239.4 MB in the beginning and 214.1 MB in the end (delta: 25.3 MB). Peak memory consumption was 103.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:50,001 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 17 edges - StatisticsResult: Encoded RCFG 8 locations, 12 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.01 ms. Allocated memory is still 302.0 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 31.52 ms. Allocated memory is still 302.0 MB. Free memory was 253.4 MB in the beginning and 252.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 296.99 ms. Allocated memory is still 302.0 MB. Free memory was 252.4 MB in the beginning and 242.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 85.20 ms. Allocated memory is still 302.0 MB. Free memory was 242.4 MB in the beginning and 240.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6160.42 ms. Allocated memory was 302.0 MB in the beginning and 380.1 MB in the end (delta: 78.1 MB). Free memory was 239.4 MB in the beginning and 214.1 MB in the end (delta: 25.3 MB). Peak memory consumption was 103.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 115 SDtfs, 93 SDslu, 288 SDs, 0 SdLazy, 669 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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, 11 MinimizatonAttempts, 50 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 6556 SizeOfPredicates, 66 NumberOfNonLiveVariables, 923 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 86/134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-52-50-012.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-52-50-012.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-52-50-012.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-52-50-012.csv Received shutdown request...