./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:23:49,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:23:49,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:23:49,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:23:49,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:23:49,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:23:49,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:23:49,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:23:49,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:23:49,210 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:23:49,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:23:49,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:23:49,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:23:49,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:23:49,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:23:49,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:23:49,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:23:49,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:23:49,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:23:49,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:23:49,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:23:49,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:23:49,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:23:49,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:23:49,227 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:23:49,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:23:49,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:23:49,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:23:49,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:23:49,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:23:49,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:23:49,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:23:49,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:23:49,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:23:49,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:23:49,234 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:23:49,234 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 12:23:49,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:23:49,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:23:49,247 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:23:49,247 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 12:23:49,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:23:49,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:23:49,248 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:23:49,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:23:49,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:23:49,257 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:23:49,257 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:23:49,257 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:23:49,257 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:23:49,257 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:23:49,257 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:23:49,258 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:23:49,258 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:23:49,258 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:23:49,258 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:23:49,258 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:23:49,258 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:23:49,258 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:23:49,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:23:49,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:23:49,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:23:49,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:23:49,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:23:49,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:23:49,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:23:49,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:23:49,262 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-18 12:23:49,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:23:49,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:23:49,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:23:49,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:23:49,304 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:23:49,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 12:23:49,353 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/data/c6a10af95/e6132fac27b8427f90e29faee9edefa0/FLAG6c682d456 [2018-11-18 12:23:49,776 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:23:49,781 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 12:23:49,797 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/data/c6a10af95/e6132fac27b8427f90e29faee9edefa0/FLAG6c682d456 [2018-11-18 12:23:49,806 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/data/c6a10af95/e6132fac27b8427f90e29faee9edefa0 [2018-11-18 12:23:49,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:23:49,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 12:23:49,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:23:49,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:23:49,812 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:23:49,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:23:49" (1/1) ... [2018-11-18 12:23:49,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316a6cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:49, skipping insertion in model container [2018-11-18 12:23:49,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:23:49" (1/1) ... [2018-11-18 12:23:49,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:23:49,862 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:23:50,090 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:23:50,096 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:23:50,133 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:23:50,220 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:23:50,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50 WrapperNode [2018-11-18 12:23:50,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:23:50,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:23:50,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:23:50,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:23:50,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (1/1) ... [2018-11-18 12:23:50,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (1/1) ... [2018-11-18 12:23:50,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (1/1) ... [2018-11-18 12:23:50,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (1/1) ... [2018-11-18 12:23:50,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (1/1) ... [2018-11-18 12:23:50,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (1/1) ... [2018-11-18 12:23:50,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (1/1) ... [2018-11-18 12:23:50,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:23:50,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:23:50,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:23:50,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:23:50,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:23:50,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:23:50,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:23:50,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:23:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 12:23:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 12:23:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 12:23:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 12:23:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 12:23:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 12:23:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 12:23:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 12:23:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 12:23:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 12:23:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 12:23:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 12:23:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 12:23:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 12:23:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 12:23:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 12:23:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 12:23:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 12:23:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 12:23:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 12:23:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 12:23:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 12:23:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:23:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:23:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:23:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:23:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:23:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:23:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:23:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 12:23:50,710 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:23:50,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:50 BoogieIcfgContainer [2018-11-18 12:23:50,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:23:50,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:23:50,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:23:50,713 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:23:50,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:23:49" (1/3) ... [2018-11-18 12:23:50,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4cc795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:23:50, skipping insertion in model container [2018-11-18 12:23:50,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:50" (2/3) ... [2018-11-18 12:23:50,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4cc795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:23:50, skipping insertion in model container [2018-11-18 12:23:50,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:50" (3/3) ... [2018-11-18 12:23:50,716 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 12:23:50,725 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:23:50,734 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-18 12:23:50,747 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-18 12:23:50,773 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:23:50,774 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:23:50,774 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:23:50,774 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:23:50,774 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:23:50,774 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:23:50,774 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:23:50,774 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:23:50,774 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:23:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-11-18 12:23:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 12:23:50,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:50,796 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:50,798 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:50,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1973375195, now seen corresponding path program 1 times [2018-11-18 12:23:50,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:50,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:50,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:50,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:50,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:50,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:50,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:23:50,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 12:23:50,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:23:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:23:50,935 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-11-18 12:23:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:50,950 INFO L93 Difference]: Finished difference Result 110 states and 168 transitions. [2018-11-18 12:23:50,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:23:50,951 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 12:23:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:50,957 INFO L225 Difference]: With dead ends: 110 [2018-11-18 12:23:50,957 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 12:23:50,960 INFO L604 BasicCegarLoop]: 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-11-18 12:23:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 12:23:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-18 12:23:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 12:23:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-18 12:23:50,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 11 [2018-11-18 12:23:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:50,987 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-18 12:23:50,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 12:23:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-18 12:23:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 12:23:50,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:50,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:50,988 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:50,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash 728303766, now seen corresponding path program 1 times [2018-11-18 12:23:50,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:50,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:51,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:51,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:23:51,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:23:51,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:23:51,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:23:51,067 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-11-18 12:23:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:51,144 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-18 12:23:51,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:23:51,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-18 12:23:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:51,145 INFO L225 Difference]: With dead ends: 58 [2018-11-18 12:23:51,145 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 12:23:51,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:23:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 12:23:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-18 12:23:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 12:23:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-18 12:23:51,150 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2018-11-18 12:23:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:51,150 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-18 12:23:51,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:23:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-18 12:23:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 12:23:51,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:51,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:51,151 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:51,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash 728182618, now seen corresponding path program 1 times [2018-11-18 12:23:51,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:51,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:51,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:51,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:51,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:23:51,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:23:51,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:23:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:23:51,233 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 4 states. [2018-11-18 12:23:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:51,317 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-11-18 12:23:51,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:23:51,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-18 12:23:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:51,319 INFO L225 Difference]: With dead ends: 48 [2018-11-18 12:23:51,319 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 12:23:51,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:23:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 12:23:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-18 12:23:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 12:23:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-18 12:23:51,324 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-11-18 12:23:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:51,325 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-18 12:23:51,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:23:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-18 12:23:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:23:51,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:51,326 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:51,326 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:51,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1273281489, now seen corresponding path program 1 times [2018-11-18 12:23:51,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:51,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:51,626 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 14 [2018-11-18 12:23:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:51,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:51,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:23:51,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:23:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:23:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:23:51,690 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 6 states. [2018-11-18 12:23:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:51,978 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-11-18 12:23:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:23:51,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 12:23:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:51,980 INFO L225 Difference]: With dead ends: 94 [2018-11-18 12:23:51,980 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 12:23:51,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:23:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 12:23:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2018-11-18 12:23:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 12:23:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-18 12:23:51,988 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 16 [2018-11-18 12:23:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:51,988 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-18 12:23:51,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:23:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-18 12:23:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:23:51,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:51,989 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:51,989 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:51,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash -587495827, now seen corresponding path program 1 times [2018-11-18 12:23:51,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:51,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:52,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:52,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:23:52,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:23:52,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:23:52,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:23:52,047 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 4 states. [2018-11-18 12:23:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:52,102 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-18 12:23:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:23:52,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-18 12:23:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:52,103 INFO L225 Difference]: With dead ends: 65 [2018-11-18 12:23:52,103 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 12:23:52,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:23:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 12:23:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-18 12:23:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 12:23:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-11-18 12:23:52,110 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2018-11-18 12:23:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:52,110 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-18 12:23:52,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:23:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-11-18 12:23:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 12:23:52,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:52,111 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:52,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:52,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash -92488659, now seen corresponding path program 1 times [2018-11-18 12:23:52,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:52,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:52,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:52,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:52,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:52,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:23:52,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:23:52,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:23:52,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:23:52,291 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 4 states. [2018-11-18 12:23:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:52,336 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-11-18 12:23:52,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:23:52,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-18 12:23:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:52,337 INFO L225 Difference]: With dead ends: 63 [2018-11-18 12:23:52,337 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 12:23:52,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:23:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 12:23:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-18 12:23:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 12:23:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-18 12:23:52,343 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-11-18 12:23:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:52,344 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-18 12:23:52,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:23:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-18 12:23:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 12:23:52,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:52,345 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:52,345 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:52,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1155134435, now seen corresponding path program 1 times [2018-11-18 12:23:52,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:52,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:52,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:52,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:52,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:52,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:23:52,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:23:52,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:23:52,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:23:52,533 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-11-18 12:23:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:52,588 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-18 12:23:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:23:52,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 12:23:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:52,589 INFO L225 Difference]: With dead ends: 79 [2018-11-18 12:23:52,589 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 12:23:52,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:23:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 12:23:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-18 12:23:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 12:23:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-11-18 12:23:52,595 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 22 [2018-11-18 12:23:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:52,595 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-11-18 12:23:52,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:23:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-11-18 12:23:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 12:23:52,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:52,596 INFO L375 BasicCegarLoop]: 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] [2018-11-18 12:23:52,597 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:52,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash -112134043, now seen corresponding path program 1 times [2018-11-18 12:23:52,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:52,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:52,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:23:52,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:23:52,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:52,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-11-18 12:23:52,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-18 12:23:52,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:52,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 12:23:52,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:52,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:52,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-18 12:23:52,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-18 12:23:52,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:52,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 12:23:52,997 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,003 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-11-18 12:23:53,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-18 12:23:53,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-11-18 12:23:53,049 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,058 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-18 12:23:53,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2018-11-18 12:23:53,101 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 12:23:53,101 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 47 [2018-11-18 12:23:53,140 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 51 [2018-11-18 12:23:53,201 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 12:23:53,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:53,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-11-18 12:23:53,256 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,293 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 12:23:53,333 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 12:23:53,397 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 12:23:53,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-11-18 12:23:53,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-18 12:23:53,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-11-18 12:23:53,485 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,494 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-18 12:23:53,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2018-11-18 12:23:53,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,539 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:53,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-11-18 12:23:53,542 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 47 [2018-11-18 12:23:53,605 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 51 [2018-11-18 12:23:53,738 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-18 12:23:53,861 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 12:23:53,888 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 12:23:53,913 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 12:23:53,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-11-18 12:23:53,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-18 12:23:53,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 12:23:53,931 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,936 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-18 12:23:53,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-18 12:23:53,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:53,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 12:23:53,974 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,979 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,986 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:53,992 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:54,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 16 xjuncts. [2018-11-18 12:23:54,057 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 2 variables, input treesize:85, output treesize:937 [2018-11-18 12:23:54,289 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-11-18 12:23:54,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 83 [2018-11-18 12:23:54,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 87 [2018-11-18 12:23:54,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 12:23:54,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-11-18 12:23:54,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:54,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-11-18 12:23:54,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:54,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:23:54,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-11-18 12:23:54,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-18 12:23:54,713 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:54,724 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:54,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-18 12:23:54,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:54,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-18 12:23:54,795 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:54,800 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:54,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:54,826 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:265, output treesize:7 [2018-11-18 12:23:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:54,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:23:54,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 12:23:54,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:23:54,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:23:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:23:54,867 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-11-18 12:23:55,062 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2018-11-18 12:23:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:55,298 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-18 12:23:55,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:23:55,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-18 12:23:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:55,300 INFO L225 Difference]: With dead ends: 94 [2018-11-18 12:23:55,300 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 12:23:55,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:23:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 12:23:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-18 12:23:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 12:23:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-11-18 12:23:55,305 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 26 [2018-11-18 12:23:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:55,305 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-11-18 12:23:55,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:23:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-11-18 12:23:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 12:23:55,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:55,306 INFO L375 BasicCegarLoop]: 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-11-18 12:23:55,307 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:55,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash 507644997, now seen corresponding path program 1 times [2018-11-18 12:23:55,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:55,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:55,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:55,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:55,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:23:55,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/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-11-18 12:23:55,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:55,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:55,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 12:23:55,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:23:55,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-18 12:23:55,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:23:55,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 12:23:55,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-18 12:23:55,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,755 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 12:23:55,766 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:46, output treesize:32 [2018-11-18 12:23:55,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:55,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:55,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 12:23:55,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-18 12:23:55,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:23:55,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 12:23:55,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 12:23:55,891 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:55,941 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:59, output treesize:24 [2018-11-18 12:23:55,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:56,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:56,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:56,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:23:56,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 70 [2018-11-18 12:23:56,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:23:56,145 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-18 12:23:56,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-11-18 12:23:56,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-18 12:23:56,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:23:56,196 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-11-18 12:23:56,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:23:56,224 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,230 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 12:23:56,243 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:122, output treesize:40 [2018-11-18 12:23:56,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-11-18 12:23:56,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 12:23:56,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 12:23:56,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 12:23:56,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:56,374 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-11-18 12:23:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:56,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:23:56,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-18 12:23:56,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:23:56,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:23:56,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:23:56,404 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 13 states. [2018-11-18 12:23:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:56,944 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-11-18 12:23:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:23:56,945 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-18 12:23:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:56,945 INFO L225 Difference]: With dead ends: 106 [2018-11-18 12:23:56,945 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 12:23:56,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-11-18 12:23:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 12:23:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 46. [2018-11-18 12:23:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 12:23:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-18 12:23:56,954 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 29 [2018-11-18 12:23:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:56,954 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-18 12:23:56,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:23:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-18 12:23:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 12:23:56,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:56,955 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:56,955 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:56,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash -504642115, now seen corresponding path program 1 times [2018-11-18 12:23:56,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:56,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:56,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:56,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:56,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:57,301 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2018-11-18 12:23:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:57,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:23:57,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/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-11-18 12:23:57,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:57,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:57,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 12:23:57,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:23:57,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:23:57,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-11-18 12:23:57,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:57,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:57,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:23:57,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-18 12:23:57,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:23:57,777 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-18 12:23:57,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:23:57,799 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-18 12:23:57,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:57,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 47 [2018-11-18 12:23:57,821 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-11-18 12:23:57,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:23:57,902 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-18 12:23:57,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:23:57,927 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:57,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-18 12:23:57,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:57,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-18 12:23:57,944 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,953 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,982 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,988 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:57,998 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:191, output treesize:71 [2018-11-18 12:23:58,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-18 12:23:58,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-18 12:23:58,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:102, output treesize:94 [2018-11-18 12:23:58,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 67 [2018-11-18 12:23:58,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2018-11-18 12:23:58,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-18 12:23:58,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-11-18 12:23:58,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:58,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 12:23:58,132 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-18 12:23:58,138 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,145 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:108, output treesize:13 [2018-11-18 12:23:58,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 12:23:58,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 12:23:58,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:58,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 12:23:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:58,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:23:58,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 19 [2018-11-18 12:23:58,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 12:23:58,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 12:23:58,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-18 12:23:58,207 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 19 states. [2018-11-18 12:23:58,853 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 12:23:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:59,241 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-11-18 12:23:59,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:23:59,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-11-18 12:23:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:59,242 INFO L225 Difference]: With dead ends: 115 [2018-11-18 12:23:59,242 INFO L226 Difference]: Without dead ends: 101 [2018-11-18 12:23:59,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2018-11-18 12:23:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-18 12:23:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-11-18 12:23:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 12:23:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-11-18 12:23:59,250 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 39 [2018-11-18 12:23:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:59,250 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-11-18 12:23:59,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 12:23:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-18 12:23:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 12:23:59,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:59,251 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:59,252 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:59,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash -482009861, now seen corresponding path program 1 times [2018-11-18 12:23:59,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:59,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:59,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:59,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:23:59,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/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-11-18 12:23:59,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:59,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:59,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 12:23:59,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:23:59,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:23:59,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-11-18 12:23:59,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:59,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:59,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 12:23:59,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-18 12:23:59,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:23:59,683 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-18 12:23:59,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:23:59,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-18 12:23:59,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:59,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 47 [2018-11-18 12:23:59,729 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,744 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,755 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-11-18 12:23:59,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:23:59,874 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:59,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-18 12:23:59,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:23:59,967 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-18 12:24:00,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-18 12:24:00,034 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,137 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,155 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,163 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,177 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:200, output treesize:99 [2018-11-18 12:24:00,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-18 12:24:00,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 600 treesize of output 357 [2018-11-18 12:24:00,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 362 [2018-11-18 12:24:00,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 356 [2018-11-18 12:24:00,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-18 12:24:00,445 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,479 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:24:00,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 353 [2018-11-18 12:24:00,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,517 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 403 [2018-11-18 12:24:00,519 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:24:00,577 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,599 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:24:00,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 335 treesize of output 212 [2018-11-18 12:24:00,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-11-18 12:24:00,703 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 163 [2018-11-18 12:24:00,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-18 12:24:00,727 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,745 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:24:00,746 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 172 [2018-11-18 12:24:00,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,757 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:24:00,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 58 [2018-11-18 12:24:00,758 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,774 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,788 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,797 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,826 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:614, output treesize:174 [2018-11-18 12:24:00,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 102 [2018-11-18 12:24:00,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-18 12:24:00,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-18 12:24:00,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:00,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-11-18 12:24:00,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:00,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:01,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:24:01,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:255, output treesize:96 [2018-11-18 12:24:01,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:01,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:24:01,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 65 [2018-11-18 12:24:01,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-18 12:24:01,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:01,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-18 12:24:01,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:01,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 12:24:01,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:24:01,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:01,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:24:01,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:4 [2018-11-18 12:24:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:24:01,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:24:01,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-18 12:24:01,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 12:24:01,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 12:24:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:24:01,200 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 15 states. [2018-11-18 12:24:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:24:02,234 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-11-18 12:24:02,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:24:02,235 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-11-18 12:24:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:24:02,236 INFO L225 Difference]: With dead ends: 130 [2018-11-18 12:24:02,236 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 12:24:02,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-11-18 12:24:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 12:24:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2018-11-18 12:24:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 12:24:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-18 12:24:02,244 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 39 [2018-11-18 12:24:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:24:02,244 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-18 12:24:02,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 12:24:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-11-18 12:24:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 12:24:02,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:24:02,246 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:24:02,246 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:24:02,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:24:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1476042883, now seen corresponding path program 1 times [2018-11-18 12:24:02,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:24:02,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:24:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:24:02,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:24:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:24:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:24:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:24:02,320 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:24:02,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:24:02 BoogieIcfgContainer [2018-11-18 12:24:02,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:24:02,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:24:02,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:24:02,385 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:24:02,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:50" (3/4) ... [2018-11-18 12:24:02,388 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 12:24:02,446 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d3e660d8-dbad-496d-9d53-cc79a88a85e1/bin-2019/uautomizer/witness.graphml [2018-11-18 12:24:02,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:24:02,447 INFO L168 Benchmark]: Toolchain (without parser) took 12638.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.2 MB). Free memory was 955.8 MB in the beginning and 1.3 GB in the end (delta: -317.8 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:24:02,447 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:24:02,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 955.8 MB in the beginning and 1.2 GB in the end (delta: -217.8 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:24:02,447 INFO L168 Benchmark]: Boogie Preprocessor took 41.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:24:02,448 INFO L168 Benchmark]: RCFGBuilder took 447.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:24:02,448 INFO L168 Benchmark]: TraceAbstraction took 11674.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:24:02,448 INFO L168 Benchmark]: Witness Printer took 60.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:24:02,452 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 955.8 MB in the beginning and 1.2 GB in the end (delta: -217.8 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11674.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Witness Printer took 60.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] FCALL null->next = ((void*)0) [L989] FCALL null->prev = ((void*)0) [L990] FCALL null->colour = BLACK [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] FCALL list->next = null [L994] FCALL list->prev = null [L995] FCALL list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={14:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1003] FCALL end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR, FCALL end->next [L1004] FCALL end->next->prev = end [L1005] EXPR, FCALL end->next [L1005] end = end->next [L1006] FCALL end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] FCALL end->colour = RED [L1015] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1015] FCALL end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR, FCALL end->next [L1016] FCALL end->next->prev = end [L1017] EXPR, FCALL end->next [L1017] end = end->next [L1018] FCALL end->next = null [L1019] FCALL end->colour = BLACK VAL [end={18:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1021] EXPR, FCALL end->colour VAL [end={18:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1021] COND FALSE !(0) VAL [end={18:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1022] EXPR, FCALL end->next VAL [end={18:0}, end->next={14:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1022] COND FALSE !(!(null == end->next)) [L1022] COND FALSE !(0) VAL [end={18:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1023] COND FALSE !(!(null != end)) VAL [end={18:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1023] COND FALSE !(0) VAL [end={18:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1030] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1031] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1032] COND TRUE null != end [L1034] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=0, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={18:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1037] COND FALSE !(0) VAL [end={18:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1038] EXPR, FCALL end->colour VAL [end={18:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={18:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={18:0}, malloc(sizeof(struct TSLL))={16:0}, null={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 7 error locations. UNSAFE Result, 11.6s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 459 SDtfs, 618 SDslu, 1714 SDs, 0 SdLazy, 1299 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 129 SyntacticMatches, 7 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 154 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 361 ConstructedInterpolants, 35 QuantifiedInterpolants, 440129 SizeOfPredicates, 53 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 2/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...