./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:33:31,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:33:31,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:33:31,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:33:31,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:33:31,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:33:31,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:33:31,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:33:31,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:33:31,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:33:31,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:33:31,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:33:31,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:33:31,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:33:31,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:33:31,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:33:31,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:33:31,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:33:31,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:33:31,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:33:31,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:33:31,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:33:31,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:33:31,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:33:31,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:33:31,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:33:31,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:33:31,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:33:31,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:33:31,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:33:31,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:33:31,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:33:31,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:33:31,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:33:31,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:33:31,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:33:31,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:33:31,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:33:31,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:33:31,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:33:31,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:33:31,152 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-23 02:33:31,186 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:33:31,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:33:31,186 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:33:31,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:33:31,187 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:33:31,187 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:33:31,188 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:33:31,188 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:33:31,188 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:33:31,188 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:33:31,189 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:33:31,189 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:33:31,189 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:33:31,189 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:33:31,189 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:33:31,190 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:33:31,190 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:33:31,190 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:33:31,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:33:31,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:33:31,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:33:31,192 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:33:31,192 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:33:31,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:33:31,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:33:31,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:33:31,193 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:33:31,193 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:33:31,193 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:33:31,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:33:31,193 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:33:31,194 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:33:31,194 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:33:31,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:33:31,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:33:31,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:33:31,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:33:31,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:33:31,195 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:33:31,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:33:31,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:33:31,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:33:31,196 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2021-11-23 02:33:31,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:33:31,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:33:31,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:33:31,501 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:33:31,502 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:33:31,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-11-23 02:33:31,571 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data/155a08383/90a24c18eef04ea3b7ae82249fc45f55/FLAG6ad365a25 [2021-11-23 02:33:32,164 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:33:32,165 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-11-23 02:33:32,190 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data/155a08383/90a24c18eef04ea3b7ae82249fc45f55/FLAG6ad365a25 [2021-11-23 02:33:32,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data/155a08383/90a24c18eef04ea3b7ae82249fc45f55 [2021-11-23 02:33:32,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:33:32,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:33:32,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:33:32,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:33:32,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:33:32,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:32,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df94af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32, skipping insertion in model container [2021-11-23 02:33:32,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:32,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:33:32,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:33:32,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2021-11-23 02:33:32,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:33:32,859 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:33:32,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2021-11-23 02:33:32,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:33:32,940 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:33:32,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32 WrapperNode [2021-11-23 02:33:32,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:33:32,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:33:32,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:33:32,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:33:32,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:32,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,013 INFO L137 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 164 [2021-11-23 02:33:33,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:33:33,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:33:33,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:33:33,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:33:33,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:33:33,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:33:33,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:33:33,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:33:33,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (1/1) ... [2021-11-23 02:33:33,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:33:33,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:33:33,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:33:33,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:33:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 02:33:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 02:33:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 02:33:33,146 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 02:33:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:33:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:33:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:33:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:33:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 02:33:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:33:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:33:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:33:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:33:33,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:33:33,324 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:33:33,340 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:33:33,858 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:33:33,931 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:33:33,933 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-23 02:33:33,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:33 BoogieIcfgContainer [2021-11-23 02:33:33,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:33:33,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:33:33,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:33:33,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:33:33,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:33:32" (1/3) ... [2021-11-23 02:33:33,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c93d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:33, skipping insertion in model container [2021-11-23 02:33:33,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:32" (2/3) ... [2021-11-23 02:33:33,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c93d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:33, skipping insertion in model container [2021-11-23 02:33:33,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:33" (3/3) ... [2021-11-23 02:33:33,947 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2021-11-23 02:33:33,953 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:33:33,953 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2021-11-23 02:33:34,010 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:33:34,022 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:33:34,022 INFO L340 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2021-11-23 02:33:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 52 states have (on average 2.3846153846153846) internal successors, (124), 110 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-23 02:33:34,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:34,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-23 02:33:34,064 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:34,071 INFO L85 PathProgramCache]: Analyzing trace with hash 246748118, now seen corresponding path program 1 times [2021-11-23 02:33:34,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:33:34,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515138998] [2021-11-23 02:33:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:34,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:33:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:34,325 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:33:34,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515138998] [2021-11-23 02:33:34,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515138998] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:34,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:34,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:33:34,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212711446] [2021-11-23 02:33:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:34,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:33:34,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:33:34,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:33:34,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:33:34,375 INFO L87 Difference]: Start difference. First operand has 115 states, 52 states have (on average 2.3846153846153846) internal successors, (124), 110 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:33:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:34,574 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2021-11-23 02:33:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:33:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-23 02:33:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:34,588 INFO L225 Difference]: With dead ends: 113 [2021-11-23 02:33:34,588 INFO L226 Difference]: Without dead ends: 111 [2021-11-23 02:33:34,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:33:34,594 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:34,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:33:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-23 02:33:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-23 02:33:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 51 states have (on average 2.2549019607843137) internal successors, (115), 106 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-11-23 02:33:34,657 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 5 [2021-11-23 02:33:34,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:34,658 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-11-23 02:33:34,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:33:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-11-23 02:33:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-23 02:33:34,659 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:34,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-23 02:33:34,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:33:34,660 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:34,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash 246748119, now seen corresponding path program 1 times [2021-11-23 02:33:34,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:33:34,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468992974] [2021-11-23 02:33:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:34,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:33:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:34,766 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:33:34,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468992974] [2021-11-23 02:33:34,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468992974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:34,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:34,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:33:34,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119582326] [2021-11-23 02:33:34,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:34,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:33:34,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:33:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:33:34,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:33:34,784 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:33:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:34,917 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2021-11-23 02:33:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:33:34,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-23 02:33:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:34,925 INFO L225 Difference]: With dead ends: 109 [2021-11-23 02:33:34,926 INFO L226 Difference]: Without dead ends: 109 [2021-11-23 02:33:34,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:33:34,933 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:34,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:33:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-23 02:33:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-23 02:33:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 51 states have (on average 2.215686274509804) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2021-11-23 02:33:34,945 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 5 [2021-11-23 02:33:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:34,946 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2021-11-23 02:33:34,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:33:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2021-11-23 02:33:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:33:34,947 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:34,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:34,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:33:34,948 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1094018592, now seen corresponding path program 1 times [2021-11-23 02:33:34,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:33:34,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570711841] [2021-11-23 02:33:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:34,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:33:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:35,010 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:33:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570711841] [2021-11-23 02:33:35,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570711841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:35,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:35,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:33:35,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527034042] [2021-11-23 02:33:35,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:35,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:33:35,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:33:35,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:33:35,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:33:35,013 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:33:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:35,050 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2021-11-23 02:33:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:33:35,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-23 02:33:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:35,052 INFO L225 Difference]: With dead ends: 115 [2021-11-23 02:33:35,052 INFO L226 Difference]: Without dead ends: 115 [2021-11-23 02:33:35,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:33:35,054 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:35,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 203 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:33:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-23 02:33:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2021-11-23 02:33:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-11-23 02:33:35,066 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 10 [2021-11-23 02:33:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:35,066 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-11-23 02:33:35,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:33:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-11-23 02:33:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:33:35,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:35,068 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:35,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 02:33:35,068 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash 727488831, now seen corresponding path program 1 times [2021-11-23 02:33:35,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:33:35,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629509770] [2021-11-23 02:33:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:35,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:33:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 02:33:35,180 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:33:35,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629509770] [2021-11-23 02:33:35,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629509770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:35,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:35,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:33:35,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010286049] [2021-11-23 02:33:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:35,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:33:35,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:33:35,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:33:35,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:33:35,183 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:33:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:35,418 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2021-11-23 02:33:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:33:35,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-23 02:33:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:35,423 INFO L225 Difference]: With dead ends: 110 [2021-11-23 02:33:35,423 INFO L226 Difference]: Without dead ends: 110 [2021-11-23 02:33:35,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:33:35,433 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:35,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 318 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:33:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-23 02:33:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2021-11-23 02:33:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 52 states have (on average 2.173076923076923) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2021-11-23 02:33:35,446 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 17 [2021-11-23 02:33:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:35,447 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2021-11-23 02:33:35,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:33:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2021-11-23 02:33:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:33:35,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:35,448 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:35,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:33:35,449 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash 727488832, now seen corresponding path program 1 times [2021-11-23 02:33:35,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:33:35,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074536300] [2021-11-23 02:33:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:35,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:33:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:35,553 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:33:35,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074536300] [2021-11-23 02:33:35,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074536300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:35,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:35,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:33:35,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708518200] [2021-11-23 02:33:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:35,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:33:35,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:33:35,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:33:35,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:33:35,557 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:33:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:35,759 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-11-23 02:33:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:33:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-23 02:33:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:35,761 INFO L225 Difference]: With dead ends: 109 [2021-11-23 02:33:35,761 INFO L226 Difference]: Without dead ends: 109 [2021-11-23 02:33:35,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:33:35,762 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 7 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:35,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 342 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:33:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-23 02:33:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2021-11-23 02:33:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 52 states have (on average 2.1538461538461537) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2021-11-23 02:33:35,794 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 17 [2021-11-23 02:33:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:35,794 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2021-11-23 02:33:35,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:33:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2021-11-23 02:33:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:33:35,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:35,797 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:35,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 02:33:35,797 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash -962684734, now seen corresponding path program 1 times [2021-11-23 02:33:35,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:33:35,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689462665] [2021-11-23 02:33:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:35,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:33:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:35,999 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:33:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689462665] [2021-11-23 02:33:35,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689462665] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:33:36,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882712877] [2021-11-23 02:33:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:36,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:33:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:33:36,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:33:36,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:33:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:36,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 02:33:36,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:33:36,182 INFO L388 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 6 treesize of output 5 [2021-11-23 02:33:36,332 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-23 02:33:36,333 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 9 [2021-11-23 02:33:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:36,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:33:36,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882712877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:36,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:33:36,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-23 02:33:36,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249244658] [2021-11-23 02:33:36,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:36,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 02:33:36,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:33:36,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 02:33:36,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:33:36,429 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:33:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:36,757 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2021-11-23 02:33:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:33:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-11-23 02:33:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:36,759 INFO L225 Difference]: With dead ends: 126 [2021-11-23 02:33:36,759 INFO L226 Difference]: Without dead ends: 126 [2021-11-23 02:33:36,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-23 02:33:36,760 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 197 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:36,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 379 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:33:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-23 02:33:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2021-11-23 02:33:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2021-11-23 02:33:36,767 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 19 [2021-11-23 02:33:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:36,768 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2021-11-23 02:33:36,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:33:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2021-11-23 02:33:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:33:36,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:36,769 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:36,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:33:36,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 02:33:36,970 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash -962684733, now seen corresponding path program 1 times [2021-11-23 02:33:36,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:33:36,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616640911] [2021-11-23 02:33:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:36,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:33:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:37,189 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:33:37,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616640911] [2021-11-23 02:33:37,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616640911] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:33:37,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837206074] [2021-11-23 02:33:37,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:37,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:33:37,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:33:37,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:33:37,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:33:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:37,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 02:33:37,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:33:37,301 INFO L388 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 6 treesize of output 5 [2021-11-23 02:33:37,490 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-23 02:33:37,491 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 9 [2021-11-23 02:33:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:37,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:33:37,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837206074] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:33:37,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2066056651] [2021-11-23 02:33:37,679 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-23 02:33:37,679 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:33:37,684 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:33:37,690 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:33:37,690 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:33:37,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:37,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:37,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 02:33:37,844 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:33:37,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 45 [2021-11-23 02:33:37,867 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 02:33:37,872 INFO L388 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 6 treesize of output 5 [2021-11-23 02:33:37,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 1 [2021-11-23 02:33:37,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-11-23 02:33:37,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-11-23 02:33:37,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-11-23 02:33:37,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:37,916 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-23 02:33:37,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:37,924 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-23 02:33:37,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:37,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:37,963 INFO L388 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-23 02:33:38,029 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:33:38,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 45 [2021-11-23 02:33:38,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:38,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:38,091 INFO L388 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-23 02:33:38,223 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:33:38,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2021-11-23 02:33:38,277 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:38,285 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:38,294 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:38,312 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:38,324 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:38,367 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:33:38,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2021-11-23 02:33:38,419 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:38,434 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:38,450 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:38,464 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:38,474 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:38,578 INFO L388 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 19 treesize of output 11 [2021-11-23 02:33:38,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:38,590 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 02:33:38,606 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:33:38,800 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:33:38,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:33:39,106 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:39,116 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:39,128 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:39,139 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:39,152 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:39,166 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,170 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,172 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,174 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,177 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,308 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:33:39,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:33:39,580 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:39,600 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:39,613 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:39,626 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:39,636 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:39,650 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,653 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,655 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,658 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,664 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:39,739 INFO L388 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 19 treesize of output 11 [2021-11-23 02:33:39,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:33:39,757 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 02:33:39,770 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:33:39,912 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:33:39,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:33:40,123 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:40,133 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:40,144 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:40,156 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:40,166 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:40,180 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,183 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,185 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,191 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,292 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:33:40,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:33:40,512 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,515 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,517 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,519 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,521 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:33:40,537 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:40,547 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 02:33:40,556 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:40,571 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:40,580 INFO L388 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 7 treesize of output 3 [2021-11-23 02:33:40,720 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:33:40,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:33:40,948 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:33:40,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 45 [2021-11-23 02:33:40,962 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 85 for LOIs [2021-11-23 02:33:41,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:33:41,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-23 02:33:41,537 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:33:41,541 INFO L158 Benchmark]: Toolchain (without parser) took 9097.91ms. Allocated memory was 86.0MB in the beginning and 163.6MB in the end (delta: 77.6MB). Free memory was 47.5MB in the beginning and 108.8MB in the end (delta: -61.3MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2021-11-23 02:33:41,541 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 86.0MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:33:41,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.42ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 47.3MB in the beginning and 73.1MB in the end (delta: -25.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 02:33:41,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.78ms. Allocated memory is still 104.9MB. Free memory was 73.1MB in the beginning and 70.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:33:41,542 INFO L158 Benchmark]: Boogie Preprocessor took 34.51ms. Allocated memory is still 104.9MB. Free memory was 70.7MB in the beginning and 68.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:33:41,543 INFO L158 Benchmark]: RCFGBuilder took 887.12ms. Allocated memory is still 104.9MB. Free memory was 68.9MB in the beginning and 44.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-23 02:33:41,543 INFO L158 Benchmark]: TraceAbstraction took 7601.47ms. Allocated memory was 104.9MB in the beginning and 163.6MB in the end (delta: 58.7MB). Free memory was 44.5MB in the beginning and 108.8MB in the end (delta: -64.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:33:41,545 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 86.0MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.42ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 47.3MB in the beginning and 73.1MB in the end (delta: -25.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.78ms. Allocated memory is still 104.9MB. Free memory was 73.1MB in the beginning and 70.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.51ms. Allocated memory is still 104.9MB. Free memory was 70.7MB in the beginning and 68.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 887.12ms. Allocated memory is still 104.9MB. Free memory was 68.9MB in the beginning and 44.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7601.47ms. Allocated memory was 104.9MB in the beginning and 163.6MB in the end (delta: 58.7MB). Free memory was 44.5MB in the beginning and 108.8MB in the end (delta: -64.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-23 02:33:41,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:33:44,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:33:44,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:33:44,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:33:44,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:33:44,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:33:44,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:33:44,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:33:44,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:33:44,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:33:44,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:33:44,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:33:44,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:33:44,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:33:44,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:33:44,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:33:44,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:33:44,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:33:44,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:33:44,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:33:44,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:33:44,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:33:44,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:33:44,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:33:44,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:33:44,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:33:44,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:33:44,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:33:44,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:33:44,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:33:44,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:33:44,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:33:44,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:33:44,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:33:44,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:33:44,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:33:44,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:33:44,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:33:44,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:33:44,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:33:44,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:33:44,202 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-23 02:33:44,245 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:33:44,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:33:44,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:33:44,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:33:44,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:33:44,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:33:44,248 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:33:44,248 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:33:44,248 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:33:44,249 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:33:44,250 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:33:44,250 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:33:44,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:33:44,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:33:44,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:33:44,252 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:33:44,252 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:33:44,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:33:44,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:33:44,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:33:44,253 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:33:44,253 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:33:44,254 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:33:44,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:33:44,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:33:44,254 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 02:33:44,255 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 02:33:44,255 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:33:44,255 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:33:44,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:33:44,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 02:33:44,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:33:44,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:33:44,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:33:44,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:33:44,257 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-23 02:33:44,258 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 02:33:44,258 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:33:44,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:33:44,258 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2021-11-23 02:33:44,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:33:44,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:33:44,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:33:44,675 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:33:44,676 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:33:44,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-11-23 02:33:44,754 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data/a9313a6de/d693f90662a34464b466bd25ee478d82/FLAG00fe79bda [2021-11-23 02:33:45,436 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:33:45,436 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-11-23 02:33:45,450 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data/a9313a6de/d693f90662a34464b466bd25ee478d82/FLAG00fe79bda [2021-11-23 02:33:45,709 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/data/a9313a6de/d693f90662a34464b466bd25ee478d82 [2021-11-23 02:33:45,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:33:45,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:33:45,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:33:45,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:33:45,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:33:45,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:45" (1/1) ... [2021-11-23 02:33:45,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ebea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:45, skipping insertion in model container [2021-11-23 02:33:45,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:45" (1/1) ... [2021-11-23 02:33:45,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:33:45,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:33:46,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2021-11-23 02:33:46,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:33:46,227 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:33:46,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2021-11-23 02:33:46,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:33:46,323 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:33:46,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46 WrapperNode [2021-11-23 02:33:46,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:33:46,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:33:46,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:33:46,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:33:46,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,417 INFO L137 Inliner]: procedures = 130, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 165 [2021-11-23 02:33:46,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:33:46,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:33:46,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:33:46,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:33:46,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:33:46,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:33:46,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:33:46,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:33:46,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (1/1) ... [2021-11-23 02:33:46,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:33:46,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:33:46,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:33:46,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-23 02:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 02:33:46,570 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 02:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 02:33:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:33:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-23 02:33:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:33:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-23 02:33:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:33:46,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:33:46,740 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:33:46,741 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:33:47,361 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:33:47,370 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:33:47,370 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-23 02:33:47,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:47 BoogieIcfgContainer [2021-11-23 02:33:47,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:33:47,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:33:47,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:33:47,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:33:47,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:33:45" (1/3) ... [2021-11-23 02:33:47,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339af22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:47, skipping insertion in model container [2021-11-23 02:33:47,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:46" (2/3) ... [2021-11-23 02:33:47,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339af22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:47, skipping insertion in model container [2021-11-23 02:33:47,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:47" (3/3) ... [2021-11-23 02:33:47,383 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2021-11-23 02:33:47,389 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:33:47,389 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2021-11-23 02:33:47,444 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:33:47,453 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:33:47,453 INFO L340 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2021-11-23 02:33:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 02:33:47,483 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:47,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 02:33:47,484 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash 895983381, now seen corresponding path program 1 times [2021-11-23 02:33:47,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:33:47,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578505432] [2021-11-23 02:33:47,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:47,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:33:47,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:33:47,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:33:47,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 02:33:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:47,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:33:47,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:33:47,725 INFO L388 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 6 treesize of output 5 [2021-11-23 02:33:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:47,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:33:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:47,779 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:33:47,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578505432] [2021-11-23 02:33:47,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578505432] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:47,780 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:47,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 02:33:47,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685112262] [2021-11-23 02:33:47,784 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:47,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:33:47,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:33:47,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:33:47,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:33:47,830 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:33:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:48,152 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-11-23 02:33:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:33:48,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-23 02:33:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:48,175 INFO L225 Difference]: With dead ends: 130 [2021-11-23 02:33:48,176 INFO L226 Difference]: Without dead ends: 127 [2021-11-23 02:33:48,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:33:48,184 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:48,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:33:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-23 02:33:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-11-23 02:33:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 67 states have (on average 1.955223880597015) internal successors, (131), 122 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-11-23 02:33:48,265 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 6 [2021-11-23 02:33:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:48,266 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-11-23 02:33:48,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:33:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-11-23 02:33:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 02:33:48,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:48,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 02:33:48,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:33:48,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:33:48,467 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:48,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash 895983382, now seen corresponding path program 1 times [2021-11-23 02:33:48,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:33:48,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681347149] [2021-11-23 02:33:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:48,470 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:33:48,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:33:48,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:33:48,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 02:33:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:48,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:33:48,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:33:48,588 INFO L388 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 6 treesize of output 5 [2021-11-23 02:33:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:48,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:33:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:48,708 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:33:48,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681347149] [2021-11-23 02:33:48,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681347149] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:48,709 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:48,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-23 02:33:48,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131022433] [2021-11-23 02:33:48,710 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:48,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:33:48,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:33:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:33:48,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:33:48,716 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:33:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:49,273 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2021-11-23 02:33:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:33:49,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-23 02:33:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:49,277 INFO L225 Difference]: With dead ends: 125 [2021-11-23 02:33:49,277 INFO L226 Difference]: Without dead ends: 125 [2021-11-23 02:33:49,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:33:49,279 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:49,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 287 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:33:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-23 02:33:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-11-23 02:33:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2021-11-23 02:33:49,295 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 6 [2021-11-23 02:33:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:49,295 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2021-11-23 02:33:49,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:33:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2021-11-23 02:33:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 02:33:49,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:49,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:49,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-23 02:33:49,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:33:49,508 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash 229520599, now seen corresponding path program 1 times [2021-11-23 02:33:49,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:33:49,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126289295] [2021-11-23 02:33:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:49,511 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:33:49,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:33:49,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:33:49,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 02:33:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:49,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 02:33:49,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:33:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:49,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:33:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:49,674 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:33:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126289295] [2021-11-23 02:33:49,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126289295] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:49,675 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:49,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-23 02:33:49,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77423102] [2021-11-23 02:33:49,675 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:49,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:33:49,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:33:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:33:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:33:49,677 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:33:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:49,694 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2021-11-23 02:33:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:33:49,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2021-11-23 02:33:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:49,697 INFO L225 Difference]: With dead ends: 132 [2021-11-23 02:33:49,697 INFO L226 Difference]: Without dead ends: 132 [2021-11-23 02:33:49,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:33:49,699 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 9 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:49,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 386 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:33:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-23 02:33:49,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2021-11-23 02:33:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 68 states have (on average 1.911764705882353) internal successors, (130), 121 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2021-11-23 02:33:49,712 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 13 [2021-11-23 02:33:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:49,713 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2021-11-23 02:33:49,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:33:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2021-11-23 02:33:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:33:49,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:49,714 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:49,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:33:49,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:33:49,925 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414876, now seen corresponding path program 1 times [2021-11-23 02:33:49,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:33:49,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769565479] [2021-11-23 02:33:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:49,928 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:33:49,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:33:49,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:33:49,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 02:33:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:50,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:33:50,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:33:50,068 INFO L388 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 6 treesize of output 5 [2021-11-23 02:33:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:50,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:33:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:50,248 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:33:50,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769565479] [2021-11-23 02:33:50,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769565479] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:50,255 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:50,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-23 02:33:50,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163438957] [2021-11-23 02:33:50,256 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:50,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:33:50,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:33:50,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:33:50,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:33:50,258 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:33:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:50,766 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2021-11-23 02:33:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:33:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-23 02:33:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:50,771 INFO L225 Difference]: With dead ends: 126 [2021-11-23 02:33:50,771 INFO L226 Difference]: Without dead ends: 126 [2021-11-23 02:33:50,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:33:50,773 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:50,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 400 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:33:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-23 02:33:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2021-11-23 02:33:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2021-11-23 02:33:50,783 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 22 [2021-11-23 02:33:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:50,784 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2021-11-23 02:33:50,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:33:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2021-11-23 02:33:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:33:50,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:50,786 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:50,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:33:50,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:33:50,995 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414877, now seen corresponding path program 1 times [2021-11-23 02:33:50,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:33:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975311607] [2021-11-23 02:33:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:50,996 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:33:50,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:33:50,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:33:50,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-23 02:33:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:51,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:33:51,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:33:51,149 INFO L388 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 6 treesize of output 5 [2021-11-23 02:33:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:51,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:33:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:33:51,677 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:33:51,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975311607] [2021-11-23 02:33:51,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975311607] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:33:51,678 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:33:51,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-23 02:33:51,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009478416] [2021-11-23 02:33:51,678 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:33:51,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:33:51,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:33:51,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:33:51,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:33:51,680 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:33:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:33:53,018 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2021-11-23 02:33:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:33:53,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2021-11-23 02:33:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:33:53,021 INFO L225 Difference]: With dead ends: 125 [2021-11-23 02:33:53,021 INFO L226 Difference]: Without dead ends: 125 [2021-11-23 02:33:53,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:33:53,023 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 11 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:33:53,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 646 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-23 02:33:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-23 02:33:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-11-23 02:33:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:33:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2021-11-23 02:33:53,033 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 22 [2021-11-23 02:33:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:33:53,033 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2021-11-23 02:33:53,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:33:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2021-11-23 02:33:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 02:33:53,035 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:33:53,035 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:33:53,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:33:53,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:33:53,249 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:33:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:33:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash -466517819, now seen corresponding path program 1 times [2021-11-23 02:33:53,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:33:53,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677712667] [2021-11-23 02:33:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:33:53,250 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:33:53,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:33:53,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:33:53,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-23 02:33:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:33:53,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:33:53,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:33:53,389 INFO L388 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 6 treesize of output 5 [2021-11-23 02:33:53,607 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:33:53,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 31 [2021-11-23 02:33:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:33:53,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:34:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:34:15,806 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:34:15,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677712667] [2021-11-23 02:34:15,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677712667] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:34:15,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1489772048] [2021-11-23 02:34:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:34:15,807 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:34:15,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:34:15,818 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:34:15,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-23 02:34:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:34:16,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 02:34:16,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:34:16,037 INFO L388 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 6 treesize of output 5 [2021-11-23 02:34:20,210 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 02:34:20,210 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-11-23 02:34:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:34:20,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:34:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:34:29,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1489772048] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:34:29,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:34:29,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 6] total 18 [2021-11-23 02:34:29,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532365632] [2021-11-23 02:34:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:34:29,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:34:29,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:34:29,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:34:29,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=273, Unknown=10, NotChecked=0, Total=342 [2021-11-23 02:34:29,774 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:34:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:34:32,633 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2021-11-23 02:34:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 02:34:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-11-23 02:34:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:34:32,635 INFO L225 Difference]: With dead ends: 141 [2021-11-23 02:34:32,635 INFO L226 Difference]: Without dead ends: 141 [2021-11-23 02:34:32,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=69, Invalid=300, Unknown=11, NotChecked=0, Total=380 [2021-11-23 02:34:32,637 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 112 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:34:32,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 417 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 323 Invalid, 0 Unknown, 50 Unchecked, 0.8s Time] [2021-11-23 02:34:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-23 02:34:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2021-11-23 02:34:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 118 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:34:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-11-23 02:34:32,647 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 25 [2021-11-23 02:34:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:34:32,648 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-11-23 02:34:32,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:34:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-11-23 02:34:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 02:34:32,650 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:34:32,650 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:34:32,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2021-11-23 02:34:32,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:34:33,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:34:33,053 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:34:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:34:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash -466517818, now seen corresponding path program 1 times [2021-11-23 02:34:33,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:34:33,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613390082] [2021-11-23 02:34:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:34:33,055 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:34:33,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:34:33,056 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:34:33,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-23 02:34:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:34:33,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:34:33,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:34:33,202 INFO L388 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 6 treesize of output 5 [2021-11-23 02:34:33,210 INFO L388 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 6 treesize of output 5 [2021-11-23 02:34:33,598 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:34:33,599 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-23 02:34:33,614 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:34:33,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 27 [2021-11-23 02:34:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:34:33,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:34:36,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (and (bvule |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_48|))))))) is different from false [2021-11-23 02:34:57,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|))) (and (bvule |c_node_create_~temp~0#1.offset| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |c_node_create_~temp~0#1.base|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_48|))))))) is different from false [2021-11-23 02:34:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-23 02:34:57,813 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:34:57,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613390082] [2021-11-23 02:34:57,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613390082] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:34:57,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1743541989] [2021-11-23 02:34:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:34:57,814 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:34:57,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:34:57,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:34:57,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-23 02:34:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:34:58,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:34:58,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:34:58,075 INFO L388 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 6 treesize of output 5 [2021-11-23 02:34:58,084 INFO L388 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 6 treesize of output 5 [2021-11-23 02:34:58,366 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:34:58,366 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2021-11-23 02:34:58,382 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:34:58,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 31 [2021-11-23 02:34:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:34:58,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:35:18,764 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) is different from false [2021-11-23 02:35:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-23 02:35:21,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1743541989] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:35:21,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376888202] [2021-11-23 02:35:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:21,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:35:21,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:35:21,593 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:35:21,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:35:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:21,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:35:21,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:21,674 INFO L388 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 6 treesize of output 5 [2021-11-23 02:35:22,005 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:35:22,006 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-11-23 02:35:22,018 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:35:22,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 30 [2021-11-23 02:35:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:22,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:35:46,120 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_65|)))))) is different from false [2021-11-23 02:35:48,903 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:35:48,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 33 [2021-11-23 02:35:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-23 02:35:49,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376888202] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:35:49,234 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:35:49,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 9, 9] total 22 [2021-11-23 02:35:49,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115958086] [2021-11-23 02:35:49,234 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:35:49,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-23 02:35:49,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:35:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-23 02:35:49,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=279, Unknown=22, NotChecked=148, Total=506 [2021-11-23 02:35:49,237 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:35:51,589 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3)) (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_65|))))))) is different from false [2021-11-23 02:35:53,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3)) (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_65|))))))) is different from false [2021-11-23 02:35:55,670 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse0) (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule .cse2 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse2)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse3) (bvule .cse3 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (forall ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|))) (and (bvule |c_node_create_~temp~0#1.offset| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |c_node_create_~temp~0#1.base|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_48|))))))) (= (_ bv8 32) (select |c_#length| |c_node_create_~temp~0#1.base|))) is different from false [2021-11-23 02:35:57,692 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse0) (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_56| (_ BitVec 32))) (and (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule .cse2 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_56| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse2)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|)))))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse3) (bvule .cse3 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-23 02:35:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:35:58,987 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2021-11-23 02:35:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 02:35:58,989 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2021-11-23 02:35:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:35:58,991 INFO L225 Difference]: With dead ends: 151 [2021-11-23 02:35:58,991 INFO L226 Difference]: Without dead ends: 151 [2021-11-23 02:35:58,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 121 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 72.3s TimeCoverageRelationStatistics Valid=82, Invalid=344, Unknown=26, NotChecked=360, Total=812 [2021-11-23 02:35:58,993 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 7 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 953 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:35:58,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1128 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 953 Unchecked, 1.3s Time] [2021-11-23 02:35:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-23 02:35:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2021-11-23 02:35:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.6853932584269662) internal successors, (150), 139 states have internal predecessors, (150), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:35:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2021-11-23 02:35:59,004 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 25 [2021-11-23 02:35:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:35:59,005 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2021-11-23 02:35:59,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:35:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2021-11-23 02:35:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 02:35:59,007 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:35:59,008 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:35:59,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:35:59,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-11-23 02:35:59,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:35:59,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:35:59,621 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:35:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:35:59,622 INFO L85 PathProgramCache]: Analyzing trace with hash -342690401, now seen corresponding path program 1 times [2021-11-23 02:35:59,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:35:59,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991645232] [2021-11-23 02:35:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:59,623 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:35:59,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:35:59,624 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:35:59,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-23 02:35:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:59,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:35:59,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:59,857 INFO L388 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 6 treesize of output 5 [2021-11-23 02:35:59,886 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-11-23 02:36:00,063 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:36:00,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 31 [2021-11-23 02:36:00,239 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:36:00,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 35 [2021-11-23 02:36:00,423 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:36:00,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 65 [2021-11-23 02:36:01,382 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:36:01,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 65 [2021-11-23 02:36:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:36:01,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:46,267 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:36:46,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991645232] [2021-11-23 02:36:46,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991645232] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:46,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1448475441] [2021-11-23 02:36:46,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:46,268 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:36:46,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:36:46,270 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:36:46,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-23 02:36:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:46,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:36:46,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:46,694 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 02:36:46,694 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2021-11-23 02:36:46,876 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:36:46,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 16 [2021-11-23 02:36:47,124 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:36:47,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 36 [2021-11-23 02:36:47,457 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 02:36:47,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2021-11-23 02:36:51,922 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-23 02:36:51,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 64 [2021-11-23 02:36:52,836 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 02:36:52,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2021-11-23 02:36:53,163 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-23 02:36:53,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 70 [2021-11-23 02:36:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:36:53,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:37:00,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1448475441] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:37:00,440 INFO L186 FreeRefinementEngine]: Found 2 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:37:00,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [10, 10] total 26 [2021-11-23 02:37:00,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447857644] [2021-11-23 02:37:00,441 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:37:00,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 02:37:00,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:00,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 02:37:00,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=568, Unknown=22, NotChecked=0, Total=702 [2021-11-23 02:37:00,443 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-23 02:37:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:00,474 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2021-11-23 02:37:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:37:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2021-11-23 02:37:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:00,477 INFO L225 Difference]: With dead ends: 148 [2021-11-23 02:37:00,478 INFO L226 Difference]: Without dead ends: 148 [2021-11-23 02:37:00,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 102 SyntacticMatches, 17 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 52.1s TimeCoverageRelationStatistics Valid=112, Invalid=568, Unknown=22, NotChecked=0, Total=702 [2021-11-23 02:37:00,479 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 15 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:00,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 526 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 249 Unchecked, 0.0s Time] [2021-11-23 02:37:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-23 02:37:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2021-11-23 02:37:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 89 states have (on average 1.6741573033707866) internal successors, (149), 138 states have internal predecessors, (149), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:37:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2021-11-23 02:37:00,508 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 37 [2021-11-23 02:37:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:00,509 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2021-11-23 02:37:00,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-23 02:37:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2021-11-23 02:37:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 02:37:00,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:00,515 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:00,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:00,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-23 02:37:00,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:37:00,918 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:37:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:00,919 INFO L85 PathProgramCache]: Analyzing trace with hash -342690400, now seen corresponding path program 1 times [2021-11-23 02:37:00,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:00,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848270656] [2021-11-23 02:37:00,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:00,920 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:00,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:00,922 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:00,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-23 02:37:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:01,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:37:01,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:01,122 INFO L388 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 6 treesize of output 5 [2021-11-23 02:37:01,136 INFO L388 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 6 treesize of output 5 [2021-11-23 02:37:01,201 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2021-11-23 02:37:01,210 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-23 02:37:01,499 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:37:01,499 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-23 02:37:01,513 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:37:01,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 21 [2021-11-23 02:37:01,687 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:37:01,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 14 [2021-11-23 02:37:02,023 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:37:02,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 34 [2021-11-23 02:37:03,071 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 02:37:03,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 [2021-11-23 02:37:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:37:03,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:09,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_103| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_2|))) (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_2|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_103| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|)) (not (bvule |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) is different from false [2021-11-23 02:38:54,891 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_111| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_111|)))) (not (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|)) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_110| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_110|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_110| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_111| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) is different from true [2021-11-23 02:38:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 6 refuted. 12 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-23 02:38:54,905 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:38:54,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848270656] [2021-11-23 02:38:54,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848270656] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:38:54,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2105444485] [2021-11-23 02:38:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:38:54,906 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:38:54,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:38:54,909 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:38:54,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-11-23 02:38:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:55,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-23 02:38:55,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:38:55,218 INFO L388 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 6 treesize of output 5 [2021-11-23 02:38:56,425 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-23 02:38:56,639 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:38:56,639 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2021-11-23 02:38:58,222 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:38:58,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 13 [2021-11-23 02:39:00,796 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:39:00,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 [2021-11-23 02:39:02,028 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:39:02,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 13 [2021-11-23 02:39:02,345 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:39:02,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 37 [2021-11-23 02:39:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:39:02,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:41:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 15 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:41:56,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2105444485] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:41:56,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:41:56,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 12, 10] total 35 [2021-11-23 02:41:56,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659026123] [2021-11-23 02:41:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:41:56,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:41:56,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:41:56,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:41:56,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=880, Unknown=85, NotChecked=130, Total=1260 [2021-11-23 02:41:56,139 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:41:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:41:56,712 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2021-11-23 02:41:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:41:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-11-23 02:41:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:41:56,715 INFO L225 Difference]: With dead ends: 147 [2021-11-23 02:41:56,715 INFO L226 Difference]: Without dead ends: 147 [2021-11-23 02:41:56,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 238.8s TimeCoverageRelationStatistics Valid=165, Invalid=880, Unknown=85, NotChecked=130, Total=1260 [2021-11-23 02:41:56,717 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 6 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:41:56,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 385 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 115 Unchecked, 0.6s Time] [2021-11-23 02:41:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-23 02:41:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2021-11-23 02:41:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 89 states have (on average 1.6629213483146068) internal successors, (148), 137 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:41:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2021-11-23 02:41:56,725 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 37 [2021-11-23 02:41:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:41:56,725 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2021-11-23 02:41:56,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:41:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2021-11-23 02:41:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 02:41:56,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:41:56,728 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:41:56,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-23 02:41:56,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2021-11-23 02:41:57,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:41:57,143 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:41:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:41:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006624, now seen corresponding path program 1 times [2021-11-23 02:41:57,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:41:57,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260374047] [2021-11-23 02:41:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:41:57,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:41:57,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:41:57,147 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:41:57,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-23 02:41:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:41:57,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:41:57,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:41:57,306 INFO L388 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 6 treesize of output 5 [2021-11-23 02:41:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:41:57,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:41:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:41:57,662 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:41:57,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260374047] [2021-11-23 02:41:57,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260374047] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:41:57,662 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:41:57,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-23 02:41:57,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539469685] [2021-11-23 02:41:57,663 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:41:57,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:41:57,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:41:57,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:41:57,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:41:57,664 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:41:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:41:58,713 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2021-11-23 02:41:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:41:58,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-11-23 02:41:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:41:58,715 INFO L225 Difference]: With dead ends: 162 [2021-11-23 02:41:58,715 INFO L226 Difference]: Without dead ends: 162 [2021-11-23 02:41:58,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:41:58,716 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 99 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:41:58,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 301 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-23 02:41:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-23 02:41:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2021-11-23 02:41:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 135 states have internal predecessors, (146), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:41:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2021-11-23 02:41:58,724 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 39 [2021-11-23 02:41:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:41:58,724 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2021-11-23 02:41:58,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:41:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2021-11-23 02:41:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 02:41:58,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:41:58,734 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:41:58,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-23 02:41:58,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:41:58,947 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:41:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:41:58,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006625, now seen corresponding path program 1 times [2021-11-23 02:41:58,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:41:58,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231230542] [2021-11-23 02:41:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:41:58,949 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:41:58,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:41:58,950 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:41:58,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-23 02:41:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:41:59,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:41:59,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:41:59,177 INFO L388 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 6 treesize of output 5 [2021-11-23 02:41:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:41:59,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:42:00,132 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:42:00,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231230542] [2021-11-23 02:42:00,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231230542] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:42:00,133 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:42:00,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-23 02:42:00,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012786304] [2021-11-23 02:42:00,133 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:42:00,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:42:00,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:42:00,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:42:00,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:42:00,135 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-23 02:42:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:02,365 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2021-11-23 02:42:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:42:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2021-11-23 02:42:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:02,368 INFO L225 Difference]: With dead ends: 142 [2021-11-23 02:42:02,369 INFO L226 Difference]: Without dead ends: 142 [2021-11-23 02:42:02,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:42:02,370 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 202 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:02,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 452 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-23 02:42:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-23 02:42:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-11-23 02:42:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.6179775280898876) internal successors, (144), 133 states have internal predecessors, (144), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:42:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2021-11-23 02:42:02,377 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 39 [2021-11-23 02:42:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:02,377 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2021-11-23 02:42:02,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-23 02:42:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2021-11-23 02:42:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 02:42:02,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:02,380 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:02,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:02,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:42:02,601 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:42:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006880, now seen corresponding path program 1 times [2021-11-23 02:42:02,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:42:02,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165402923] [2021-11-23 02:42:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:02,603 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:42:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:42:02,604 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:42:02,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-23 02:42:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:02,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:42:02,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:42:02,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:42:02,948 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:42:02,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165402923] [2021-11-23 02:42:02,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165402923] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:42:02,948 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:42:02,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 02:42:02,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295118508] [2021-11-23 02:42:02,949 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:42:02,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:42:02,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:42:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:42:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:42:02,950 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:42:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:03,286 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2021-11-23 02:42:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:42:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-11-23 02:42:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:03,288 INFO L225 Difference]: With dead ends: 156 [2021-11-23 02:42:03,288 INFO L226 Difference]: Without dead ends: 156 [2021-11-23 02:42:03,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:42:03,290 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 91 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:03,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 108 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:42:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-23 02:42:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2021-11-23 02:42:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 89 states have (on average 1.5730337078651686) internal successors, (140), 129 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:42:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2021-11-23 02:42:03,298 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 39 [2021-11-23 02:42:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:03,299 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2021-11-23 02:42:03,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:42:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2021-11-23 02:42:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 02:42:03,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:03,301 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:03,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:03,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:42:03,518 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:42:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:03,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006881, now seen corresponding path program 1 times [2021-11-23 02:42:03,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:42:03,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464178302] [2021-11-23 02:42:03,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:03,519 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:42:03,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:42:03,520 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:42:03,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-23 02:42:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:03,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:42:03,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:42:03,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:03,974 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-23 02:42:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:42:04,215 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:42:04,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464178302] [2021-11-23 02:42:04,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464178302] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:42:04,216 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:42:04,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-23 02:42:04,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850306373] [2021-11-23 02:42:04,219 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:42:04,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:42:04,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:42:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:42:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:42:04,220 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:42:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:04,624 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2021-11-23 02:42:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:42:04,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2021-11-23 02:42:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:04,627 INFO L225 Difference]: With dead ends: 134 [2021-11-23 02:42:04,627 INFO L226 Difference]: Without dead ends: 134 [2021-11-23 02:42:04,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:42:04,628 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 189 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:04,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 142 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:42:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-23 02:42:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-11-23 02:42:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 125 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:42:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-11-23 02:42:04,636 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 39 [2021-11-23 02:42:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:04,637 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-11-23 02:42:04,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:42:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2021-11-23 02:42:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 02:42:04,642 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:04,643 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:04,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-11-23 02:42:04,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:42:04,851 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:42:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750501, now seen corresponding path program 1 times [2021-11-23 02:42:04,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:42:04,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915104276] [2021-11-23 02:42:04,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:04,852 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:42:04,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:42:04,853 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:42:04,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-23 02:42:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:05,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-23 02:42:05,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:05,219 INFO L388 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 6 treesize of output 5 [2021-11-23 02:42:05,763 INFO L388 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 18 treesize of output 14 [2021-11-23 02:42:08,574 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:42:08,574 INFO L388 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 2 case distinctions, treesize of input 61 treesize of output 49 [2021-11-23 02:42:08,647 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-23 02:42:08,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 46 treesize of output 57 [2021-11-23 02:42:09,337 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:42:09,337 INFO L388 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 59 treesize of output 43 [2021-11-23 02:42:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:42:09,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:18,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))))) is different from false [2021-11-23 02:42:21,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-23 02:42:23,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))))) is different from false [2021-11-23 02:42:51,824 INFO L388 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 138 treesize of output 130 [2021-11-23 02:42:58,371 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:42:58,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 103 [2021-11-23 02:43:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:43:03,509 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:43:03,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915104276] [2021-11-23 02:43:03,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915104276] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:43:03,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1261964667] [2021-11-23 02:43:03,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:43:03,510 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:43:03,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:43:03,511 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:43:03,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-11-23 02:43:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:43:03,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-23 02:43:03,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:43:06,086 INFO L388 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 6 treesize of output 5 [2021-11-23 02:43:15,788 INFO L388 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 18 treesize of output 14 [2021-11-23 02:43:16,289 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:43:16,289 INFO L388 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 2 case distinctions, treesize of input 63 treesize of output 51 [2021-11-23 02:43:16,361 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-23 02:43:16,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 48 treesize of output 59 [2021-11-23 02:43:19,237 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:43:19,238 INFO L388 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 54 treesize of output 38 [2021-11-23 02:43:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:43:19,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:43:28,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-23 02:43:30,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))) (_ bv1 1))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-23 02:43:33,110 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))) (_ bv1 1))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-23 02:43:35,656 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_178| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_178| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_178|)))) (not (bvult |v_node_create_~temp~0#1.base_178| |c_#StackHeapBarrier|)) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from true [2021-11-23 02:43:35,679 INFO L388 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 142 treesize of output 134 [2021-11-23 02:43:40,492 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:43:40,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 102 [2021-11-23 02:43:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:43:41,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1261964667] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:43:41,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540209116] [2021-11-23 02:43:41,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:43:41,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:43:41,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:43:41,170 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:43:41,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-23 02:43:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:43:41,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-23 02:43:41,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:43:51,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-11-23 02:43:53,893 INFO L388 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 54 treesize of output 42 [2021-11-23 02:43:58,447 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-23 02:43:58,448 INFO L388 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 1 case distinctions, treesize of input 54 treesize of output 50 [2021-11-23 02:43:58,510 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:43:58,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 50 treesize of output 57 [2021-11-23 02:43:59,621 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:43:59,622 INFO L388 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 57 treesize of output 57 [2021-11-23 02:44:03,118 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:44:03,119 INFO L388 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 51 treesize of output 35 [2021-11-23 02:44:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 02:44:06,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:44:12,212 INFO L388 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 123 treesize of output 119 [2021-11-23 02:44:49,521 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))) (or (and (= .cse0 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (exists ((v_DerPreprocessor_5 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))))))) is different from true [2021-11-23 02:44:55,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))) (or (and (= (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| .cse0))))) (_ bv1 1)) (_ bv0 1))))) is different from false [2021-11-23 02:44:57,356 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))) (or (and (= (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| .cse0))))) (_ bv1 1)) (_ bv0 1))))) is different from true [2021-11-23 02:44:57,549 INFO L388 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 176 treesize of output 172 [2021-11-23 02:45:01,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|) (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))) is different from false [2021-11-23 02:45:03,940 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|) (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))) is different from true [2021-11-23 02:45:12,024 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_node_create_~temp~0#1.base_189| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_189|)))))) is different from false [2021-11-23 02:45:14,034 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_node_create_~temp~0#1.base_189| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_189|)))))) is different from true [2021-11-23 02:45:14,050 INFO L388 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 150 treesize of output 142 [2021-11-23 02:45:41,768 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-11-23 02:45:41,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 74 [2021-11-23 02:46:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2021-11-23 02:46:00,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540209116] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:46:00,285 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:46:00,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 18, 18] total 74 [2021-11-23 02:46:00,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289225902] [2021-11-23 02:46:00,286 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:46:00,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-11-23 02:46:00,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:46:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-11-23 02:46:00,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3691, Unknown=80, NotChecked=1474, Total=5550 [2021-11-23 02:46:00,290 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 75 states, 69 states have (on average 2.0) internal successors, (138), 65 states have internal predecessors, (138), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-23 02:46:08,139 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_node_create_~temp~0#1.base_189| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_189|)))))) (= |c_old(#valid)| |c_#valid|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_178| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_178| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_178|)))) (not (bvult |v_node_create_~temp~0#1.base_178| |c_#StackHeapBarrier|)) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) is different from false [2021-11-23 02:46:10,217 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (and (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg .cse0)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|) (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))) (_ bv1 1))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= (_ bv0 1) .cse0))) is different from false [2021-11-23 02:46:12,289 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (and (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))) (or (and (= (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))))) (_ bv1 1)))))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|) (_ bv0 32)) (= (_ bv0 1) (bvneg .cse1)) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))) (_ bv1 1))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) .cse1))) is different from false [2021-11-23 02:46:14,333 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))) (or (and (= .cse1 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse1)))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (exists ((v_DerPreprocessor_5 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|))))))))))) is different from false [2021-11-23 02:46:16,507 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))) (or (and (= .cse1 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse1)))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (exists ((v_DerPreprocessor_5 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|))))))))))) is different from false [2021-11-23 02:46:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:46:28,599 INFO L93 Difference]: Finished difference Result 205 states and 223 transitions. [2021-11-23 02:46:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 02:46:28,600 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 69 states have (on average 2.0) internal successors, (138), 65 states have internal predecessors, (138), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) Word has length 41 [2021-11-23 02:46:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:46:28,601 INFO L225 Difference]: With dead ends: 205 [2021-11-23 02:46:28,601 INFO L226 Difference]: Without dead ends: 205 [2021-11-23 02:46:28,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 161 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 2174 ImplicationChecksByTransitivity, 229.1s TimeCoverageRelationStatistics Valid=431, Invalid=4513, Unknown=90, NotChecked=2448, Total=7482 [2021-11-23 02:46:28,604 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 126 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2580 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:46:28,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 3368 Invalid, 3507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 911 Invalid, 0 Unknown, 2580 Unchecked, 5.6s Time] [2021-11-23 02:46:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-23 02:46:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 142. [2021-11-23 02:46:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:46:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2021-11-23 02:46:28,610 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 41 [2021-11-23 02:46:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:46:28,610 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2021-11-23 02:46:28,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 69 states have (on average 2.0) internal successors, (138), 65 states have internal predecessors, (138), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-23 02:46:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2021-11-23 02:46:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 02:46:28,612 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:46:28,612 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:46:28,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-23 02:46:28,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2021-11-23 02:46:29,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-11-23 02:46:29,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:46:29,213 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 54 more)] === [2021-11-23 02:46:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:46:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750502, now seen corresponding path program 1 times [2021-11-23 02:46:29,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:46:29,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055177672] [2021-11-23 02:46:29,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:46:29,214 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:46:29,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:46:29,215 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:46:29,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-23 02:46:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:46:29,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-23 02:46:29,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:46:29,616 INFO L388 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 6 treesize of output 5 [2021-11-23 02:46:29,640 INFO L388 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 6 treesize of output 5 [2021-11-23 02:46:31,160 INFO L388 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 [2021-11-23 02:46:31,179 INFO L388 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 11 treesize of output 7 [2021-11-23 02:46:34,947 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:46:34,948 INFO L388 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 2 case distinctions, treesize of input 104 treesize of output 92 [2021-11-23 02:46:35,149 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:46:35,150 INFO L388 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 2 case distinctions, treesize of input 89 treesize of output 73 [2021-11-23 02:46:35,251 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 02:46:35,252 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 76 [2021-11-23 02:46:35,327 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-23 02:46:35,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 73 treesize of output 73 [2021-11-23 02:46:36,787 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:46:36,788 INFO L388 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 64 treesize of output 52 [2021-11-23 02:46:36,810 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:46:36,811 INFO L388 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 46 treesize of output 30 [2021-11-23 02:46:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:46:37,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:46:45,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_198| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_198| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_198|)))) (or (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_188| (_ BitVec 32))) (not (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) |v_node_create_~temp~0#1.offset_188| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_188|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_188| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_188|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) |v_node_create_~temp~0#1.offset_188| (_ bv0 32)) .cse1 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_198| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198|) |v_node_create_~temp~0#1.offset_188| (_ bv0 32)) .cse1 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))))))))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (let ((.cse2 (bvadd .cse3 (_ bv4 32)))) (and (bvule .cse2 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 .cse2)))))) is different from false [2021-11-23 02:46:54,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse1 v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse1 v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_198| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_198| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_2))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) v_prenex_2 (_ bv0 32)) .cse2 v_prenex_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_198| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198|) v_prenex_2 (_ bv0 32)) .cse2 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_188| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) |v_node_create_~temp~0#1.offset_188| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_188|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_198|)))))))) is different from false [2021-11-23 02:46:56,290 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse1 v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse1 v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_198| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_198| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_2))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) v_prenex_2 (_ bv0 32)) .cse2 v_prenex_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_198| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198|) v_prenex_2 (_ bv0 32)) .cse2 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_188| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) |v_node_create_~temp~0#1.offset_188| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_188|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_198|)))))))) is different from true [2021-11-23 02:47:00,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))))) (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) (exists ((|v_node_create_~temp~0#1.base_198| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_198| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_2))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) v_prenex_2 (_ bv0 32)) .cse2 v_prenex_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_198| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198|) v_prenex_2 (_ bv0 32)) .cse2 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_188| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) |v_node_create_~temp~0#1.offset_188| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_188|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_198|)))))))) is different from false [2021-11-23 02:47:10,001 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_199| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_199| |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_199|))))) (and (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_199| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_199|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_199| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_199|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse1 v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_199| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_199| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_199|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse1 v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_198| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_198| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_2))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) v_prenex_2 (_ bv0 32)) .cse2 v_prenex_1)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_198| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_198|) v_prenex_2 (_ bv0 32)) .cse2 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_188| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_198|) |v_node_create_~temp~0#1.offset_188| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_188|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_198|)))))))) is different from true [2021-11-23 02:47:10,028 INFO L388 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 242 treesize of output 234 [2021-11-23 02:47:10,041 INFO L388 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 586 treesize of output 558 [2021-11-23 02:47:14,160 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-11-23 02:47:16,805 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2021-11-23 02:47:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:47:16,925 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:47:16,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055177672] [2021-11-23 02:47:16,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055177672] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:47:16,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [282266537] [2021-11-23 02:47:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:16,926 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:47:16,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:47:16,936 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:47:16,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb236bc-59ba-4de2-bfca-7aafe1ec9f3d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2021-11-23 02:47:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:47:17,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-23 02:47:17,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:47:17,767 INFO L388 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 6 treesize of output 5 [2021-11-23 02:47:17,790 INFO L388 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 6 treesize of output 5 [2021-11-23 02:47:20,610 INFO L388 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 [2021-11-23 02:47:20,628 INFO L388 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 11 treesize of output 7 [2021-11-23 02:47:21,677 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:47:21,677 INFO L388 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 2 case distinctions, treesize of input 102 treesize of output 86 [2021-11-23 02:47:21,889 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:47:21,889 INFO L388 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 2 case distinctions, treesize of input 87 treesize of output 75 [2021-11-23 02:47:21,944 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-23 02:47:21,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 72 treesize of output 72 [2021-11-23 02:47:22,026 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 02:47:22,026 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2021-11-23 02:47:23,640 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:47:23,641 INFO L388 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 64 treesize of output 48 [2021-11-23 02:47:23,656 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:47:23,656 INFO L388 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 42 treesize of output 30 [2021-11-23 02:47:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:47:23,936 INFO L328 TraceCheckSpWp]: Computing backward predicates...