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/a-copy-print.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:25:45,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:25:45,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:25:45,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:25:45,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:25:45,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:25:45,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:25:45,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:25:45,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:25:45,204 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:25:45,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:25:45,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:25:45,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:25:45,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:25:45,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:25:45,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:25:45,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:25:45,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:25:45,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:25:45,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:25:45,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:25:45,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:25:45,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:25:45,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:25:45,230 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:25:45,231 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:25:45,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:25:45,234 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:25:45,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:25:45,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:25:45,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:25:45,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:25:45,240 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:25:45,241 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:25:45,241 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:25:45,242 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:25:45,262 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:25:45,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:25:45,263 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:25:45,263 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:25:45,265 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:25:45,265 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:25:45,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:25:45,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:25:45,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:25:45,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:25:45,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:25:45,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:25:45,267 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:25:45,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:25:45,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:25:45,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:25:45,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:25:45,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:25:45,270 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:25:45,271 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:25:45,272 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:25:45,311 INFO ]: Repository-Root is: /tmp [2018-06-22 11:25:45,328 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:25:45,332 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:25:45,334 INFO ]: Initializing SmtParser... [2018-06-22 11:25:45,334 INFO ]: SmtParser initialized [2018-06-22 11:25:45,335 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 [2018-06-22 11:25:45,336 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:25:45,430 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 unknown [2018-06-22 11:25:45,923 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 [2018-06-22 11:25:45,928 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:25:45,935 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:25:45,936 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:25:45,936 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:25:45,936 INFO ]: ChcToBoogie initialized [2018-06-22 11:25:45,939 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:25:45" (1/1) ... [2018-06-22 11:25:46,018 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46 Unit [2018-06-22 11:25:46,018 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:25:46,019 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:25:46,019 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:25:46,019 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:25:46,058 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (1/1) ... [2018-06-22 11:25:46,059 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (1/1) ... [2018-06-22 11:25:46,078 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (1/1) ... [2018-06-22 11:25:46,078 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (1/1) ... [2018-06-22 11:25:46,097 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (1/1) ... [2018-06-22 11:25:46,111 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (1/1) ... [2018-06-22 11:25:46,114 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (1/1) ... [2018-06-22 11:25:46,127 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:25:46,128 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:25:46,128 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:25:46,128 INFO ]: RCFGBuilder initialized [2018-06-22 11:25:46,129 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure False [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure False [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure make_arrayDLRunknownCLN39 given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure make_arrayDLRunknownCLN39 [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure make_arrayDLRunknownCLN39 [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure fDLRunknownCLN33 given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure fDLRunknownCLN33 [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure fDLRunknownCLN33 [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN23 given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN23 [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN23 [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN30 given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN30 [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN30 [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN29 given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN29 [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN29 [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN21 given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN21 [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN21 [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN16 given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN16 [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN16 [2018-06-22 11:25:46,148 INFO ]: Specification and implementation of procedure fDLRunknownCLN34 given in one single declaration [2018-06-22 11:25:46,148 INFO ]: Found specification of procedure fDLRunknownCLN34 [2018-06-22 11:25:46,148 INFO ]: Found implementation of procedure fDLRunknownCLN34 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure make_arrayDLRunknownCLN40 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure make_arrayDLRunknownCLN40 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure make_arrayDLRunknownCLN40 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN19 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN19 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN19 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN18 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN18 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN18 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure updateDLRunknownCLN49 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure updateDLRunknownCLN49 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure updateDLRunknownCLN49 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN1-aDLRunknownCLN8 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure DLRinnerFuncCLN1-aDLRunknownCLN8 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure DLRinnerFuncCLN1-aDLRunknownCLN8 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN1-aDLRunknownCLN4 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure DLRinnerFuncCLN1-aDLRunknownCLN4 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure DLRinnerFuncCLN1-aDLRunknownCLN4 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN1-aDLRunknownCLN3 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure DLRinnerFuncCLN1-aDLRunknownCLN3 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure DLRinnerFuncCLN1-aDLRunknownCLN3 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN1-aDLRunknownCLN7 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure DLRinnerFuncCLN1-aDLRunknownCLN7 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure DLRinnerFuncCLN1-aDLRunknownCLN7 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure updateDLRunknownCLN47 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure updateDLRunknownCLN47 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure updateDLRunknownCLN47 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure updateDLRunknownCLN48 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure updateDLRunknownCLN48 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure updateDLRunknownCLN48 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN12 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN12 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN12 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure updateDLRunknownCLN46 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure updateDLRunknownCLN46 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure updateDLRunknownCLN46 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure updateDLRunknownCLN45 given in one single declaration [2018-06-22 11:25:46,149 INFO ]: Found specification of procedure updateDLRunknownCLN45 [2018-06-22 11:25:46,149 INFO ]: Found implementation of procedure updateDLRunknownCLN45 [2018-06-22 11:25:46,149 INFO ]: Specification and implementation of procedure fDLRunknownCLN36 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure fDLRunknownCLN36 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure fDLRunknownCLN36 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN17 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN17 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN17 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN20 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN20 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN20 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN28 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN28 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN28 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure print_intDLRunknownCLN42 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure print_intDLRunknownCLN42 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure print_intDLRunknownCLN42 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN15 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN15 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN15 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN10 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN10 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure DLRinnerFuncCLN2-bcopyDLRunknownCLN10 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure fDLRunknownCLN32 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure fDLRunknownCLN32 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure fDLRunknownCLN32 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure fDLRunknownCLN35 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure fDLRunknownCLN35 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure fDLRunknownCLN35 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN25 given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN25 [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure DLRinnerFuncCLN3-print_arrayDLRunknownCLN25 [2018-06-22 11:25:46,150 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:25:46,150 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:25:46,150 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:25:47,065 INFO ]: Using library mode [2018-06-22 11:25:47,065 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:25:47 BoogieIcfgContainer [2018-06-22 11:25:47,065 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:25:47,067 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:25:47,067 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:25:47,073 INFO ]: TraceAbstraction initialized [2018-06-22 11:25:47,073 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:25:45" (1/3) ... [2018-06-22 11:25:47,074 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa874c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:25:47, skipping insertion in model container [2018-06-22 11:25:47,074 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:46" (2/3) ... [2018-06-22 11:25:47,074 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa874c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:25:47, skipping insertion in model container [2018-06-22 11:25:47,074 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:25:47" (3/3) ... [2018-06-22 11:25:47,076 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:25:47,088 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:25:47,100 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:25:47,150 INFO ]: Using default assertion order modulation [2018-06-22 11:25:47,151 INFO ]: Interprodecural is true [2018-06-22 11:25:47,151 INFO ]: Hoare is false [2018-06-22 11:25:47,151 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:25:47,151 INFO ]: Backedges is TWOTRACK [2018-06-22 11:25:47,151 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:25:47,151 INFO ]: Difference is false [2018-06-22 11:25:47,151 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:25:47,151 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:25:47,201 INFO ]: Start isEmpty. Operand 218 states. [2018-06-22 11:25:47,229 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:25:47,229 INFO ]: Found error trace [2018-06-22 11:25:47,230 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:25:47,231 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:47,234 INFO ]: Analyzing trace with hash 562671233, now seen corresponding path program 1 times [2018-06-22 11:25:47,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:47,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:47,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:47,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:47,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:47,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:47,309 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:25:47,312 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:47,312 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:25:47,314 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:25:47,330 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:25:47,330 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:25:47,337 INFO ]: Start difference. First operand 218 states. Second operand 2 states. [2018-06-22 11:25:47,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:47,422 INFO ]: Finished difference Result 201 states and 292 transitions. [2018-06-22 11:25:47,422 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:25:47,423 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:25:47,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:47,445 INFO ]: With dead ends: 201 [2018-06-22 11:25:47,445 INFO ]: Without dead ends: 182 [2018-06-22 11:25:47,447 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:25:47,462 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 11:25:47,507 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-06-22 11:25:47,508 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-22 11:25:47,518 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 262 transitions. [2018-06-22 11:25:47,520 INFO ]: Start accepts. Automaton has 182 states and 262 transitions. Word has length 5 [2018-06-22 11:25:47,520 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:47,520 INFO ]: Abstraction has 182 states and 262 transitions. [2018-06-22 11:25:47,521 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:25:47,521 INFO ]: Start isEmpty. Operand 182 states and 262 transitions. [2018-06-22 11:25:47,524 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:25:47,524 INFO ]: Found error trace [2018-06-22 11:25:47,524 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 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:25:47,524 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:47,524 INFO ]: Analyzing trace with hash 2098782982, now seen corresponding path program 1 times [2018-06-22 11:25:47,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:47,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:47,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:47,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:47,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:47,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:47,927 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:25:47,927 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:47,927 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:25:47,929 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:25:47,929 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:25:47,929 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:25:47,929 INFO ]: Start difference. First operand 182 states and 262 transitions. Second operand 8 states. [2018-06-22 11:25:48,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:48,847 INFO ]: Finished difference Result 191 states and 288 transitions. [2018-06-22 11:25:48,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:25:48,848 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 11:25:48,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:48,857 INFO ]: With dead ends: 191 [2018-06-22 11:25:48,857 INFO ]: Without dead ends: 191 [2018-06-22 11:25:48,858 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:25:48,859 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-22 11:25:48,893 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-06-22 11:25:48,893 INFO ]: Start removeUnreachable. Operand 191 states. [2018-06-22 11:25:48,898 INFO ]: Finished removeUnreachable. Reduced from 191 states to 191 states and 288 transitions. [2018-06-22 11:25:48,898 INFO ]: Start accepts. Automaton has 191 states and 288 transitions. Word has length 29 [2018-06-22 11:25:48,898 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:48,898 INFO ]: Abstraction has 191 states and 288 transitions. [2018-06-22 11:25:48,898 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:25:48,898 INFO ]: Start isEmpty. Operand 191 states and 288 transitions. [2018-06-22 11:25:48,902 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:25:48,902 INFO ]: Found error trace [2018-06-22 11:25:48,902 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:48,902 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:48,902 INFO ]: Analyzing trace with hash -1259510714, now seen corresponding path program 1 times [2018-06-22 11:25:48,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:48,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:48,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:48,903 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:48,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:48,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:49,254 INFO ]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:25:49,255 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:49,255 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:25:49,256 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:25:49,256 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:25:49,256 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:25:49,256 INFO ]: Start difference. First operand 191 states and 288 transitions. Second operand 7 states. [2018-06-22 11:25:49,708 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:49,708 INFO ]: Finished difference Result 199 states and 305 transitions. [2018-06-22 11:25:49,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:25:49,708 INFO ]: Start accepts. Automaton has 7 states. Word has length 49 [2018-06-22 11:25:49,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:49,712 INFO ]: With dead ends: 199 [2018-06-22 11:25:49,712 INFO ]: Without dead ends: 199 [2018-06-22 11:25:49,712 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:25:49,713 INFO ]: Start minimizeSevpa. Operand 199 states. [2018-06-22 11:25:49,737 INFO ]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-06-22 11:25:49,737 INFO ]: Start removeUnreachable. Operand 197 states. [2018-06-22 11:25:49,741 INFO ]: Finished removeUnreachable. Reduced from 197 states to 197 states and 300 transitions. [2018-06-22 11:25:49,741 INFO ]: Start accepts. Automaton has 197 states and 300 transitions. Word has length 49 [2018-06-22 11:25:49,742 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:49,742 INFO ]: Abstraction has 197 states and 300 transitions. [2018-06-22 11:25:49,742 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:25:49,742 INFO ]: Start isEmpty. Operand 197 states and 300 transitions. [2018-06-22 11:25:49,747 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:25:49,751 INFO ]: Found error trace [2018-06-22 11:25:49,751 INFO ]: trace histogram [8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:49,751 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:49,751 INFO ]: Analyzing trace with hash 186572993, now seen corresponding path program 1 times [2018-06-22 11:25:49,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:49,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:49,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:49,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:49,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:49,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:50,071 INFO ]: Checked inductivity of 163 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-06-22 11:25:50,071 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:50,071 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:25:50,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:50,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:50,171 INFO ]: Computing forward predicates... [2018-06-22 11:25:50,264 INFO ]: Checked inductivity of 163 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-06-22 11:25:50,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:50,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:25:50,297 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:25:50,297 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:25:50,298 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:25:50,298 INFO ]: Start difference. First operand 197 states and 300 transitions. Second operand 10 states. [2018-06-22 11:25:50,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:50,823 INFO ]: Finished difference Result 199 states and 302 transitions. [2018-06-22 11:25:50,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:25:50,824 INFO ]: Start accepts. Automaton has 10 states. Word has length 105 [2018-06-22 11:25:50,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:50,828 INFO ]: With dead ends: 199 [2018-06-22 11:25:50,829 INFO ]: Without dead ends: 199 [2018-06-22 11:25:50,829 INFO ]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:25:50,829 INFO ]: Start minimizeSevpa. Operand 199 states. [2018-06-22 11:25:50,846 INFO ]: Finished minimizeSevpa. Reduced states from 199 to 190. [2018-06-22 11:25:50,846 INFO ]: Start removeUnreachable. Operand 190 states. [2018-06-22 11:25:50,849 INFO ]: Finished removeUnreachable. Reduced from 190 states to 190 states and 276 transitions. [2018-06-22 11:25:50,849 INFO ]: Start accepts. Automaton has 190 states and 276 transitions. Word has length 105 [2018-06-22 11:25:50,850 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:50,850 INFO ]: Abstraction has 190 states and 276 transitions. [2018-06-22 11:25:50,850 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:25:50,850 INFO ]: Start isEmpty. Operand 190 states and 276 transitions. [2018-06-22 11:25:50,855 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:25:50,855 INFO ]: Found error trace [2018-06-22 11:25:50,855 INFO ]: trace histogram [11, 11, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:50,855 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:50,856 INFO ]: Analyzing trace with hash -2119312600, now seen corresponding path program 1 times [2018-06-22 11:25:50,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:50,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:50,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:50,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:50,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:50,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:51,019 INFO ]: Checked inductivity of 228 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-06-22 11:25:51,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:51,019 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:25:51,028 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:51,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:51,094 INFO ]: Computing forward predicates... [2018-06-22 11:25:51,180 INFO ]: Checked inductivity of 228 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-06-22 11:25:51,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:51,215 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:25:51,215 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:25:51,215 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:25:51,215 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:25:51,216 INFO ]: Start difference. First operand 190 states and 276 transitions. Second operand 7 states. [2018-06-22 11:25:52,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:52,023 INFO ]: Finished difference Result 203 states and 312 transitions. [2018-06-22 11:25:52,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:25:52,024 INFO ]: Start accepts. Automaton has 7 states. Word has length 133 [2018-06-22 11:25:52,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:52,028 INFO ]: With dead ends: 203 [2018-06-22 11:25:52,028 INFO ]: Without dead ends: 203 [2018-06-22 11:25:52,028 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:25:52,028 INFO ]: Start minimizeSevpa. Operand 203 states. [2018-06-22 11:25:52,047 INFO ]: Finished minimizeSevpa. Reduced states from 203 to 193. [2018-06-22 11:25:52,047 INFO ]: Start removeUnreachable. Operand 193 states. [2018-06-22 11:25:52,067 INFO ]: Finished removeUnreachable. Reduced from 193 states to 193 states and 293 transitions. [2018-06-22 11:25:52,067 INFO ]: Start accepts. Automaton has 193 states and 293 transitions. Word has length 133 [2018-06-22 11:25:52,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:52,068 INFO ]: Abstraction has 193 states and 293 transitions. [2018-06-22 11:25:52,068 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:25:52,068 INFO ]: Start isEmpty. Operand 193 states and 293 transitions. [2018-06-22 11:25:52,073 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 11:25:52,073 INFO ]: Found error trace [2018-06-22 11:25:52,074 INFO ]: trace histogram [17, 17, 9, 8, 8, 8, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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:25:52,074 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:52,074 INFO ]: Analyzing trace with hash 129685859, now seen corresponding path program 1 times [2018-06-22 11:25:52,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:52,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:52,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:52,078 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:52,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:52,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:52,426 INFO ]: Checked inductivity of 662 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2018-06-22 11:25:52,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:52,426 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 11:25:52,426 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:25:52,426 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:25:52,426 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:25:52,427 INFO ]: Start difference. First operand 193 states and 293 transitions. Second operand 10 states. [2018-06-22 11:25:53,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:53,389 INFO ]: Finished difference Result 213 states and 337 transitions. [2018-06-22 11:25:53,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:25:53,390 INFO ]: Start accepts. Automaton has 10 states. Word has length 209 [2018-06-22 11:25:53,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:53,394 INFO ]: With dead ends: 213 [2018-06-22 11:25:53,394 INFO ]: Without dead ends: 213 [2018-06-22 11:25:53,395 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:25:53,395 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-22 11:25:53,424 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 207. [2018-06-22 11:25:53,424 INFO ]: Start removeUnreachable. Operand 207 states. [2018-06-22 11:25:53,427 INFO ]: Finished removeUnreachable. Reduced from 207 states to 207 states and 328 transitions. [2018-06-22 11:25:53,427 INFO ]: Start accepts. Automaton has 207 states and 328 transitions. Word has length 209 [2018-06-22 11:25:53,428 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:53,428 INFO ]: Abstraction has 207 states and 328 transitions. [2018-06-22 11:25:53,428 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:25:53,429 INFO ]: Start isEmpty. Operand 207 states and 328 transitions. [2018-06-22 11:25:53,432 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 11:25:53,432 INFO ]: Found error trace [2018-06-22 11:25:53,432 INFO ]: trace histogram [15, 15, 8, 8, 8, 8, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:53,432 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:53,432 INFO ]: Analyzing trace with hash 2079726661, now seen corresponding path program 1 times [2018-06-22 11:25:53,432 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:53,432 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:53,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:53,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:53,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:53,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:54,040 INFO ]: Checked inductivity of 542 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-06-22 11:25:54,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:54,040 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:25:54,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:54,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:54,136 INFO ]: Computing forward predicates... [2018-06-22 11:25:54,376 INFO ]: Checked inductivity of 542 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-06-22 11:25:54,396 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:54,396 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 11:25:54,397 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:25:54,397 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:25:54,397 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:25:54,397 INFO ]: Start difference. First operand 207 states and 328 transitions. Second operand 16 states. [2018-06-22 11:25:54,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:54,778 INFO ]: Finished difference Result 230 states and 376 transitions. [2018-06-22 11:25:54,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:25:54,779 INFO ]: Start accepts. Automaton has 16 states. Word has length 189 [2018-06-22 11:25:54,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:54,782 INFO ]: With dead ends: 230 [2018-06-22 11:25:54,782 INFO ]: Without dead ends: 230 [2018-06-22 11:25:54,783 INFO ]: 0 DeclaredPredicates, 202 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:25:54,783 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 11:25:54,802 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 216. [2018-06-22 11:25:54,802 INFO ]: Start removeUnreachable. Operand 216 states. [2018-06-22 11:25:54,805 INFO ]: Finished removeUnreachable. Reduced from 216 states to 216 states and 348 transitions. [2018-06-22 11:25:54,805 INFO ]: Start accepts. Automaton has 216 states and 348 transitions. Word has length 189 [2018-06-22 11:25:54,806 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:54,806 INFO ]: Abstraction has 216 states and 348 transitions. [2018-06-22 11:25:54,806 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:25:54,806 INFO ]: Start isEmpty. Operand 216 states and 348 transitions. [2018-06-22 11:25:54,812 INFO ]: Finished isEmpty. Found accepting run of length 342 [2018-06-22 11:25:54,812 INFO ]: Found error trace [2018-06-22 11:25:54,812 INFO ]: trace histogram [27, 27, 16, 14, 14, 14, 12, 12, 12, 12, 8, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:54,812 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:54,812 INFO ]: Analyzing trace with hash -530569285, now seen corresponding path program 1 times [2018-06-22 11:25:54,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:54,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:54,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:54,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:54,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:54,854 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:55,132 INFO ]: Checked inductivity of 2036 backedges. 35 proven. 118 refuted. 0 times theorem prover too weak. 1883 trivial. 0 not checked. [2018-06-22 11:25:55,132 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:55,132 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:55,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:55,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:55,270 INFO ]: Computing forward predicates... [2018-06-22 11:25:55,390 INFO ]: Checked inductivity of 2036 backedges. 1122 proven. 34 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-06-22 11:25:55,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:55,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:25:55,417 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:25:55,417 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:25:55,417 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:25:55,417 INFO ]: Start difference. First operand 216 states and 348 transitions. Second operand 9 states. [2018-06-22 11:25:56,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:56,021 INFO ]: Finished difference Result 238 states and 409 transitions. [2018-06-22 11:25:56,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:25:56,021 INFO ]: Start accepts. Automaton has 9 states. Word has length 341 [2018-06-22 11:25:56,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:56,025 INFO ]: With dead ends: 238 [2018-06-22 11:25:56,025 INFO ]: Without dead ends: 237 [2018-06-22 11:25:56,026 INFO ]: 0 DeclaredPredicates, 352 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:25:56,026 INFO ]: Start minimizeSevpa. Operand 237 states. [2018-06-22 11:25:56,041 INFO ]: Finished minimizeSevpa. Reduced states from 237 to 231. [2018-06-22 11:25:56,041 INFO ]: Start removeUnreachable. Operand 231 states. [2018-06-22 11:25:56,044 INFO ]: Finished removeUnreachable. Reduced from 231 states to 231 states and 392 transitions. [2018-06-22 11:25:56,044 INFO ]: Start accepts. Automaton has 231 states and 392 transitions. Word has length 341 [2018-06-22 11:25:56,045 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:56,045 INFO ]: Abstraction has 231 states and 392 transitions. [2018-06-22 11:25:56,045 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:25:56,045 INFO ]: Start isEmpty. Operand 231 states and 392 transitions. [2018-06-22 11:25:56,054 INFO ]: Finished isEmpty. Found accepting run of length 418 [2018-06-22 11:25:56,054 INFO ]: Found error trace [2018-06-22 11:25:56,054 INFO ]: trace histogram [33, 33, 20, 17, 17, 17, 15, 15, 15, 15, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,054 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:56,055 INFO ]: Analyzing trace with hash -2101256586, now seen corresponding path program 2 times [2018-06-22 11:25:56,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:56,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:56,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:56,055 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:56,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:56,101 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:56,408 INFO ]: Checked inductivity of 3146 backedges. 73 proven. 146 refuted. 0 times theorem prover too weak. 2927 trivial. 0 not checked. [2018-06-22 11:25:56,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:56,408 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:56,414 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:25:56,532 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:25:56,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:56,547 INFO ]: Computing forward predicates... [2018-06-22 11:25:56,661 INFO ]: Checked inductivity of 3146 backedges. 1663 proven. 52 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-06-22 11:25:56,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:56,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:25:56,680 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:25:56,681 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:25:56,681 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:25:56,681 INFO ]: Start difference. First operand 231 states and 392 transitions. Second operand 11 states. [2018-06-22 11:25:57,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:57,215 INFO ]: Finished difference Result 257 states and 455 transitions. [2018-06-22 11:25:57,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:25:57,218 INFO ]: Start accepts. Automaton has 11 states. Word has length 417 [2018-06-22 11:25:57,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:57,223 INFO ]: With dead ends: 257 [2018-06-22 11:25:57,223 INFO ]: Without dead ends: 256 [2018-06-22 11:25:57,224 INFO ]: 0 DeclaredPredicates, 430 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:25:57,224 INFO ]: Start minimizeSevpa. Operand 256 states. [2018-06-22 11:25:57,240 INFO ]: Finished minimizeSevpa. Reduced states from 256 to 241. [2018-06-22 11:25:57,240 INFO ]: Start removeUnreachable. Operand 241 states. [2018-06-22 11:25:57,242 INFO ]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2018-06-22 11:25:57,242 INFO ]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 417 [2018-06-22 11:25:57,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:57,243 INFO ]: Abstraction has 241 states and 407 transitions. [2018-06-22 11:25:57,243 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:25:57,243 INFO ]: Start isEmpty. Operand 241 states and 407 transitions. [2018-06-22 11:25:57,249 INFO ]: Finished isEmpty. Found accepting run of length 494 [2018-06-22 11:25:57,249 INFO ]: Found error trace [2018-06-22 11:25:57,249 INFO ]: trace histogram [39, 39, 24, 20, 20, 20, 18, 18, 18, 18, 12, 12, 12, 12, 12, 12, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:57,249 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:57,250 INFO ]: Analyzing trace with hash -1852009423, now seen corresponding path program 3 times [2018-06-22 11:25:57,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:57,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:57,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:57,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:57,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:57,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:58,265 INFO ]: Checked inductivity of 4498 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 4257 trivial. 0 not checked. [2018-06-22 11:25:58,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:58,265 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:58,271 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:25:58,362 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:25:58,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:58,373 INFO ]: Computing forward predicates... [2018-06-22 11:25:58,643 INFO ]: Checked inductivity of 4498 backedges. 176 proven. 107 refuted. 0 times theorem prover too weak. 4215 trivial. 0 not checked. [2018-06-22 11:25:58,668 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:58,668 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 17 [2018-06-22 11:25:58,669 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:25:58,669 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:25:58,669 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:25:58,669 INFO ]: Start difference. First operand 241 states and 407 transitions. Second operand 17 states. [2018-06-22 11:25:59,604 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:59,604 INFO ]: Finished difference Result 278 states and 483 transitions. [2018-06-22 11:25:59,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:25:59,604 INFO ]: Start accepts. Automaton has 17 states. Word has length 493 [2018-06-22 11:25:59,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:59,608 INFO ]: With dead ends: 278 [2018-06-22 11:25:59,608 INFO ]: Without dead ends: 277 [2018-06-22 11:25:59,608 INFO ]: 0 DeclaredPredicates, 505 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:25:59,609 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-22 11:25:59,629 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 261. [2018-06-22 11:25:59,629 INFO ]: Start removeUnreachable. Operand 261 states. [2018-06-22 11:25:59,632 INFO ]: Finished removeUnreachable. Reduced from 261 states to 261 states and 446 transitions. [2018-06-22 11:25:59,632 INFO ]: Start accepts. Automaton has 261 states and 446 transitions. Word has length 493 [2018-06-22 11:25:59,633 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:59,633 INFO ]: Abstraction has 261 states and 446 transitions. [2018-06-22 11:25:59,633 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:25:59,633 INFO ]: Start isEmpty. Operand 261 states and 446 transitions. [2018-06-22 11:25:59,640 INFO ]: Finished isEmpty. Found accepting run of length 798 [2018-06-22 11:25:59,640 INFO ]: Found error trace [2018-06-22 11:25:59,641 INFO ]: trace histogram [63, 63, 40, 32, 32, 32, 30, 30, 30, 30, 20, 20, 20, 20, 20, 20, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,641 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:59,641 INFO ]: Analyzing trace with hash 395489053, now seen corresponding path program 4 times [2018-06-22 11:25:59,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:59,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:59,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:59,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:59,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:59,733 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:00,415 INFO ]: Checked inductivity of 12326 backedges. 136 proven. 271 refuted. 0 times theorem prover too weak. 11919 trivial. 0 not checked. [2018-06-22 11:26:00,415 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:26:00,415 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:26:00,423 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:26:00,688 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:26:00,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:00,709 INFO ]: Computing forward predicates... [2018-06-22 11:26:01,155 INFO ]: Checked inductivity of 12326 backedges. 28 proven. 191 refuted. 0 times theorem prover too weak. 12107 trivial. 0 not checked. [2018-06-22 11:26:01,176 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:26:01,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 18 [2018-06-22 11:26:01,177 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:26:01,177 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:26:01,177 INFO ]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:26:01,177 INFO ]: Start difference. First operand 261 states and 446 transitions. Second operand 18 states. [2018-06-22 11:26:01,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:26:01,706 INFO ]: Finished difference Result 291 states and 519 transitions. [2018-06-22 11:26:01,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:26:01,706 INFO ]: Start accepts. Automaton has 18 states. Word has length 797 [2018-06-22 11:26:01,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:26:01,712 INFO ]: With dead ends: 291 [2018-06-22 11:26:01,712 INFO ]: Without dead ends: 291 [2018-06-22 11:26:01,713 INFO ]: 0 DeclaredPredicates, 816 GetRequests, 794 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:26:01,713 INFO ]: Start minimizeSevpa. Operand 291 states. [2018-06-22 11:26:01,733 INFO ]: Finished minimizeSevpa. Reduced states from 291 to 273. [2018-06-22 11:26:01,734 INFO ]: Start removeUnreachable. Operand 273 states. [2018-06-22 11:26:01,737 INFO ]: Finished removeUnreachable. Reduced from 273 states to 273 states and 487 transitions. [2018-06-22 11:26:01,737 INFO ]: Start accepts. Automaton has 273 states and 487 transitions. Word has length 797 [2018-06-22 11:26:01,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:26:01,739 INFO ]: Abstraction has 273 states and 487 transitions. [2018-06-22 11:26:01,739 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:26:01,739 INFO ]: Start isEmpty. Operand 273 states and 487 transitions. [2018-06-22 11:26:01,746 INFO ]: Finished isEmpty. Found accepting run of length 534 [2018-06-22 11:26:01,746 INFO ]: Found error trace [2018-06-22 11:26:01,746 INFO ]: trace histogram [44, 44, 21, 18, 18, 18, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:01,746 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:26:01,746 INFO ]: Analyzing trace with hash 1277863747, now seen corresponding path program 1 times [2018-06-22 11:26:01,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:26:01,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:26:01,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:01,748 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:26:01,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:01,797 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:02,342 INFO ]: Checked inductivity of 4437 backedges. 78 proven. 117 refuted. 0 times theorem prover too weak. 4242 trivial. 0 not checked. [2018-06-22 11:26:02,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:26:02,343 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:26:02,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:26:02,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:02,506 INFO ]: Computing forward predicates... [2018-06-22 11:26:04,028 INFO ]: Checked inductivity of 4437 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 4391 trivial. 0 not checked. [2018-06-22 11:26:04,049 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:26:04,049 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 17 [2018-06-22 11:26:04,051 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:26:04,051 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:26:04,051 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:26:04,051 INFO ]: Start difference. First operand 273 states and 487 transitions. Second operand 17 states. [2018-06-22 11:26:04,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:26:04,619 INFO ]: Finished difference Result 296 states and 526 transitions. [2018-06-22 11:26:04,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:26:04,619 INFO ]: Start accepts. Automaton has 17 states. Word has length 533 [2018-06-22 11:26:04,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:26:04,622 INFO ]: With dead ends: 296 [2018-06-22 11:26:04,622 INFO ]: Without dead ends: 277 [2018-06-22 11:26:04,623 INFO ]: 0 DeclaredPredicates, 547 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:26:04,623 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-22 11:26:04,642 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-06-22 11:26:04,642 INFO ]: Start removeUnreachable. Operand 275 states. [2018-06-22 11:26:04,645 INFO ]: Finished removeUnreachable. Reduced from 275 states to 275 states and 489 transitions. [2018-06-22 11:26:04,645 INFO ]: Start accepts. Automaton has 275 states and 489 transitions. Word has length 533 [2018-06-22 11:26:04,646 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:26:04,646 INFO ]: Abstraction has 275 states and 489 transitions. [2018-06-22 11:26:04,646 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:26:04,646 INFO ]: Start isEmpty. Operand 275 states and 489 transitions. [2018-06-22 11:26:04,654 INFO ]: Finished isEmpty. Found accepting run of length 790 [2018-06-22 11:26:04,654 INFO ]: Found error trace [2018-06-22 11:26:04,654 INFO ]: trace histogram [65, 65, 33, 28, 28, 28, 22, 22, 22, 22, 15, 15, 15, 15, 15, 15, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:04,655 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:26:04,655 INFO ]: Analyzing trace with hash 1867368632, now seen corresponding path program 1 times [2018-06-22 11:26:04,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:26:04,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:26:04,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:04,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:26:04,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:04,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:05,100 WARN ]: Spent 216.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-06-22 11:26:05,601 WARN ]: Spent 311.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 11:26:05,960 INFO ]: Checked inductivity of 10376 backedges. 148 proven. 141 refuted. 0 times theorem prover too weak. 10087 trivial. 0 not checked. [2018-06-22 11:26:05,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:26:05,960 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:26:05,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:26:06,245 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:06,262 INFO ]: Computing forward predicates... [2018-06-22 11:26:06,764 INFO ]: Checked inductivity of 10376 backedges. 4601 proven. 12 refuted. 0 times theorem prover too weak. 5763 trivial. 0 not checked. [2018-06-22 11:26:06,784 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:26:06,784 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-06-22 11:26:06,785 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:26:06,785 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:26:06,785 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:26:06,785 INFO ]: Start difference. First operand 275 states and 489 transitions. Second operand 15 states. [2018-06-22 11:26:08,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:26:08,195 INFO ]: Finished difference Result 325 states and 619 transitions. [2018-06-22 11:26:08,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:26:08,195 INFO ]: Start accepts. Automaton has 15 states. Word has length 789 [2018-06-22 11:26:08,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:26:08,199 INFO ]: With dead ends: 325 [2018-06-22 11:26:08,199 INFO ]: Without dead ends: 309 [2018-06-22 11:26:08,199 INFO ]: 0 DeclaredPredicates, 805 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:26:08,200 INFO ]: Start minimizeSevpa. Operand 309 states. [2018-06-22 11:26:08,221 INFO ]: Finished minimizeSevpa. Reduced states from 309 to 295. [2018-06-22 11:26:08,221 INFO ]: Start removeUnreachable. Operand 295 states. [2018-06-22 11:26:08,225 INFO ]: Finished removeUnreachable. Reduced from 295 states to 295 states and 530 transitions. [2018-06-22 11:26:08,225 INFO ]: Start accepts. Automaton has 295 states and 530 transitions. Word has length 789 [2018-06-22 11:26:08,226 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:26:08,226 INFO ]: Abstraction has 295 states and 530 transitions. [2018-06-22 11:26:08,226 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:26:08,226 INFO ]: Start isEmpty. Operand 295 states and 530 transitions. [2018-06-22 11:26:08,235 INFO ]: Finished isEmpty. Found accepting run of length 874 [2018-06-22 11:26:08,235 INFO ]: Found error trace [2018-06-22 11:26:08,235 INFO ]: trace histogram [72, 72, 37, 32, 32, 32, 25, 25, 25, 25, 17, 17, 17, 17, 17, 17, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:08,235 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:26:08,236 INFO ]: Analyzing trace with hash 1700233114, now seen corresponding path program 2 times [2018-06-22 11:26:08,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:26:08,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:26:08,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:08,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:26:08,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:08,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:09,248 INFO ]: Checked inductivity of 12932 backedges. 116 proven. 56 refuted. 0 times theorem prover too weak. 12760 trivial. 0 not checked. [2018-06-22 11:26:09,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:26:09,248 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:26:09,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:26:09,550 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:26:09,550 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:09,568 INFO ]: Computing forward predicates... [2018-06-22 11:26:10,108 INFO ]: Checked inductivity of 12932 backedges. 96 proven. 78 refuted. 0 times theorem prover too weak. 12758 trivial. 0 not checked. [2018-06-22 11:26:10,142 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:26:10,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2018-06-22 11:26:10,143 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:26:10,143 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:26:10,143 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:26:10,143 INFO ]: Start difference. First operand 295 states and 530 transitions. Second operand 17 states. [2018-06-22 11:26:11,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:26:11,911 INFO ]: Finished difference Result 458 states and 897 transitions. [2018-06-22 11:26:11,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:26:11,911 INFO ]: Start accepts. Automaton has 17 states. Word has length 873 [2018-06-22 11:26:11,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:26:11,915 INFO ]: With dead ends: 458 [2018-06-22 11:26:11,915 INFO ]: Without dead ends: 420 [2018-06-22 11:26:11,915 INFO ]: 0 DeclaredPredicates, 892 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:26:11,916 INFO ]: Start minimizeSevpa. Operand 420 states. [2018-06-22 11:26:11,947 INFO ]: Finished minimizeSevpa. Reduced states from 420 to 374. [2018-06-22 11:26:11,947 INFO ]: Start removeUnreachable. Operand 374 states. [2018-06-22 11:26:11,951 INFO ]: Finished removeUnreachable. Reduced from 374 states to 374 states and 713 transitions. [2018-06-22 11:26:11,952 INFO ]: Start accepts. Automaton has 374 states and 713 transitions. Word has length 873 [2018-06-22 11:26:11,953 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:26:11,953 INFO ]: Abstraction has 374 states and 713 transitions. [2018-06-22 11:26:11,953 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:26:11,953 INFO ]: Start isEmpty. Operand 374 states and 713 transitions. [2018-06-22 11:26:12,015 INFO ]: Finished isEmpty. Found accepting run of length 3010 [2018-06-22 11:26:12,015 INFO ]: Found error trace [2018-06-22 11:26:12,016 INFO ]: trace histogram [242, 242, 145, 124, 124, 124, 107, 107, 107, 107, 72, 72, 72, 72, 72, 72, 38, 37, 37, 37, 37, 37, 37, 37, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 21, 21, 21, 21, 21, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:26:12,016 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:26:12,017 INFO ]: Analyzing trace with hash -1945532870, now seen corresponding path program 1 times [2018-06-22 11:26:12,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:26:12,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:26:12,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:12,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:26:12,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:12,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:16,185 INFO ]: Checked inductivity of 174564 backedges. 362 proven. 526 refuted. 0 times theorem prover too weak. 173676 trivial. 0 not checked. [2018-06-22 11:26:16,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:26:16,185 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:26:16,203 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:26:17,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:17,080 INFO ]: Computing forward predicates... [2018-06-22 11:26:19,912 INFO ]: Checked inductivity of 174564 backedges. 178 proven. 1416 refuted. 0 times theorem prover too weak. 172970 trivial. 0 not checked. [2018-06-22 11:26:19,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:26:19,936 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-06-22 11:26:19,938 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:26:19,938 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:26:19,938 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:26:19,938 INFO ]: Start difference. First operand 374 states and 713 transitions. Second operand 18 states. [2018-06-22 11:26:20,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:26:20,778 INFO ]: Finished difference Result 350 states and 639 transitions. [2018-06-22 11:26:20,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:26:20,778 INFO ]: Start accepts. Automaton has 18 states. Word has length 3009 [2018-06-22 11:26:20,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:26:20,784 INFO ]: With dead ends: 350 [2018-06-22 11:26:20,784 INFO ]: Without dead ends: 350 [2018-06-22 11:26:20,784 INFO ]: 0 DeclaredPredicates, 3020 GetRequests, 2999 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:26:20,785 INFO ]: Start minimizeSevpa. Operand 350 states. [2018-06-22 11:26:20,812 INFO ]: Finished minimizeSevpa. Reduced states from 350 to 318. [2018-06-22 11:26:20,813 INFO ]: Start removeUnreachable. Operand 318 states. [2018-06-22 11:26:20,815 INFO ]: Finished removeUnreachable. Reduced from 318 states to 318 states and 567 transitions. [2018-06-22 11:26:20,815 INFO ]: Start accepts. Automaton has 318 states and 567 transitions. Word has length 3009 [2018-06-22 11:26:20,818 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:26:20,818 INFO ]: Abstraction has 318 states and 567 transitions. [2018-06-22 11:26:20,818 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:26:20,818 INFO ]: Start isEmpty. Operand 318 states and 567 transitions. [2018-06-22 11:26:20,887 INFO ]: Finished isEmpty. Found accepting run of length 3246 [2018-06-22 11:26:20,887 INFO ]: Found error trace [2018-06-22 11:26:20,888 INFO ]: trace histogram [261, 261, 157, 134, 134, 134, 116, 116, 116, 116, 78, 78, 78, 78, 78, 78, 41, 40, 40, 40, 40, 40, 40, 40, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 23, 23, 23, 23, 23, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:26:20,888 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:26:20,888 INFO ]: Analyzing trace with hash -678643118, now seen corresponding path program 2 times [2018-06-22 11:26:20,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:26:20,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:26:20,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:20,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:26:20,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:21,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:25,759 INFO ]: Checked inductivity of 204021 backedges. 704 proven. 1879 refuted. 0 times theorem prover too weak. 201438 trivial. 0 not checked. [2018-06-22 11:26:25,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:26:25,759 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:26:25,765 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:26:26,619 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:26:26,619 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:26,668 INFO ]: Computing forward predicates... [2018-06-22 11:26:30,409 INFO ]: Checked inductivity of 204021 backedges. 268 proven. 1773 refuted. 0 times theorem prover too weak. 201980 trivial. 0 not checked. [2018-06-22 11:26:30,434 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:26:30,434 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2018-06-22 11:26:30,436 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:26:30,436 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:26:30,436 INFO ]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:26:30,436 INFO ]: Start difference. First operand 318 states and 567 transitions. Second operand 24 states. [2018-06-22 11:26:31,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:26:31,940 INFO ]: Finished difference Result 393 states and 766 transitions. [2018-06-22 11:26:31,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:26:31,940 INFO ]: Start accepts. Automaton has 24 states. Word has length 3245 [2018-06-22 11:26:31,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:26:31,946 INFO ]: With dead ends: 393 [2018-06-22 11:26:31,946 INFO ]: Without dead ends: 393 [2018-06-22 11:26:31,947 INFO ]: 0 DeclaredPredicates, 3277 GetRequests, 3244 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:26:31,947 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-22 11:26:31,973 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 373. [2018-06-22 11:26:31,973 INFO ]: Start removeUnreachable. Operand 373 states. [2018-06-22 11:26:31,977 INFO ]: Finished removeUnreachable. Reduced from 373 states to 373 states and 716 transitions. [2018-06-22 11:26:31,977 INFO ]: Start accepts. Automaton has 373 states and 716 transitions. Word has length 3245 [2018-06-22 11:26:31,979 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:26:31,979 INFO ]: Abstraction has 373 states and 716 transitions. [2018-06-22 11:26:31,979 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:26:31,980 INFO ]: Start isEmpty. Operand 373 states and 716 transitions. [2018-06-22 11:26:32,095 INFO ]: Finished isEmpty. Found accepting run of length 4698 [2018-06-22 11:26:32,095 INFO ]: Found error trace [2018-06-22 11:26:32,097 INFO ]: trace histogram [376, 376, 233, 192, 192, 192, 174, 173, 173, 173, 116, 116, 116, 116, 116, 116, 60, 59, 59, 59, 59, 59, 59, 59, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 41, 41, 41, 41, 41, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 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:26:32,097 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:26:32,097 INFO ]: Analyzing trace with hash -1383394819, now seen corresponding path program 1 times [2018-06-22 11:26:32,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:26:32,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:26:32,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:32,098 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:26:32,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:26:32,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:39,416 INFO ]: Checked inductivity of 437650 backedges. 689 proven. 2378 refuted. 0 times theorem prover too weak. 434583 trivial. 0 not checked. [2018-06-22 11:26:39,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:26:39,416 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:26:39,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:26:40,705 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:26:40,771 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 11:26:46,689 INFO ]: Checked inductivity of 437650 backedges. 30761 proven. 35 refuted. 0 times theorem prover too weak. 406854 trivial. 0 not checked. [2018-06-22 11:26:46,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:26:46,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:26:46,719 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:26:46,719 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:26:46,719 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:26:46,719 INFO ]: Start difference. First operand 373 states and 716 transitions. Second operand 9 states. [2018-06-22 11:26:46,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:26:46,720 WARN ]: Verification canceled [2018-06-22 11:26:46,725 WARN ]: Timeout [2018-06-22 11:26:46,725 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:26:46 BoogieIcfgContainer [2018-06-22 11:26:46,725 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:26:46,726 INFO ]: Toolchain (without parser) took 60797.13 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 239.5 MB in the beginning and 307.2 MB in the end (delta: -67.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-22 11:26:46,726 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:26:46,727 INFO ]: ChcToBoogie took 82.39 ms. Allocated memory is still 303.0 MB. Free memory was 239.5 MB in the beginning and 237.5 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:26:46,728 INFO ]: Boogie Preprocessor took 108.93 ms. Allocated memory is still 303.0 MB. Free memory was 237.5 MB in the beginning and 235.5 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:26:46,728 INFO ]: RCFGBuilder took 937.67 ms. Allocated memory is still 303.0 MB. Free memory was 235.5 MB in the beginning and 195.6 MB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:26:46,728 INFO ]: TraceAbstraction took 59658.02 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 195.6 MB in the beginning and 307.2 MB in the end (delta: -111.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-22 11:26:46,731 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 82.39 ms. Allocated memory is still 303.0 MB. Free memory was 239.5 MB in the beginning and 237.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 108.93 ms. Allocated memory is still 303.0 MB. Free memory was 237.5 MB in the beginning and 235.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 937.67 ms. Allocated memory is still 303.0 MB. Free memory was 235.5 MB in the beginning and 195.6 MB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59658.02 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 195.6 MB in the beginning and 307.2 MB in the end (delta: -111.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (373states) and interpolant automaton (currently 2 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 33 procedures, 218 locations, 1 error locations. TIMEOUT Result, 59.5s OverallTime, 17 OverallIterations, 376 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4122 SDtfs, 153 SDslu, 38739 SDs, 0 SdLazy, 12593 SolverSat, 415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15836 GetRequests, 15597 SyntacticMatches, 6 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=374occurred in iteration=14, 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.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 210 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 31534 NumberOfCodeBlocks, 31220 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 31504 ConstructedInterpolants, 0 QuantifiedInterpolants, 90805408 SizeOfPredicates, 51 NumberOfNonLiveVariables, 44465 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 1725079/1734521 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/a-copy-print.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-26-46-752.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-copy-print.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-26-46-752.csv Completed graceful shutdown