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/Consistency/point-location.43.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:34:30,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:34:30,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:34:30,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:34:30,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:34:30,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:34:30,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:34:30,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:34:30,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:34:30,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:34:30,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:34:30,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:34:30,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:34:30,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:34:30,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:34:30,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:34:30,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:34:30,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:34:30,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:34:30,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:34:30,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:34:30,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:34:30,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:34:30,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:34:30,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:34:30,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:34:30,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:34:30,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:34:30,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:34:30,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:34:30,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:34:30,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:34:30,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:34:30,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:34:30,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:34:30,883 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:34:30,905 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:34:30,905 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:34:30,906 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:34:30,906 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:34:30,907 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:34:30,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:34:30,908 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:34:30,908 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:34:30,908 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:34:30,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:34:30,909 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:34:30,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:34:30,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:34:30,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:34:30,910 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:34:30,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:34:30,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:34:30,914 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:34:30,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:34:30,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:34:30,914 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:34:30,916 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:34:30,916 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:34:30,970 INFO ]: Repository-Root is: /tmp [2018-06-24 20:34:30,988 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:34:30,996 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:34:30,997 INFO ]: Initializing SmtParser... [2018-06-24 20:34:30,998 INFO ]: SmtParser initialized [2018-06-24 20:34:30,998 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.43.smt2 [2018-06-24 20:34:30,999 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:34:31,089 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.43.smt2 unknown [2018-06-24 20:34:31,684 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.43.smt2 [2018-06-24 20:34:31,698 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:34:31,706 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:34:31,706 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:34:31,706 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:34:31,707 INFO ]: ChcToBoogie initialized [2018-06-24 20:34:31,710 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:34:31" (1/1) ... [2018-06-24 20:34:31,817 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31 Unit [2018-06-24 20:34:31,817 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:34:31,818 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:34:31,818 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:34:31,818 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:34:31,834 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (1/1) ... [2018-06-24 20:34:31,834 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (1/1) ... [2018-06-24 20:34:31,846 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (1/1) ... [2018-06-24 20:34:31,846 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (1/1) ... [2018-06-24 20:34:31,862 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (1/1) ... [2018-06-24 20:34:31,866 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (1/1) ... [2018-06-24 20:34:31,871 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (1/1) ... [2018-06-24 20:34:31,879 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:34:31,880 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:34:31,880 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:34:31,880 INFO ]: RCFGBuilder initialized [2018-06-24 20:34:31,881 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (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:34:31,897 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:34:31,897 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:34:31,897 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:34:31,897 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:34:31,897 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:34:31,897 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:34:33,846 INFO ]: Using library mode [2018-06-24 20:34:33,846 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:34:33 BoogieIcfgContainer [2018-06-24 20:34:33,846 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:34:33,847 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:34:33,847 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:34:33,848 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:34:33,848 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:34:33" (1/1) ... [2018-06-24 20:34:33,894 INFO ]: Initial Icfg 147 locations, 288 edges [2018-06-24 20:34:33,895 INFO ]: Using Remove infeasible edges [2018-06-24 20:34:33,896 INFO ]: Using Maximize final states [2018-06-24 20:34:33,896 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:34:33,897 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:34:33,898 INFO ]: Using Remove sink states [2018-06-24 20:34:33,899 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:34:33,899 INFO ]: Using Use SBE [2018-06-24 20:34:33,918 INFO ]: SBE split 0 edges [2018-06-24 20:34:33,931 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-24 20:34:33,934 INFO ]: 0 new accepting states [2018-06-24 20:34:34,716 INFO ]: Removed 55 edges and 8 locations by large block encoding [2018-06-24 20:34:34,719 INFO ]: Removed 5 edges and 2 locations by removing sink states [2018-06-24 20:34:34,749 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:34:34,749 INFO ]: 0 new accepting states [2018-06-24 20:34:34,752 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:34:34,752 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:34:34,754 INFO ]: Encoded RCFG 135 locations, 271 edges [2018-06-24 20:34:34,755 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:34:34 BasicIcfg [2018-06-24 20:34:34,755 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:34:34,756 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:34:34,756 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:34:34,759 INFO ]: TraceAbstraction initialized [2018-06-24 20:34:34,759 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:34:31" (1/4) ... [2018-06-24 20:34:34,760 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4b227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:34:34, skipping insertion in model container [2018-06-24 20:34:34,760 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:31" (2/4) ... [2018-06-24 20:34:34,760 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4b227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:34:34, skipping insertion in model container [2018-06-24 20:34:34,761 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:34:33" (3/4) ... [2018-06-24 20:34:34,761 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4b227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:34:34, skipping insertion in model container [2018-06-24 20:34:34,761 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:34:34" (4/4) ... [2018-06-24 20:34:34,763 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:34:34,770 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:34:34,777 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:34:34,813 INFO ]: Using default assertion order modulation [2018-06-24 20:34:34,813 INFO ]: Interprodecural is true [2018-06-24 20:34:34,813 INFO ]: Hoare is false [2018-06-24 20:34:34,813 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:34:34,813 INFO ]: Backedges is TWOTRACK [2018-06-24 20:34:34,813 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:34:34,813 INFO ]: Difference is false [2018-06-24 20:34:34,813 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:34:34,813 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:34:34,827 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:34:34,880 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:34:34,880 INFO ]: Found error trace [2018-06-24 20:34:34,881 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:34:34,882 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:34,888 INFO ]: Analyzing trace with hash 182597988, now seen corresponding path program 1 times [2018-06-24 20:34:34,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:34,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:34,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:34,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:34,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:35,003 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:35,192 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:34:35,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:35,194 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:34:35,196 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:34:35,211 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:34:35,211 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:34:35,214 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:34:37,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:37,186 INFO ]: Finished difference Result 267 states and 538 transitions. [2018-06-24 20:34:37,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:34:37,189 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:34:37,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:37,237 INFO ]: With dead ends: 267 [2018-06-24 20:34:37,237 INFO ]: Without dead ends: 267 [2018-06-24 20:34:37,243 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:34:37,260 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-24 20:34:37,370 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-24 20:34:37,371 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-24 20:34:37,391 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 538 transitions. [2018-06-24 20:34:37,392 INFO ]: Start accepts. Automaton has 267 states and 538 transitions. Word has length 5 [2018-06-24 20:34:37,393 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:37,393 INFO ]: Abstraction has 267 states and 538 transitions. [2018-06-24 20:34:37,393 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:34:37,393 INFO ]: Start isEmpty. Operand 267 states and 538 transitions. [2018-06-24 20:34:37,407 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:34:37,407 INFO ]: Found error trace [2018-06-24 20:34:37,408 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:34:37,408 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:37,408 INFO ]: Analyzing trace with hash 182656609, now seen corresponding path program 1 times [2018-06-24 20:34:37,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:37,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:37,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:37,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:37,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:37,475 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:37,562 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:34:37,562 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:37,562 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:34:37,563 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:34:37,563 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:34:37,563 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:34:37,564 INFO ]: Start difference. First operand 267 states and 538 transitions. Second operand 3 states. [2018-06-24 20:34:39,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:39,298 INFO ]: Finished difference Result 399 states and 806 transitions. [2018-06-24 20:34:39,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:34:39,299 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:34:39,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:39,321 INFO ]: With dead ends: 399 [2018-06-24 20:34:39,321 INFO ]: Without dead ends: 399 [2018-06-24 20:34:39,322 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:34:39,322 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-24 20:34:39,403 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-24 20:34:39,403 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-24 20:34:39,420 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 806 transitions. [2018-06-24 20:34:39,420 INFO ]: Start accepts. Automaton has 399 states and 806 transitions. Word has length 5 [2018-06-24 20:34:39,420 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:39,420 INFO ]: Abstraction has 399 states and 806 transitions. [2018-06-24 20:34:39,420 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:34:39,420 INFO ]: Start isEmpty. Operand 399 states and 806 transitions. [2018-06-24 20:34:39,484 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:34:39,484 INFO ]: Found error trace [2018-06-24 20:34:39,484 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:34:39,484 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:39,484 INFO ]: Analyzing trace with hash 2074942367, now seen corresponding path program 1 times [2018-06-24 20:34:39,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:39,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:39,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:39,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:39,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:39,538 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:39,939 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:34:39,940 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:40,012 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:34:40,012 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:34:40,012 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:34:40,012 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:34:40,013 INFO ]: Start difference. First operand 399 states and 806 transitions. Second operand 6 states. [2018-06-24 20:34:47,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:47,056 INFO ]: Finished difference Result 1448 states and 5095 transitions. [2018-06-24 20:34:47,057 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:34:47,057 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:34:47,057 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:47,296 INFO ]: With dead ends: 1448 [2018-06-24 20:34:47,296 INFO ]: Without dead ends: 1311 [2018-06-24 20:34:47,296 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:34:47,297 INFO ]: Start minimizeSevpa. Operand 1311 states. [2018-06-24 20:34:47,680 INFO ]: Finished minimizeSevpa. Reduced states from 1311 to 783. [2018-06-24 20:34:47,680 INFO ]: Start removeUnreachable. Operand 783 states. [2018-06-24 20:34:47,708 INFO ]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1731 transitions. [2018-06-24 20:34:47,708 INFO ]: Start accepts. Automaton has 783 states and 1731 transitions. Word has length 10 [2018-06-24 20:34:47,708 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:47,708 INFO ]: Abstraction has 783 states and 1731 transitions. [2018-06-24 20:34:47,708 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:34:47,708 INFO ]: Start isEmpty. Operand 783 states and 1731 transitions. [2018-06-24 20:34:47,755 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:34:47,755 INFO ]: Found error trace [2018-06-24 20:34:47,755 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:34:47,755 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:47,756 INFO ]: Analyzing trace with hash 2074943328, now seen corresponding path program 1 times [2018-06-24 20:34:47,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:47,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:47,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:47,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:47,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:47,807 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:47,916 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:34:47,916 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:47,916 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:34:47,916 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:34:47,916 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:34:47,916 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:34:47,917 INFO ]: Start difference. First operand 783 states and 1731 transitions. Second operand 6 states. [2018-06-24 20:34:52,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:52,327 INFO ]: Finished difference Result 1676 states and 5747 transitions. [2018-06-24 20:34:52,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:34:52,328 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:34:52,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:52,487 INFO ]: With dead ends: 1676 [2018-06-24 20:34:52,487 INFO ]: Without dead ends: 1605 [2018-06-24 20:34:52,488 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:34:52,489 INFO ]: Start minimizeSevpa. Operand 1605 states. [2018-06-24 20:34:52,828 INFO ]: Finished minimizeSevpa. Reduced states from 1605 to 1003. [2018-06-24 20:34:52,828 INFO ]: Start removeUnreachable. Operand 1003 states. [2018-06-24 20:34:52,863 INFO ]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 2391 transitions. [2018-06-24 20:34:52,863 INFO ]: Start accepts. Automaton has 1003 states and 2391 transitions. Word has length 10 [2018-06-24 20:34:52,864 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:52,864 INFO ]: Abstraction has 1003 states and 2391 transitions. [2018-06-24 20:34:52,864 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:34:52,864 INFO ]: Start isEmpty. Operand 1003 states and 2391 transitions. [2018-06-24 20:34:52,904 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:34:52,905 INFO ]: Found error trace [2018-06-24 20:34:52,905 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:34:52,905 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:52,905 INFO ]: Analyzing trace with hash 1490987254, now seen corresponding path program 1 times [2018-06-24 20:34:52,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:52,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:52,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:52,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:52,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:52,934 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:53,015 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:34:53,016 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:53,016 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:34:53,016 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:34:53,016 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:34:53,016 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:34:53,016 INFO ]: Start difference. First operand 1003 states and 2391 transitions. Second operand 3 states. [2018-06-24 20:34:54,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:54,132 INFO ]: Finished difference Result 1143 states and 2724 transitions. [2018-06-24 20:34:54,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:34:54,133 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:34:54,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:54,175 INFO ]: With dead ends: 1143 [2018-06-24 20:34:54,175 INFO ]: Without dead ends: 1143 [2018-06-24 20:34:54,175 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:34:54,176 INFO ]: Start minimizeSevpa. Operand 1143 states. [2018-06-24 20:34:54,315 INFO ]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2018-06-24 20:34:54,315 INFO ]: Start removeUnreachable. Operand 1143 states. [2018-06-24 20:34:54,356 INFO ]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 2724 transitions. [2018-06-24 20:34:54,356 INFO ]: Start accepts. Automaton has 1143 states and 2724 transitions. Word has length 10 [2018-06-24 20:34:54,356 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:54,356 INFO ]: Abstraction has 1143 states and 2724 transitions. [2018-06-24 20:34:54,356 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:34:54,356 INFO ]: Start isEmpty. Operand 1143 states and 2724 transitions. [2018-06-24 20:34:54,402 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:34:54,402 INFO ]: Found error trace [2018-06-24 20:34:54,402 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:34:54,402 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:54,402 INFO ]: Analyzing trace with hash 1934036835, now seen corresponding path program 1 times [2018-06-24 20:34:54,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:54,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:54,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:54,403 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:54,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:54,435 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:54,725 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:34:54,725 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:54,725 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:34:54,725 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:34:54,725 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:34:54,725 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:34:54,725 INFO ]: Start difference. First operand 1143 states and 2724 transitions. Second operand 6 states. [2018-06-24 20:34:58,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:58,863 INFO ]: Finished difference Result 2822 states and 11813 transitions. [2018-06-24 20:34:58,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:34:58,863 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:34:58,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:59,102 INFO ]: With dead ends: 2822 [2018-06-24 20:34:59,102 INFO ]: Without dead ends: 2822 [2018-06-24 20:34:59,102 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:34:59,104 INFO ]: Start minimizeSevpa. Operand 2822 states. [2018-06-24 20:34:59,911 INFO ]: Finished minimizeSevpa. Reduced states from 2822 to 1736. [2018-06-24 20:34:59,911 INFO ]: Start removeUnreachable. Operand 1736 states. [2018-06-24 20:34:59,987 INFO ]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 5160 transitions. [2018-06-24 20:34:59,987 INFO ]: Start accepts. Automaton has 1736 states and 5160 transitions. Word has length 10 [2018-06-24 20:34:59,987 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:59,987 INFO ]: Abstraction has 1736 states and 5160 transitions. [2018-06-24 20:34:59,987 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:34:59,987 INFO ]: Start isEmpty. Operand 1736 states and 5160 transitions. [2018-06-24 20:35:00,026 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:35:00,026 INFO ]: Found error trace [2018-06-24 20:35:00,026 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:00,026 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:00,028 INFO ]: Analyzing trace with hash 1962665986, now seen corresponding path program 1 times [2018-06-24 20:35:00,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:00,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:00,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:00,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:00,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:00,054 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:00,510 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:35:00,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:00,510 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:35:00,510 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:35:00,510 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:35:00,510 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:35:00,511 INFO ]: Start difference. First operand 1736 states and 5160 transitions. Second operand 6 states. [2018-06-24 20:35:07,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:07,039 INFO ]: Finished difference Result 5816 states and 31929 transitions. [2018-06-24 20:35:07,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:35:07,039 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:35:07,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:07,881 INFO ]: With dead ends: 5816 [2018-06-24 20:35:07,881 INFO ]: Without dead ends: 5816 [2018-06-24 20:35:07,881 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:35:07,884 INFO ]: Start minimizeSevpa. Operand 5816 states. [2018-06-24 20:35:10,977 INFO ]: Finished minimizeSevpa. Reduced states from 5816 to 3811. [2018-06-24 20:35:10,977 INFO ]: Start removeUnreachable. Operand 3811 states. [2018-06-24 20:35:11,155 INFO ]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 15825 transitions. [2018-06-24 20:35:11,155 INFO ]: Start accepts. Automaton has 3811 states and 15825 transitions. Word has length 10 [2018-06-24 20:35:11,155 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:11,155 INFO ]: Abstraction has 3811 states and 15825 transitions. [2018-06-24 20:35:11,155 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:35:11,155 INFO ]: Start isEmpty. Operand 3811 states and 15825 transitions. [2018-06-24 20:35:11,218 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:35:11,218 INFO ]: Found error trace [2018-06-24 20:35:11,218 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:11,218 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:11,219 INFO ]: Analyzing trace with hash -107493903, now seen corresponding path program 1 times [2018-06-24 20:35:11,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:11,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:11,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:11,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:11,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:11,238 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:11,604 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:35:11,604 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:35:11,605 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:35:11,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:11,675 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:11,687 INFO ]: Computing forward predicates... [2018-06-24 20:35:11,836 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:35:11,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:35:11,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 20:35:11,861 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:35:11,861 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:35:11,861 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:35:11,861 INFO ]: Start difference. First operand 3811 states and 15825 transitions. Second operand 12 states. Received shutdown request... [2018-06-24 20:35:26,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:35:26,792 WARN ]: Verification canceled [2018-06-24 20:35:26,795 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:35:26,796 WARN ]: Timeout [2018-06-24 20:35:26,796 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:35:26 BasicIcfg [2018-06-24 20:35:26,796 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:35:26,797 INFO ]: Toolchain (without parser) took 55099.20 ms. Allocated memory was 309.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 240.8 MB in the beginning and 903.4 MB in the end (delta: -662.6 MB). Peak memory consumption was 663.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:26,799 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:35:26,799 INFO ]: ChcToBoogie took 110.80 ms. Allocated memory is still 309.3 MB. Free memory was 239.8 MB in the beginning and 235.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:26,800 INFO ]: Boogie Preprocessor took 61.44 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 233.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:26,800 INFO ]: RCFGBuilder took 1966.82 ms. Allocated memory was 309.3 MB in the beginning and 324.0 MB in the end (delta: 14.7 MB). Free memory was 233.7 MB in the beginning and 259.1 MB in the end (delta: -25.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:26,801 INFO ]: BlockEncodingV2 took 907.95 ms. Allocated memory is still 324.0 MB. Free memory was 259.1 MB in the beginning and 217.5 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:26,801 INFO ]: TraceAbstraction took 52040.52 ms. Allocated memory was 324.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 216.1 MB in the beginning and 903.4 MB in the end (delta: -687.3 MB). Peak memory consumption was 623.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:26,804 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 288 edges - StatisticsResult: Encoded RCFG 135 locations, 271 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 110.80 ms. Allocated memory is still 309.3 MB. Free memory was 239.8 MB in the beginning and 235.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 61.44 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 233.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1966.82 ms. Allocated memory was 309.3 MB in the beginning and 324.0 MB in the end (delta: 14.7 MB). Free memory was 233.7 MB in the beginning and 259.1 MB in the end (delta: -25.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 907.95 ms. Allocated memory is still 324.0 MB. Free memory was 259.1 MB in the beginning and 217.5 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52040.52 ms. Allocated memory was 324.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 216.1 MB in the beginning and 903.4 MB in the end (delta: -687.3 MB). Peak memory consumption was 623.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (3811states) and interpolant automaton (currently 33 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (10481 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 51.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 43.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7206 SDtfs, 1331 SDslu, 21026 SDs, 0 SdLazy, 23543 SolverSat, 5941 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3811occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 4221 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 1739 SizeOfPredicates, 7 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 15/17 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/point-location.43.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-35-26-815.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.43.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-35-26-815.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.43.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-35-26-815.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.43.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-35-26-815.csv Completed graceful shutdown