java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/enc-zip_map2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:29:58,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:29:58,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:29:58,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:29:58,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:29:58,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:29:58,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:29:58,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:29:58,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:29:58,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:29:58,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:29:58,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:29:58,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:29:58,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:29:58,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:29:58,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:29:58,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:29:58,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:29:58,942 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:29:58,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:29:58,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:29:58,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:29:58,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:29:58,948 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:29:58,948 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:29:58,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:29:58,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:29:58,950 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:29:58,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:29:58,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:29:58,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:29:58,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:29:58,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:29:58,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:29:58,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:29:58,957 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:29:58,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:29:58,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:29:58,977 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:29:58,977 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:29:58,978 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:29:58,978 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:29:58,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:29:58,978 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:29:58,978 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:29:58,979 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:29:58,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:29:58,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:29:58,979 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:29:58,979 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:29:58,979 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:29:58,980 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:29:58,980 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:29:58,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:29:58,980 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:29:58,981 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:29:58,982 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:29:59,018 INFO ]: Repository-Root is: /tmp [2018-06-22 11:29:59,034 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:29:59,037 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:29:59,039 INFO ]: Initializing SmtParser... [2018-06-22 11:29:59,039 INFO ]: SmtParser initialized [2018-06-22 11:29:59,039 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zip_map2.smt2 [2018-06-22 11:29:59,041 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-22 11:29:59,132 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_map2.smt2 unknown [2018-06-22 11:29:59,326 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_map2.smt2 [2018-06-22 11:29:59,330 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:29:59,342 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:29:59,342 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:29:59,342 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:29:59,343 INFO ]: ChcToBoogie initialized [2018-06-22 11:29:59,346 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:29:59" (1/1) ... [2018-06-22 11:29:59,391 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59 Unit [2018-06-22 11:29:59,392 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:29:59,392 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:29:59,392 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:29:59,392 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:29:59,416 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (1/1) ... [2018-06-22 11:29:59,416 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (1/1) ... [2018-06-22 11:29:59,423 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (1/1) ... [2018-06-22 11:29:59,424 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (1/1) ... [2018-06-22 11:29:59,427 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (1/1) ... [2018-06-22 11:29:59,430 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (1/1) ... [2018-06-22 11:29:59,431 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (1/1) ... [2018-06-22 11:29:59,434 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:29:59,434 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:29:59,434 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:29:59,434 INFO ]: RCFGBuilder initialized [2018-06-22 11:29:59,435 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (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-22 11:29:59,451 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:29:59,451 INFO ]: Found specification of procedure False [2018-06-22 11:29:59,451 INFO ]: Found implementation of procedure False [2018-06-22 11:29:59,451 INFO ]: Specification and implementation of procedure mapDLRunknownCLN4 given in one single declaration [2018-06-22 11:29:59,451 INFO ]: Found specification of procedure mapDLRunknownCLN4 [2018-06-22 11:29:59,451 INFO ]: Found implementation of procedure mapDLRunknownCLN4 [2018-06-22 11:29:59,451 INFO ]: Specification and implementation of procedure zipDLRunknownCLN7 given in one single declaration [2018-06-22 11:29:59,451 INFO ]: Found specification of procedure zipDLRunknownCLN7 [2018-06-22 11:29:59,451 INFO ]: Found implementation of procedure zipDLRunknownCLN7 [2018-06-22 11:29:59,451 INFO ]: Specification and implementation of procedure zipDLRunknownCLN6 given in one single declaration [2018-06-22 11:29:59,451 INFO ]: Found specification of procedure zipDLRunknownCLN6 [2018-06-22 11:29:59,451 INFO ]: Found implementation of procedure zipDLRunknownCLN6 [2018-06-22 11:29:59,451 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:29:59,452 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:29:59,452 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-22 11:29:59,818 INFO ]: Using library mode [2018-06-22 11:29:59,819 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:29:59 BoogieIcfgContainer [2018-06-22 11:29:59,819 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:29:59,820 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:29:59,820 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:29:59,823 INFO ]: TraceAbstraction initialized [2018-06-22 11:29:59,824 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:29:59" (1/3) ... [2018-06-22 11:29:59,824 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87791d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:29:59, skipping insertion in model container [2018-06-22 11:29:59,825 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:59" (2/3) ... [2018-06-22 11:29:59,825 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87791d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:29:59, skipping insertion in model container [2018-06-22 11:29:59,825 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:29:59" (3/3) ... [2018-06-22 11:29:59,827 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:29:59,837 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:29:59,848 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:29:59,898 INFO ]: Using default assertion order modulation [2018-06-22 11:29:59,899 INFO ]: Interprodecural is true [2018-06-22 11:29:59,899 INFO ]: Hoare is false [2018-06-22 11:29:59,899 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:29:59,899 INFO ]: Backedges is TWOTRACK [2018-06-22 11:29:59,899 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:29:59,899 INFO ]: Difference is false [2018-06-22 11:29:59,899 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:29:59,899 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:29:59,921 INFO ]: Start isEmpty. Operand 26 states. [2018-06-22 11:29:59,940 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:29:59,940 INFO ]: Found error trace [2018-06-22 11:29:59,941 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:29:59,941 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:59,946 INFO ]: Analyzing trace with hash 91534484, now seen corresponding path program 1 times [2018-06-22 11:29:59,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:59,949 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:59,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:59,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:59,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:00,021 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:30:00,023 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:00,023 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:30:00,024 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:30:00,035 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:30:00,035 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:30:00,038 INFO ]: Start difference. First operand 26 states. Second operand 2 states. [2018-06-22 11:30:00,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:00,058 INFO ]: Finished difference Result 24 states and 34 transitions. [2018-06-22 11:30:00,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:30:00,060 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:30:00,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:00,073 INFO ]: With dead ends: 24 [2018-06-22 11:30:00,073 INFO ]: Without dead ends: 24 [2018-06-22 11:30:00,075 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:30:00,090 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:30:00,121 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:30:00,122 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:30:00,124 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-06-22 11:30:00,125 INFO ]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 5 [2018-06-22 11:30:00,125 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:00,125 INFO ]: Abstraction has 24 states and 34 transitions. [2018-06-22 11:30:00,125 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:30:00,125 INFO ]: Start isEmpty. Operand 24 states and 34 transitions. [2018-06-22 11:30:00,128 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:30:00,128 INFO ]: Found error trace [2018-06-22 11:30:00,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:00,128 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:00,128 INFO ]: Analyzing trace with hash 1363686210, now seen corresponding path program 1 times [2018-06-22 11:30:00,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:00,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:00,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:00,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:00,335 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:30:00,335 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:00,335 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:30:00,336 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:30:00,337 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:30:00,337 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:30:00,337 INFO ]: Start difference. First operand 24 states and 34 transitions. Second operand 4 states. [2018-06-22 11:30:00,426 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:00,426 INFO ]: Finished difference Result 28 states and 41 transitions. [2018-06-22 11:30:00,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:30:00,426 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:30:00,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:00,428 INFO ]: With dead ends: 28 [2018-06-22 11:30:00,428 INFO ]: Without dead ends: 28 [2018-06-22 11:30:00,429 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:30:00,429 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:30:00,438 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 11:30:00,438 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:30:00,440 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2018-06-22 11:30:00,440 INFO ]: Start accepts. Automaton has 26 states and 39 transitions. Word has length 9 [2018-06-22 11:30:00,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:00,440 INFO ]: Abstraction has 26 states and 39 transitions. [2018-06-22 11:30:00,440 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:30:00,440 INFO ]: Start isEmpty. Operand 26 states and 39 transitions. [2018-06-22 11:30:00,441 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:30:00,441 INFO ]: Found error trace [2018-06-22 11:30:00,441 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:00,441 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:00,441 INFO ]: Analyzing trace with hash 1083064525, now seen corresponding path program 1 times [2018-06-22 11:30:00,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:00,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:00,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:00,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,447 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:00,726 WARN ]: Spent 225.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:30:00,743 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:30:00,743 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:00,743 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:30:00,743 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:30:00,743 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:30:00,743 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:30:00,743 INFO ]: Start difference. First operand 26 states and 39 transitions. Second operand 4 states. [2018-06-22 11:30:00,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:00,806 INFO ]: Finished difference Result 28 states and 40 transitions. [2018-06-22 11:30:00,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:30:00,807 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:30:00,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:00,809 INFO ]: With dead ends: 28 [2018-06-22 11:30:00,809 INFO ]: Without dead ends: 28 [2018-06-22 11:30:00,810 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:30:00,810 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:30:00,818 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 11:30:00,818 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:30:00,819 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-06-22 11:30:00,819 INFO ]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 9 [2018-06-22 11:30:00,819 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:00,819 INFO ]: Abstraction has 26 states and 38 transitions. [2018-06-22 11:30:00,819 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:30:00,819 INFO ]: Start isEmpty. Operand 26 states and 38 transitions. [2018-06-22 11:30:00,820 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:30:00,820 INFO ]: Found error trace [2018-06-22 11:30:00,820 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:00,821 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:00,822 INFO ]: Analyzing trace with hash -2107156698, now seen corresponding path program 1 times [2018-06-22 11:30:00,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:00,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:00,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:00,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:01,188 WARN ]: Spent 278.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-06-22 11:30:01,332 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:30:01,332 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:01,332 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:30:01,332 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:30:01,332 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:30:01,332 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:30:01,332 INFO ]: Start difference. First operand 26 states and 38 transitions. Second operand 5 states. [2018-06-22 11:30:01,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:01,491 INFO ]: Finished difference Result 26 states and 37 transitions. [2018-06-22 11:30:01,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:30:01,492 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:30:01,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:01,493 INFO ]: With dead ends: 26 [2018-06-22 11:30:01,493 INFO ]: Without dead ends: 25 [2018-06-22 11:30:01,494 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:30:01,494 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:30:01,501 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 11:30:01,501 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:30:01,502 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-06-22 11:30:01,502 INFO ]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2018-06-22 11:30:01,502 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:01,502 INFO ]: Abstraction has 25 states and 35 transitions. [2018-06-22 11:30:01,502 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:30:01,503 INFO ]: Start isEmpty. Operand 25 states and 35 transitions. [2018-06-22 11:30:01,503 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:30:01,503 INFO ]: Found error trace [2018-06-22 11:30:01,503 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:01,504 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:01,508 INFO ]: Analyzing trace with hash 1304704561, now seen corresponding path program 1 times [2018-06-22 11:30:01,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:01,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:01,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:01,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:01,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:01,523 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:01,784 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:30:01,827 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:30:01,828 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:01,828 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:30:01,828 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:30:01,828 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:30:01,828 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:30:01,828 INFO ]: Start difference. First operand 25 states and 35 transitions. Second operand 5 states. [2018-06-22 11:30:02,030 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:30:02,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:02,211 INFO ]: Finished difference Result 25 states and 34 transitions. [2018-06-22 11:30:02,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:30:02,211 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:30:02,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:02,212 INFO ]: With dead ends: 25 [2018-06-22 11:30:02,212 INFO ]: Without dead ends: 24 [2018-06-22 11:30:02,212 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:30:02,212 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:30:02,216 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:30:02,216 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:30:02,216 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-06-22 11:30:02,217 INFO ]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-06-22 11:30:02,217 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:02,217 INFO ]: Abstraction has 22 states and 28 transitions. [2018-06-22 11:30:02,217 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:30:02,217 INFO ]: Start isEmpty. Operand 22 states and 28 transitions. [2018-06-22 11:30:02,217 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:30:02,217 INFO ]: Found error trace [2018-06-22 11:30:02,218 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:02,218 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:02,218 INFO ]: Analyzing trace with hash -564425554, now seen corresponding path program 1 times [2018-06-22 11:30:02,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:02,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:02,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:02,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:02,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:02,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:02,262 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:30:02,262 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:02,262 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:30:02,262 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:30:02,262 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:30:02,262 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:30:02,262 INFO ]: Start difference. First operand 22 states and 28 transitions. Second operand 6 states. [2018-06-22 11:30:02,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:02,322 INFO ]: Finished difference Result 29 states and 38 transitions. [2018-06-22 11:30:02,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:30:02,322 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:30:02,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:02,323 INFO ]: With dead ends: 29 [2018-06-22 11:30:02,323 INFO ]: Without dead ends: 29 [2018-06-22 11:30:02,324 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:30:02,324 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:30:02,329 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:30:02,329 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:30:02,330 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-22 11:30:02,330 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2018-06-22 11:30:02,330 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:02,330 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-22 11:30:02,330 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:30:02,331 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-22 11:30:02,331 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:30:02,331 INFO ]: Found error trace [2018-06-22 11:30:02,332 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:02,332 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:02,332 INFO ]: Analyzing trace with hash -44838480, now seen corresponding path program 1 times [2018-06-22 11:30:02,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:02,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:02,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:02,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:02,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:02,340 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:02,505 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:30:02,505 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:02,505 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:30:02,505 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:30:02,505 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:30:02,505 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:30:02,505 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2018-06-22 11:30:02,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:02,539 INFO ]: Finished difference Result 27 states and 35 transitions. [2018-06-22 11:30:02,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:30:02,539 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:30:02,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:02,540 INFO ]: With dead ends: 27 [2018-06-22 11:30:02,540 INFO ]: Without dead ends: 26 [2018-06-22 11:30:02,540 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:30:02,541 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:30:02,544 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:30:02,544 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:30:02,545 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-06-22 11:30:02,545 INFO ]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 21 [2018-06-22 11:30:02,545 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:02,545 INFO ]: Abstraction has 24 states and 30 transitions. [2018-06-22 11:30:02,545 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:30:02,545 INFO ]: Start isEmpty. Operand 24 states and 30 transitions. [2018-06-22 11:30:02,546 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:30:02,546 INFO ]: Found error trace [2018-06-22 11:30:02,546 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:02,546 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:02,547 INFO ]: Analyzing trace with hash -235167339, now seen corresponding path program 1 times [2018-06-22 11:30:02,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:02,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:02,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:02,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:02,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:02,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:02,641 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:30:02,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:02,641 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-22 11:30:02,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:02,681 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:02,691 INFO ]: Computing forward predicates... [2018-06-22 11:30:03,045 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:30:03,076 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:30:03,076 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2018-06-22 11:30:03,076 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:30:03,076 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:30:03,076 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:30:03,077 INFO ]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2018-06-22 11:30:03,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:03,351 INFO ]: Finished difference Result 26 states and 32 transitions. [2018-06-22 11:30:03,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:30:03,355 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:30:03,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:03,356 INFO ]: With dead ends: 26 [2018-06-22 11:30:03,356 INFO ]: Without dead ends: 26 [2018-06-22 11:30:03,356 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:30:03,356 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:30:03,361 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:30:03,361 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:30:03,362 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-06-22 11:30:03,362 INFO ]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2018-06-22 11:30:03,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:03,362 INFO ]: Abstraction has 26 states and 32 transitions. [2018-06-22 11:30:03,362 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:30:03,362 INFO ]: Start isEmpty. Operand 26 states and 32 transitions. [2018-06-22 11:30:03,363 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:30:03,364 INFO ]: Found error trace [2018-06-22 11:30:03,364 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:03,364 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:03,364 INFO ]: Analyzing trace with hash 1736514327, now seen corresponding path program 1 times [2018-06-22 11:30:03,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:03,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:03,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:03,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:03,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:03,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:03,637 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:30:03,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:03,637 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-22 11:30:03,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:03,676 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:03,679 INFO ]: Computing forward predicates... [2018-06-22 11:30:03,776 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:30:03,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:03,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 11:30:03,799 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:30:03,799 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:30:03,799 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:30:03,799 INFO ]: Start difference. First operand 26 states and 32 transitions. Second operand 13 states. [2018-06-22 11:30:04,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:04,128 INFO ]: Finished difference Result 34 states and 44 transitions. [2018-06-22 11:30:04,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:30:04,129 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:30:04,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:04,130 INFO ]: With dead ends: 34 [2018-06-22 11:30:04,130 INFO ]: Without dead ends: 34 [2018-06-22 11:30:04,130 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:30:04,130 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:30:04,136 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-22 11:30:04,137 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:30:04,139 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2018-06-22 11:30:04,139 INFO ]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 29 [2018-06-22 11:30:04,139 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:04,139 INFO ]: Abstraction has 32 states and 42 transitions. [2018-06-22 11:30:04,139 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:30:04,139 INFO ]: Start isEmpty. Operand 32 states and 42 transitions. [2018-06-22 11:30:04,141 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:30:04,141 INFO ]: Found error trace [2018-06-22 11:30:04,141 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:04,141 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:04,141 INFO ]: Analyzing trace with hash 1943582105, now seen corresponding path program 2 times [2018-06-22 11:30:04,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:04,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:04,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:04,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:04,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:04,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:04,347 INFO ]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:30:04,347 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:04,347 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-22 11:30:04,354 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:30:04,377 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:30:04,377 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:04,381 INFO ]: Computing forward predicates... [2018-06-22 11:30:04,515 INFO ]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:30:04,547 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:30:04,548 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2018-06-22 11:30:04,548 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:30:04,548 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:30:04,548 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:30:04,548 INFO ]: Start difference. First operand 32 states and 42 transitions. Second operand 16 states. [2018-06-22 11:30:04,901 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:04,901 INFO ]: Finished difference Result 28 states and 36 transitions. [2018-06-22 11:30:04,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:30:04,901 INFO ]: Start accepts. Automaton has 16 states. Word has length 33 [2018-06-22 11:30:04,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:04,902 INFO ]: With dead ends: 28 [2018-06-22 11:30:04,902 INFO ]: Without dead ends: 0 [2018-06-22 11:30:04,902 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:30:04,902 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:30:04,903 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:30:04,903 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:30:04,903 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:30:04,903 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-06-22 11:30:04,903 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:04,903 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:30:04,903 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:30:04,903 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:30:04,903 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:30:04,909 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:30:04 BoogieIcfgContainer [2018-06-22 11:30:04,909 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:30:04,910 INFO ]: Toolchain (without parser) took 5579.38 ms. Allocated memory was 302.0 MB in the beginning and 339.2 MB in the end (delta: 37.2 MB). Free memory was 255.4 MB in the beginning and 244.1 MB in the end (delta: 11.3 MB). Peak memory consumption was 48.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:30:04,911 INFO ]: SmtParser took 0.06 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-22 11:30:04,911 INFO ]: ChcToBoogie took 49.51 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-22 11:30:04,912 INFO ]: Boogie Preprocessor took 41.73 ms. Allocated memory is still 302.0 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:30:04,912 INFO ]: RCFGBuilder took 384.58 ms. Allocated memory is still 302.0 MB. Free memory was 251.4 MB in the beginning and 242.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:30:04,913 INFO ]: TraceAbstraction took 5088.89 ms. Allocated memory was 302.0 MB in the beginning and 339.2 MB in the end (delta: 37.2 MB). Free memory was 241.4 MB in the beginning and 244.1 MB in the end (delta: -2.7 MB). Peak memory consumption was 34.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:30:04,917 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 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 49.51 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 41.73 ms. Allocated memory is still 302.0 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 384.58 ms. Allocated memory is still 302.0 MB. Free memory was 251.4 MB in the beginning and 242.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5088.89 ms. Allocated memory was 302.0 MB in the beginning and 339.2 MB in the end (delta: 37.2 MB). Free memory was 241.4 MB in the beginning and 244.1 MB in the end (delta: -2.7 MB). Peak memory consumption was 34.5 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 5 procedures, 26 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 285 SDtfs, 26 SDslu, 936 SDs, 0 SdLazy, 418 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 16764 SizeOfPredicates, 20 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 59/71 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/enc-zip_map2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-30-04-928.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_map2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-30-04-928.csv Received shutdown request...