./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:04:42,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:04:42,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:04:42,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:04:42,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:04:42,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:04:42,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:04:42,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:04:42,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:04:42,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:04:42,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:04:42,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:04:42,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:04:42,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:04:42,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:04:42,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:04:42,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:04:43,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:04:43,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:04:43,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:04:43,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:04:43,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:04:43,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:04:43,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:04:43,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:04:43,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:04:43,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:04:43,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:04:43,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:04:43,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:04:43,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:04:43,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:04:43,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:04:43,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:04:43,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:04:43,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:04:43,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:04:43,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:04:43,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:04:43,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:04:43,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:04:43,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:04:43,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:04:43,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:04:43,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:04:43,059 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:04:43,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:04:43,060 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:04:43,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:04:43,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:04:43,061 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:04:43,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:04:43,062 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:04:43,062 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:04:43,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:04:43,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:04:43,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:04:43,063 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:04:43,064 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:04:43,064 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:04:43,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:04:43,064 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:04:43,064 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:04:43,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:04:43,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:04:43,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:04:43,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:04:43,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:04:43,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:04:43,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:04:43,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:04:43,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:04:43,067 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:04:43,067 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:04:43,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:04:43,068 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/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_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-25 18:04:43,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:04:43,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:04:43,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:04:43,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:04:43,359 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:04:43,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-25 18:04:46,524 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:04:46,780 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:04:46,781 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-25 18:04:46,794 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/data/a072203e1/8c51be41269341b282c9e27240b1f7d9/FLAG4a702cd87 [2022-11-25 18:04:46,810 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/data/a072203e1/8c51be41269341b282c9e27240b1f7d9 [2022-11-25 18:04:46,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:04:46,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:04:46,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:04:46,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:04:46,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:04:46,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:04:46" (1/1) ... [2022-11-25 18:04:46,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352b6cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:46, skipping insertion in model container [2022-11-25 18:04:46,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:04:46" (1/1) ... [2022-11-25 18:04:46,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:04:46,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:04:47,284 WARN L237 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_eee6b41f-009d-4189-ad28-f9efae0f2909/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-25 18:04:47,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:04:47,297 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:04:47,336 WARN L237 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_eee6b41f-009d-4189-ad28-f9efae0f2909/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-25 18:04:47,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:04:47,362 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:04:47,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47 WrapperNode [2022-11-25 18:04:47,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:04:47,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:04:47,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:04:47,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:04:47,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,410 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2022-11-25 18:04:47,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:04:47,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:04:47,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:04:47,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:04:47,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,440 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:04:47,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:04:47,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:04:47,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:04:47,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (1/1) ... [2022-11-25 18:04:47,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:04:47,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:04:47,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:04:47,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:04:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:04:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:04:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 18:04:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 18:04:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:04:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:04:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:04:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:04:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:04:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:04:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:04:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:04:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:04:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:04:47,767 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:04:47,780 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:04:48,351 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:04:48,360 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:04:48,361 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 18:04:48,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:04:48 BoogieIcfgContainer [2022-11-25 18:04:48,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:04:48,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:04:48,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:04:48,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:04:48,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:04:46" (1/3) ... [2022-11-25 18:04:48,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a2e9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:04:48, skipping insertion in model container [2022-11-25 18:04:48,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:47" (2/3) ... [2022-11-25 18:04:48,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a2e9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:04:48, skipping insertion in model container [2022-11-25 18:04:48,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:04:48" (3/3) ... [2022-11-25 18:04:48,376 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-25 18:04:48,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:04:48,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-11-25 18:04:48,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:04:48,474 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e972422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:04:48,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-25 18:04:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 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) [2022-11-25 18:04:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 18:04:48,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:48,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:04:48,498 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:48,504 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2022-11-25 18:04:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:48,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390236391] [2022-11-25 18:04:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:04:48,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:48,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390236391] [2022-11-25 18:04:48,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390236391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:04:48,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:04:48,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:04:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466117340] [2022-11-25 18:04:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:04:48,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:04:48,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:48,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:04:48,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:04:48,874 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 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.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) [2022-11-25 18:04:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:49,042 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-25 18:04:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:04:49,045 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 [2022-11-25 18:04:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:49,055 INFO L225 Difference]: With dead ends: 114 [2022-11-25 18:04:49,055 INFO L226 Difference]: Without dead ends: 111 [2022-11-25 18:04:49,057 INFO L412 NwaCegarLoop]: 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 [2022-11-25 18:04:49,061 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:49,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:04:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-25 18:04:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-25 18:04:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 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) [2022-11-25 18:04:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-11-25 18:04:49,112 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2022-11-25 18:04:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:49,112 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-11-25 18:04:49,113 INFO L496 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) [2022-11-25 18:04:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-11-25 18:04:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 18:04:49,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:49,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:04:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:04:49,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2022-11-25 18:04:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:49,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617601043] [2022-11-25 18:04:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:04:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617601043] [2022-11-25 18:04:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617601043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:04:49,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:04:49,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:04:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673941504] [2022-11-25 18:04:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:04:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:04:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:49,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:04:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:04:49,302 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. 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) [2022-11-25 18:04:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:49,427 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-25 18:04:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:04:49,428 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 [2022-11-25 18:04:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:49,429 INFO L225 Difference]: With dead ends: 109 [2022-11-25 18:04:49,430 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 18:04:49,430 INFO L412 NwaCegarLoop]: 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 [2022-11-25 18:04:49,431 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:49,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:04:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 18:04:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-25 18:04:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 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) [2022-11-25 18:04:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-25 18:04:49,443 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2022-11-25 18:04:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:49,443 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-25 18:04:49,443 INFO L496 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) [2022-11-25 18:04:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-25 18:04:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:04:49,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:49,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:04:49,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:04:49,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2022-11-25 18:04:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:49,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190090672] [2022-11-25 18:04:49,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:49,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:04:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:04:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190090672] [2022-11-25 18:04:49,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190090672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:04:49,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:04:49,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:04:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783012585] [2022-11-25 18:04:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:04:49,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:04:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:49,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:04:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:04:49,609 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-11-25 18:04:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:49,831 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-25 18:04:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:04:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-11-25 18:04:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:49,838 INFO L225 Difference]: With dead ends: 116 [2022-11-25 18:04:49,839 INFO L226 Difference]: Without dead ends: 116 [2022-11-25 18:04:49,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:04:49,848 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:49,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:04:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-25 18:04:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-11-25 18:04:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 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) [2022-11-25 18:04:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-11-25 18:04:49,862 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2022-11-25 18:04:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:49,868 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-11-25 18:04:49,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-11-25 18:04:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-11-25 18:04:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:04:49,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:49,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:04:49,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:04:49,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2022-11-25 18:04:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:49,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001657006] [2022-11-25 18:04:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:49,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:50,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:04:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:04:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:04:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:50,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001657006] [2022-11-25 18:04:50,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001657006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:04:50,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:04:50,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:04:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16909103] [2022-11-25 18:04:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:04:50,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:04:50,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:50,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:04:50,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:04:50,311 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-11-25 18:04:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:50,661 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-11-25 18:04:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:04:50,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 [2022-11-25 18:04:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:50,664 INFO L225 Difference]: With dead ends: 110 [2022-11-25 18:04:50,664 INFO L226 Difference]: Without dead ends: 110 [2022-11-25 18:04:50,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:04:50,666 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:50,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:04:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-25 18:04:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-11-25 18:04:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 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) [2022-11-25 18:04:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-25 18:04:50,676 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2022-11-25 18:04:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:50,676 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-25 18:04:50,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-11-25 18:04:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-25 18:04:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:04:50,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:50,678 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:04:50,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:04:50,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2022-11-25 18:04:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:50,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379103175] [2022-11-25 18:04:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:50,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:04:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:50,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:04:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:04:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379103175] [2022-11-25 18:04:51,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379103175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:04:51,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:04:51,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:04:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62193508] [2022-11-25 18:04:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:04:51,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:04:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:04:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:04:51,140 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 7 states, 6 states have (on average 3.0) 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) [2022-11-25 18:04:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:51,490 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-11-25 18:04:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:04:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) 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 [2022-11-25 18:04:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:51,492 INFO L225 Difference]: With dead ends: 109 [2022-11-25 18:04:51,492 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 18:04:51,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:04:51,493 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:51,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:04:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 18:04:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2022-11-25 18:04:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 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) [2022-11-25 18:04:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-25 18:04:51,508 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2022-11-25 18:04:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:51,508 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-25 18:04:51,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) 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) [2022-11-25 18:04:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-25 18:04:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:04:51,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:51,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:04:51,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:04:51,510 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2022-11-25 18:04:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:51,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687597721] [2022-11-25 18:04:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:04:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:04:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:04:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:52,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687597721] [2022-11-25 18:04:52,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687597721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:52,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100512116] [2022-11-25 18:04:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:52,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:52,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:04:52,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:04:52,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:04:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:52,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 18:04:52,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:52,335 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:04:52,409 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2022-11-25 18:04:52,443 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2022-11-25 18:04:52,480 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:04:52,480 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 18 [2022-11-25 18:04:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-25 18:04:52,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:04:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:04:53,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100512116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:04:53,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:04:53,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-25 18:04:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016251214] [2022-11-25 18:04:53,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:04:53,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:04:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:04:53,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-11-25 18:04:53,044 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:04:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:53,499 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-11-25 18:04:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:04:53,501 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-25 18:04:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:53,502 INFO L225 Difference]: With dead ends: 125 [2022-11-25 18:04:53,502 INFO L226 Difference]: Without dead ends: 125 [2022-11-25 18:04:53,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2022-11-25 18:04:53,503 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 94 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:53,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 406 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 260 Unchecked, 0.4s Time] [2022-11-25 18:04:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-25 18:04:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-25 18:04:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 102 states have internal predecessors, (109), 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) [2022-11-25 18:04:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-11-25 18:04:53,510 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 25 [2022-11-25 18:04:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:53,511 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-11-25 18:04:53,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:04:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-11-25 18:04:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:04:53,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:53,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:04:53,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 18:04:53,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:53,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:53,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2022-11-25 18:04:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:53,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405976786] [2022-11-25 18:04:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:53,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:04:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:04:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:04:54,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:54,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405976786] [2022-11-25 18:04:54,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405976786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:54,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794908129] [2022-11-25 18:04:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:54,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:54,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:04:54,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:04:54,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:04:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:54,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 18:04:54,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:54,637 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:04:54,962 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:04:54,963 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-25 18:04:54,971 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 11 [2022-11-25 18:04:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:04:55,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:04:55,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794908129] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:55,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:04:55,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-25 18:04:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465719295] [2022-11-25 18:04:55,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:04:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:04:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:04:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:04:55,258 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:04:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:55,831 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-11-25 18:04:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:04:55,832 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-25 18:04:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:55,833 INFO L225 Difference]: With dead ends: 108 [2022-11-25 18:04:55,833 INFO L226 Difference]: Without dead ends: 108 [2022-11-25 18:04:55,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:04:55,835 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:55,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 453 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:04:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-25 18:04:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-11-25 18:04:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.8) internal successors, (108), 101 states have internal predecessors, (108), 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) [2022-11-25 18:04:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-11-25 18:04:55,841 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 25 [2022-11-25 18:04:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:55,841 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-11-25 18:04:55,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:04:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-11-25 18:04:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:04:55,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:55,842 INFO L195 NwaCegarLoop]: 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] [2022-11-25 18:04:55,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:04:56,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 18:04:56,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:56,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2022-11-25 18:04:56,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:56,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877088960] [2022-11-25 18:04:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:04:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:56,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:04:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:04:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:04:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:56,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877088960] [2022-11-25 18:04:56,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877088960] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:56,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030362090] [2022-11-25 18:04:56,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:56,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:56,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:04:56,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:04:56,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:04:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:56,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 18:04:56,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:56,762 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:04:56,777 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:04:56,808 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-25 18:04:56,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:56,874 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:04:56,891 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2022-11-25 18:04:56,911 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2022-11-25 18:04:56,933 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:04:56,933 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 18 [2022-11-25 18:04:56,999 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-25 18:04:57,034 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:04:57,035 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 14 [2022-11-25 18:04:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-25 18:04:57,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:04:57,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030362090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:57,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:04:57,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2022-11-25 18:04:57,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126793666] [2022-11-25 18:04:57,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:04:57,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 18:04:57,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:57,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 18:04:57,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2022-11-25 18:04:57,559 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 18:04:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:58,108 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-25 18:04:58,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:04:58,108 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-25 18:04:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:58,109 INFO L225 Difference]: With dead ends: 116 [2022-11-25 18:04:58,119 INFO L226 Difference]: Without dead ends: 116 [2022-11-25 18:04:58,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=363, Unknown=4, NotChecked=172, Total=650 [2022-11-25 18:04:58,121 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 324 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:58,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 229 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 402 Unchecked, 0.4s Time] [2022-11-25 18:04:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-25 18:04:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-11-25 18:04:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 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) [2022-11-25 18:04:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-11-25 18:04:58,126 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2022-11-25 18:04:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:58,127 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-11-25 18:04:58,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 18:04:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-11-25 18:04:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:04:58,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:58,128 INFO L195 NwaCegarLoop]: 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] [2022-11-25 18:04:58,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:04:58,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:58,329 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:04:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2022-11-25 18:04:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:58,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353512026] [2022-11-25 18:04:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:58,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:58,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:04:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:04:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:04:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 18:04:59,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:59,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353512026] [2022-11-25 18:04:59,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353512026] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:59,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300297932] [2022-11-25 18:04:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:59,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:59,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:04:59,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:04:59,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:04:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:59,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 18:04:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:59,394 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:04:59,412 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:04:59,439 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2022-11-25 18:04:59,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:59,486 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:04:59,520 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:04:59,531 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-25 18:04:59,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:59,588 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:04:59,661 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:04:59,671 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-25 18:04:59,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:59,742 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:04:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-25 18:04:59,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:01,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300297932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:01,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:05:01,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-25 18:05:01,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053317060] [2022-11-25 18:05:01,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:01,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 18:05:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 18:05:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-25 18:05:01,919 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 18:05:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:02,458 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-11-25 18:05:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:05:02,458 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-25 18:05:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:02,459 INFO L225 Difference]: With dead ends: 108 [2022-11-25 18:05:02,460 INFO L226 Difference]: Without dead ends: 108 [2022-11-25 18:05:02,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-25 18:05:02,461 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 279 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:02,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 203 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 0 Unknown, 273 Unchecked, 0.4s Time] [2022-11-25 18:05:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-25 18:05:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2022-11-25 18:05:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 85 states have internal predecessors, (92), 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) [2022-11-25 18:05:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-11-25 18:05:02,467 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2022-11-25 18:05:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:02,468 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-11-25 18:05:02,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 18:05:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-11-25 18:05:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:05:02,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:02,470 INFO L195 NwaCegarLoop]: 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] [2022-11-25 18:05:02,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:05:02,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:02,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2022-11-25 18:05:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:02,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290955059] [2022-11-25 18:05:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:02,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 18:05:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:02,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290955059] [2022-11-25 18:05:02,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290955059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:05:02,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:05:02,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:05:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143892745] [2022-11-25 18:05:02,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:05:02,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:05:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:05:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:05:02,870 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-11-25 18:05:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:03,136 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-11-25 18:05:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:05:03,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 [2022-11-25 18:05:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:03,138 INFO L225 Difference]: With dead ends: 106 [2022-11-25 18:05:03,138 INFO L226 Difference]: Without dead ends: 106 [2022-11-25 18:05:03,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:05:03,139 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:03,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:05:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-25 18:05:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-25 18:05:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 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) [2022-11-25 18:05:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-11-25 18:05:03,145 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 39 [2022-11-25 18:05:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:03,145 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-11-25 18:05:03,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-11-25 18:05:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-11-25 18:05:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:05:03,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:03,147 INFO L195 NwaCegarLoop]: 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] [2022-11-25 18:05:03,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:05:03,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2022-11-25 18:05:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:03,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417133372] [2022-11-25 18:05:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:03,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 18:05:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:03,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417133372] [2022-11-25 18:05:03,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417133372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:05:03,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:05:03,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:05:03,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499286628] [2022-11-25 18:05:03,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:05:03,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:05:03,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:03,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:05:03,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:05:03,491 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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) [2022-11-25 18:05:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:03,685 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-11-25 18:05:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:05:03,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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 [2022-11-25 18:05:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:03,687 INFO L225 Difference]: With dead ends: 86 [2022-11-25 18:05:03,687 INFO L226 Difference]: Without dead ends: 86 [2022-11-25 18:05:03,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:05:03,688 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:03,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 284 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:05:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-25 18:05:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-25 18:05:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 81 states have internal predecessors, (88), 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) [2022-11-25 18:05:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-11-25 18:05:03,692 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 39 [2022-11-25 18:05:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:03,692 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-11-25 18:05:03,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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) [2022-11-25 18:05:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-11-25 18:05:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:05:03,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:03,693 INFO L195 NwaCegarLoop]: 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] [2022-11-25 18:05:03,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:05:03,694 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2022-11-25 18:05:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:03,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154928983] [2022-11-25 18:05:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:04,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:05:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:04,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154928983] [2022-11-25 18:05:04,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154928983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:04,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426506664] [2022-11-25 18:05:04,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:04,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:04,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:04,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:05:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:04,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 18:05:04,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:04,885 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 5 [2022-11-25 18:05:05,020 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1044 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1044))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-25 18:05:05,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:05,053 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-25 18:05:05,069 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 18:05:05,070 INFO L350 Elim1Store]: Elim1 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 18 [2022-11-25 18:05:05,188 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-25 18:05:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:05:05,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:05:05,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426506664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:05:05,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:05:05,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-25 18:05:05,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740680899] [2022-11-25 18:05:05,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:05:05,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:05:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:05:05,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-25 18:05:05,212 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:05:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:05,974 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-11-25 18:05:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:05:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-25 18:05:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:05,976 INFO L225 Difference]: With dead ends: 128 [2022-11-25 18:05:05,976 INFO L226 Difference]: Without dead ends: 128 [2022-11-25 18:05:05,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2022-11-25 18:05:05,977 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:05,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 665 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 580 Invalid, 3 Unknown, 178 Unchecked, 0.6s Time] [2022-11-25 18:05:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-25 18:05:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2022-11-25 18:05:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 80 states have internal predecessors, (88), 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) [2022-11-25 18:05:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2022-11-25 18:05:05,981 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 41 [2022-11-25 18:05:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:05,982 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2022-11-25 18:05:05,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:05:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-11-25 18:05:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:05:05,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:05,983 INFO L195 NwaCegarLoop]: 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] [2022-11-25 18:05:05,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 18:05:06,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:06,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2022-11-25 18:05:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:06,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974854769] [2022-11-25 18:05:06,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:06,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:06,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:07,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:05:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:07,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974854769] [2022-11-25 18:05:07,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974854769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:07,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834634496] [2022-11-25 18:05:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:07,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:07,579 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:07,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:05:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:07,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 18:05:07,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:08,399 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-25 18:05:08,404 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 18:05:08,633 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1203 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1203))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1199 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1199) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1202 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1202))))) is different from true [2022-11-25 18:05:08,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:08,691 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2022-11-25 18:05:08,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:08,701 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-25 18:05:08,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:08,713 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 18:05:08,726 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:05:08,727 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:05:08,809 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-25 18:05:08,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:05:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-25 18:05:08,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:10,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834634496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:10,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:05:10,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-25 18:05:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289998903] [2022-11-25 18:05:10,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:10,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 18:05:10,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:10,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 18:05:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2022-11-25 18:05:10,277 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:05:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:13,266 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2022-11-25 18:05:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:05:13,267 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-25 18:05:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:13,268 INFO L225 Difference]: With dead ends: 140 [2022-11-25 18:05:13,268 INFO L226 Difference]: Without dead ends: 140 [2022-11-25 18:05:13,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=331, Invalid=2638, Unknown=5, NotChecked=106, Total=3080 [2022-11-25 18:05:13,270 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 436 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:13,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1257 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1304 Invalid, 3 Unknown, 150 Unchecked, 1.4s Time] [2022-11-25 18:05:13,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-25 18:05:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 89. [2022-11-25 18:05:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 84 states have internal predecessors, (92), 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) [2022-11-25 18:05:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-11-25 18:05:13,275 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2022-11-25 18:05:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:13,275 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-11-25 18:05:13,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:05:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-11-25 18:05:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 18:05:13,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:13,277 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-11-25 18:05:13,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:05:13,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 18:05:13,488 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2022-11-25 18:05:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:13,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95823078] [2022-11-25 18:05:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:13,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:13,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 18:05:13,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:13,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95823078] [2022-11-25 18:05:13,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95823078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:05:13,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:05:13,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:05:13,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223178796] [2022-11-25 18:05:13,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:05:13,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:05:13,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:13,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:05:13,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:05:13,860 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:05:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:14,214 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-25 18:05:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:05:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-11-25 18:05:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:14,216 INFO L225 Difference]: With dead ends: 152 [2022-11-25 18:05:14,216 INFO L226 Difference]: Without dead ends: 152 [2022-11-25 18:05:14,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:05:14,217 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 270 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:14,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 398 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:05:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-25 18:05:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2022-11-25 18:05:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.391304347826087) internal successors, (96), 87 states have internal predecessors, (96), 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) [2022-11-25 18:05:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-25 18:05:14,221 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 44 [2022-11-25 18:05:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:14,221 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-25 18:05:14,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:05:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-25 18:05:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 18:05:14,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:14,223 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-11-25 18:05:14,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:05:14,223 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2022-11-25 18:05:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:14,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935595317] [2022-11-25 18:05:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:14,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:14,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 18:05:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:14,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935595317] [2022-11-25 18:05:14,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935595317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:05:14,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:05:14,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:05:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723868930] [2022-11-25 18:05:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:05:14,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:05:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:05:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:05:14,826 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:05:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:15,251 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-11-25 18:05:15,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:05:15,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-11-25 18:05:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:15,253 INFO L225 Difference]: With dead ends: 134 [2022-11-25 18:05:15,253 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 18:05:15,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:05:15,254 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 275 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:15,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 411 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:05:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 18:05:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2022-11-25 18:05:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.380281690140845) internal successors, (98), 89 states have internal predecessors, (98), 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) [2022-11-25 18:05:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-11-25 18:05:15,258 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 44 [2022-11-25 18:05:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:15,258 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-11-25 18:05:15,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:05:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-11-25 18:05:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 18:05:15,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:15,260 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-25 18:05:15,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:05:15,261 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2022-11-25 18:05:15,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:15,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391280901] [2022-11-25 18:05:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:15,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:15,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:15,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:05:15,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391280901] [2022-11-25 18:05:15,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391280901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056479017] [2022-11-25 18:05:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:15,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:15,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:15,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:15,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:05:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:16,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 18:05:16,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:16,669 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-25 18:05:16,770 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1614 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1614)))) is different from true [2022-11-25 18:05:16,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,819 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-25 18:05:16,872 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 13 [2022-11-25 18:05:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-25 18:05:16,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:17,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056479017] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:17,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:05:17,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-25 18:05:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037800005] [2022-11-25 18:05:17,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:17,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:05:17,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:17,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:05:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=613, Unknown=6, NotChecked=50, Total=756 [2022-11-25 18:05:17,113 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:05:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:17,971 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-11-25 18:05:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:05:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-25 18:05:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:17,973 INFO L225 Difference]: With dead ends: 90 [2022-11-25 18:05:17,973 INFO L226 Difference]: Without dead ends: 90 [2022-11-25 18:05:17,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=1012, Unknown=6, NotChecked=66, Total=1260 [2022-11-25 18:05:17,974 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 381 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:17,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 591 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 418 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2022-11-25 18:05:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-25 18:05:17,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-11-25 18:05:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 81 states have internal predecessors, (88), 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) [2022-11-25 18:05:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-11-25 18:05:17,978 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 46 [2022-11-25 18:05:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:17,979 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-11-25 18:05:17,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:05:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-11-25 18:05:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 18:05:17,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:17,981 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-25 18:05:17,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:05:18,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:05:18,187 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:18,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2022-11-25 18:05:18,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:18,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33999589] [2022-11-25 18:05:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:18,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:05:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:20,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33999589] [2022-11-25 18:05:20,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33999589] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:20,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889815569] [2022-11-25 18:05:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:20,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:20,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:20,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:05:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:20,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-25 18:05:20,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:20,507 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:20,877 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:05:20,878 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:05:21,067 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:21,259 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:05:21,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 18:05:21,504 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:05:21,505 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-11-25 18:05:21,512 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:21,724 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1782)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1781)))) is different from true [2022-11-25 18:05:21,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:21,805 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:05:21,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-11-25 18:05:21,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:21,816 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 18:05:21,852 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-25 18:05:21,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-25 18:05:21,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:05:22,173 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:05:22,173 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-25 18:05:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 18:05:22,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:22,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889815569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:22,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:05:22,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-25 18:05:22,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797306785] [2022-11-25 18:05:22,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:22,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-25 18:05:22,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:22,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-25 18:05:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2022-11-25 18:05:22,525 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:05:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:25,501 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-11-25 18:05:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:05:25,502 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-25 18:05:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:25,503 INFO L225 Difference]: With dead ends: 183 [2022-11-25 18:05:25,503 INFO L226 Difference]: Without dead ends: 183 [2022-11-25 18:05:25,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=383, Invalid=3402, Unknown=1, NotChecked=120, Total=3906 [2022-11-25 18:05:25,505 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 559 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:25,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1079 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1613 Invalid, 0 Unknown, 184 Unchecked, 1.6s Time] [2022-11-25 18:05:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-25 18:05:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2022-11-25 18:05:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:05:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-25 18:05:25,510 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 46 [2022-11-25 18:05:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:25,510 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-25 18:05:25,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:05:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-25 18:05:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 18:05:25,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:25,516 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-25 18:05:25,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:05:25,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 18:05:25,727 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:25,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2022-11-25 18:05:25,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:25,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109936497] [2022-11-25 18:05:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:27,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:27,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:05:28,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:28,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109936497] [2022-11-25 18:05:28,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109936497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:28,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354728393] [2022-11-25 18:05:28,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:28,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:28,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:28,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:05:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:28,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-25 18:05:28,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:28,895 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:29,501 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:05:29,501 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:05:29,752 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:29,765 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:30,064 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:05:30,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-25 18:05:30,072 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-25 18:05:30,464 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:05:30,464 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2022-11-25 18:05:30,473 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:30,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:05:30,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:05:30,732 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1959)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1960) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-25 18:05:30,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:30,797 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:05:30,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-11-25 18:05:30,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:30,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:30,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:30,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-25 18:05:30,844 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 18:05:30,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 18:05:30,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-25 18:05:31,293 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-25 18:05:31,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-11-25 18:05:31,304 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:05:31,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-25 18:05:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 18:05:31,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:32,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354728393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:32,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:05:32,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 51 [2022-11-25 18:05:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449171270] [2022-11-25 18:05:32,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:32,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 18:05:32,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:32,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 18:05:32,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3016, Unknown=1, NotChecked=110, Total=3306 [2022-11-25 18:05:32,185 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:05:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:40,149 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2022-11-25 18:05:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:05:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-25 18:05:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:40,151 INFO L225 Difference]: With dead ends: 215 [2022-11-25 18:05:40,151 INFO L226 Difference]: Without dead ends: 215 [2022-11-25 18:05:40,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=534, Invalid=5475, Unknown=1, NotChecked=152, Total=6162 [2022-11-25 18:05:40,154 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 603 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:40,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 2355 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3163 Invalid, 0 Unknown, 150 Unchecked, 3.0s Time] [2022-11-25 18:05:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-25 18:05:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 105. [2022-11-25 18:05:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3375) internal successors, (107), 98 states have internal predecessors, (107), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:05:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-11-25 18:05:40,160 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 46 [2022-11-25 18:05:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:40,160 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-11-25 18:05:40,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:05:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-11-25 18:05:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:05:40,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:40,162 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:05:40,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:05:40,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 18:05:40,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:40,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2022-11-25 18:05:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753739695] [2022-11-25 18:05:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:41,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:41,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:05:41,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:41,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753739695] [2022-11-25 18:05:41,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753739695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:41,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809404706] [2022-11-25 18:05:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:41,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:41,805 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:41,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:05:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:42,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 18:05:42,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:42,117 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:42,169 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:05:42,208 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-25 18:05:42,240 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:05:42,240 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 14 [2022-11-25 18:05:42,316 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:05:42,410 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:05:42,410 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-25 18:05:42,835 INFO L350 Elim1Store]: Elim1 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 10 [2022-11-25 18:05:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:43,279 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-25 18:05:43,306 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:05:43,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 18:05:43,847 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:05:43,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-25 18:05:43,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:43,969 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 30 [2022-11-25 18:05:44,053 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 13 [2022-11-25 18:05:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-25 18:05:44,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:44,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-25 18:05:47,199 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2163 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| Int) (v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2163) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2162))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2155)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| |c_#StackHeapBarrier|)))) is different from false [2022-11-25 18:05:47,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809404706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:47,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:05:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2022-11-25 18:05:47,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345887104] [2022-11-25 18:05:47,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:47,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-25 18:05:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:47,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-25 18:05:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2203, Unknown=102, NotChecked=294, Total=2756 [2022-11-25 18:05:47,209 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:05:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:52,398 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-11-25 18:05:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:05:52,399 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-25 18:05:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:52,401 INFO L225 Difference]: With dead ends: 216 [2022-11-25 18:05:52,401 INFO L226 Difference]: Without dead ends: 216 [2022-11-25 18:05:52,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=618, Invalid=4692, Unknown=104, NotChecked=438, Total=5852 [2022-11-25 18:05:52,404 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1821 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:52,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 854 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1404 Invalid, 2 Unknown, 113 Unchecked, 1.7s Time] [2022-11-25 18:05:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-25 18:05:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 106. [2022-11-25 18:05:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:05:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-25 18:05:52,411 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 51 [2022-11-25 18:05:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:52,412 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-25 18:05:52,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:05:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-25 18:05:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:05:52,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:52,413 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:05:52,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:05:52,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:52,623 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:05:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2022-11-25 18:05:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:52,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066646226] [2022-11-25 18:05:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:05:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:05:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:54,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:05:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:05:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:55,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066646226] [2022-11-25 18:05:55,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066646226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:55,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520419535] [2022-11-25 18:05:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:55,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:55,104 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:55,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:05:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:55,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-25 18:05:55,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:55,419 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:05:55,497 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:05:55,551 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-25 18:05:55,593 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:05:55,593 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 14 [2022-11-25 18:05:55,684 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:05:55,870 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:05:55,870 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-25 18:05:56,528 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 21 [2022-11-25 18:05:56,535 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-25 18:05:57,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:57,055 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 32 [2022-11-25 18:05:57,071 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:05:57,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-25 18:05:57,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-25 18:05:57,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:57,092 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 24 [2022-11-25 18:05:57,823 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:05:57,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2022-11-25 18:05:57,832 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 33 [2022-11-25 18:05:58,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:58,007 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 36 [2022-11-25 18:05:58,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:58,018 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 29 [2022-11-25 18:05:58,163 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 19 [2022-11-25 18:05:58,170 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 14 [2022-11-25 18:05:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-25 18:05:58,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:58,656 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-25 18:06:00,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520419535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:06:00,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:06:00,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2022-11-25 18:06:00,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832588350] [2022-11-25 18:06:00,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:06:00,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-25 18:06:00,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:00,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-25 18:06:00,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2525, Unknown=52, NotChecked=206, Total=2970 [2022-11-25 18:06:00,587 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:06:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:06,233 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2022-11-25 18:06:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 18:06:06,234 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-25 18:06:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:06,235 INFO L225 Difference]: With dead ends: 197 [2022-11-25 18:06:06,235 INFO L226 Difference]: Without dead ends: 197 [2022-11-25 18:06:06,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=487, Invalid=4161, Unknown=52, NotChecked=270, Total=4970 [2022-11-25 18:06:06,237 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1440 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:06,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 844 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1557 Invalid, 0 Unknown, 153 Unchecked, 2.1s Time] [2022-11-25 18:06:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-25 18:06:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2022-11-25 18:06:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 112 states have internal predecessors, (124), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:06:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2022-11-25 18:06:06,246 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 51 [2022-11-25 18:06:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:06,247 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2022-11-25 18:06:06,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:06:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2022-11-25 18:06:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:06:06,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:06,249 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:06,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:06:06,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:06:06,457 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:06:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2022-11-25 18:06:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:06,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958768672] [2022-11-25 18:06:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:06:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:06:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:06:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:09,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958768672] [2022-11-25 18:06:09,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958768672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:06:09,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97484570] [2022-11-25 18:06:09,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:06:09,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:06:09,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:06:09,153 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:06:09,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:06:09,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:06:09,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:06:09,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 145 conjunts are in the unsatisfiable core [2022-11-25 18:06:09,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:09,495 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:06:10,072 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:06:10,072 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-25 18:06:10,285 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:06:10,294 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:06:10,598 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:06:10,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-11-25 18:06:10,608 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 22 [2022-11-25 18:06:11,686 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-11-25 18:06:11,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 77 [2022-11-25 18:06:11,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:11,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:11,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:11,717 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 18:06:11,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2022-11-25 18:06:11,749 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-25 18:06:11,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:06:14,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:14,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:14,065 INFO L321 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2022-11-25 18:06:14,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 42 [2022-11-25 18:06:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:14,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:06:20,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97484570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:06:20,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:06:20,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2022-11-25 18:06:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629548210] [2022-11-25 18:06:20,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:06:20,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-25 18:06:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:20,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-25 18:06:20,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3919, Unknown=3, NotChecked=0, Total=4160 [2022-11-25 18:06:20,551 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:06:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:27,328 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2022-11-25 18:06:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:06:27,329 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-11-25 18:06:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:27,331 INFO L225 Difference]: With dead ends: 121 [2022-11-25 18:06:27,331 INFO L226 Difference]: Without dead ends: 121 [2022-11-25 18:06:27,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=532, Invalid=7121, Unknown=3, NotChecked=0, Total=7656 [2022-11-25 18:06:27,334 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 221 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:27,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1685 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1892 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-11-25 18:06:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-25 18:06:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-11-25 18:06:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 112 states have internal predecessors, (123), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:06:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2022-11-25 18:06:27,340 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 51 [2022-11-25 18:06:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:27,341 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2022-11-25 18:06:27,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:06:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2022-11-25 18:06:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 18:06:27,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:27,343 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:27,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:06:27,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:06:27,551 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:06:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1455991656, now seen corresponding path program 1 times [2022-11-25 18:06:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:27,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929381153] [2022-11-25 18:06:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:27,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:06:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:06:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:06:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929381153] [2022-11-25 18:06:29,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929381153] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:06:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968998942] [2022-11-25 18:06:29,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:29,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:06:29,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:06:29,609 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:06:29,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 18:06:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:29,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-25 18:06:29,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:29,945 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:06:30,339 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:06:30,339 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-25 18:06:30,528 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:06:30,773 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:06:30,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-25 18:06:31,096 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:06:31,096 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2022-11-25 18:06:31,106 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:06:31,112 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 18:06:31,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:31,503 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:06:31,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2022-11-25 18:06:31,523 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:06:31,523 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:06:31,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:31,533 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 11 [2022-11-25 18:06:32,280 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-25 18:06:32,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 29 [2022-11-25 18:06:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:32,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:06:32,784 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2741 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| Int)) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2742))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2741) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| |c_#StackHeapBarrier|)))) is different from false [2022-11-25 18:06:32,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968998942] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:06:32,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:06:32,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2022-11-25 18:06:32,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025353621] [2022-11-25 18:06:32,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:06:32,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-25 18:06:32,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:32,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-25 18:06:32,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2482, Unknown=1, NotChecked=100, Total=2756 [2022-11-25 18:06:32,788 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:06:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:36,627 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-11-25 18:06:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 18:06:36,628 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-11-25 18:06:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:36,629 INFO L225 Difference]: With dead ends: 120 [2022-11-25 18:06:36,629 INFO L226 Difference]: Without dead ends: 120 [2022-11-25 18:06:36,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=336, Invalid=4089, Unknown=1, NotChecked=130, Total=4556 [2022-11-25 18:06:36,631 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 137 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:36,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1593 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 18:06:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-25 18:06:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-11-25 18:06:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.297872340425532) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:06:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-11-25 18:06:36,637 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 53 [2022-11-25 18:06:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:36,637 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-11-25 18:06:36,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:06:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-11-25 18:06:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:06:36,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:36,639 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:36,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:06:36,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:06:36,843 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:06:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2022-11-25 18:06:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:36,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076032644] [2022-11-25 18:06:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:06:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:06:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:06:39,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:39,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076032644] [2022-11-25 18:06:39,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076032644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:06:39,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421554360] [2022-11-25 18:06:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:39,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:06:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:06:39,827 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:06:39,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 18:06:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:40,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-25 18:06:40,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:40,142 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:06:40,218 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:06:40,287 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2922 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2922))))) is different from true [2022-11-25 18:06:40,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:40,344 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:06:40,384 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:06:40,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:40,698 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:06:41,488 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 14 [2022-11-25 18:06:41,498 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:06:41,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:41,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:06:41,517 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 18:06:42,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:42,194 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 18:06:42,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:42,215 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2022-11-25 18:06:42,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:42,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:42,252 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:06:42,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2022-11-25 18:06:42,283 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:06:42,284 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:06:43,807 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-25 18:06:43,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 57 [2022-11-25 18:06:43,850 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 18:06:43,851 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 38 treesize of output 33 [2022-11-25 18:06:44,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:44,606 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 18:06:44,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 101 [2022-11-25 18:06:44,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:06:44,642 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 18:06:44,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 110 [2022-11-25 18:06:44,770 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:06:44,937 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:06:44,980 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:06:45,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:06:45,640 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 18 [2022-11-25 18:06:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-25 18:06:45,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:06:46,288 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-25 18:06:46,320 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-25 18:06:53,674 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (forall ((v_ArrVal_2944 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_subst_2 Int)) (or (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) .cse0 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (<= (+ .cse0 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945) v_subst_2))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))))) (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse2)) (forall ((v_subst_1 Int)) (let ((.cse4 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945))) (or (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store (store .cse3 v_subst_1 (store (select .cse3 v_subst_1) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse4 (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2943))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (<= (+ .cse2 4) (select .cse4 v_subst_1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0))))))) is different from false [2022-11-25 18:06:53,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421554360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:06:53,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:06:53,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 51 [2022-11-25 18:06:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576326773] [2022-11-25 18:06:53,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:06:53,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 18:06:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 18:06:53,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3175, Unknown=7, NotChecked=468, Total=3906 [2022-11-25 18:06:53,684 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:07:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:04,127 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2022-11-25 18:07:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 18:07:04,128 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-11-25 18:07:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:04,129 INFO L225 Difference]: With dead ends: 181 [2022-11-25 18:07:04,129 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 18:07:04,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=701, Invalid=6280, Unknown=7, NotChecked=668, Total=7656 [2022-11-25 18:07:04,131 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 644 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:04,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1841 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2658 Invalid, 0 Unknown, 168 Unchecked, 4.5s Time] [2022-11-25 18:07:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 18:07:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 105. [2022-11-25 18:07:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 98 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:07:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-11-25 18:07:04,137 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 56 [2022-11-25 18:07:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:04,138 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-11-25 18:07:04,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:07:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-11-25 18:07:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 18:07:04,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:04,139 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:04,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:04,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 18:07:04,348 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:07:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2022-11-25 18:07:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:04,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229306272] [2022-11-25 18:07:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:04,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:04,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:07:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:07:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 18:07:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:04,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229306272] [2022-11-25 18:07:04,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229306272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:07:04,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227131580] [2022-11-25 18:07:04,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:07:04,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:07:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:07:04,508 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:07:04,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 18:07:05,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:07:05,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:07:05,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:07:05,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:07:05,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:05,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227131580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:05,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:07:05,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-25 18:07:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250049285] [2022-11-25 18:07:05,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:05,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:07:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:05,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:07:05,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:07:05,099 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:07:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:05,124 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-11-25 18:07:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:07:05,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-11-25 18:07:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:05,126 INFO L225 Difference]: With dead ends: 83 [2022-11-25 18:07:05,126 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 18:07:05,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:07:05,127 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:05,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:07:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 18:07:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-25 18:07:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 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) [2022-11-25 18:07:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-25 18:07:05,130 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2022-11-25 18:07:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:05,139 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-25 18:07:05,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:07:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-25 18:07:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 18:07:05,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:05,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:05,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:05,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 18:07:05,357 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:07:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2022-11-25 18:07:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:05,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080694642] [2022-11-25 18:07:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:08,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:07:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:07:10,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:10,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080694642] [2022-11-25 18:07:10,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080694642] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:07:10,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155145245] [2022-11-25 18:07:10,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:10,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:07:10,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:07:10,233 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:07:10,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 18:07:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:10,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 166 conjunts are in the unsatisfiable core [2022-11-25 18:07:10,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:10,644 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:07:10,773 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:07:11,233 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:07:11,233 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:07:11,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:07:11,691 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 18:07:12,002 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:07:12,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:07:12,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:07:12,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:12,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:07:12,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-25 18:07:13,054 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:07:13,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-25 18:07:13,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:07:13,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 18:07:13,746 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:07:13,747 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2022-11-25 18:07:13,759 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:07:13,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:07:14,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:14,506 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:07:14,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 55 [2022-11-25 18:07:14,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:14,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:14,538 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-25 18:07:14,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-11-25 18:07:14,568 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:07:14,569 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:07:14,595 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 15 [2022-11-25 18:07:17,037 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 18:07:17,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 92 [2022-11-25 18:07:17,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:17,084 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 18:07:17,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 59 [2022-11-25 18:07:17,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:17,103 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 32 [2022-11-25 18:07:17,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:17,413 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:07:17,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 59 [2022-11-25 18:07:17,426 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-25 18:07:17,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:17,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:17,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-25 18:07:17,700 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:07:17,700 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2022-11-25 18:07:17,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 18:07:17,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:07:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:07:18,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:07:18,535 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-25 18:07:18,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3351) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-25 18:07:20,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| Int) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3366 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3367 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3368 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3367)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3368))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3366) .cse0 v_ArrVal_3352) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3354) (select (select (store (store .cse1 .cse0 v_ArrVal_3351) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_3353) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (<= 0 (select (select .cse2 .cse3) .cse4))))))) is different from false [2022-11-25 18:07:20,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155145245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:07:20,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:07:20,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-11-25 18:07:20,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775652568] [2022-11-25 18:07:20,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:07:20,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-25 18:07:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:20,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-25 18:07:20,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5121, Unknown=3, NotChecked=438, Total=5852 [2022-11-25 18:07:20,545 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:07:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:28,278 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-11-25 18:07:28,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:07:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-11-25 18:07:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:28,280 INFO L225 Difference]: With dead ends: 102 [2022-11-25 18:07:28,280 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 18:07:28,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=717, Invalid=8412, Unknown=3, NotChecked=570, Total=9702 [2022-11-25 18:07:28,281 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 785 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:28,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1093 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-25 18:07:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 18:07:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-11-25 18:07:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 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) [2022-11-25 18:07:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-25 18:07:28,284 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 58 [2022-11-25 18:07:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:28,285 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-25 18:07:28,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:07:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-25 18:07:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 18:07:28,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:28,286 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:28,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:28,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 18:07:28,491 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:07:28,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2022-11-25 18:07:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:28,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690055415] [2022-11-25 18:07:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:30,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:07:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:07:31,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:31,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690055415] [2022-11-25 18:07:31,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690055415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:07:31,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853910102] [2022-11-25 18:07:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:31,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:07:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:07:31,193 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:07:31,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 18:07:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:31,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-25 18:07:31,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:31,518 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:07:31,582 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:07:31,786 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:07:31,786 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:07:31,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:07:32,165 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:07:32,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:07:32,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-25 18:07:32,677 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:07:32,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-25 18:07:33,055 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:07:33,055 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2022-11-25 18:07:33,061 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:07:33,066 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 18:07:33,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:33,584 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:07:33,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 37 [2022-11-25 18:07:33,600 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:07:33,600 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:07:33,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:33,627 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 11 [2022-11-25 18:07:34,969 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 18:07:34,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 73 [2022-11-25 18:07:34,994 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:07:34,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-11-25 18:07:35,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:35,189 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:07:35,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2022-11-25 18:07:35,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:35,206 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 31 [2022-11-25 18:07:35,382 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 20 [2022-11-25 18:07:35,744 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:07:35,744 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2022-11-25 18:07:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:07:35,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:07:35,792 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-25 18:07:35,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-25 18:07:35,833 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-11-25 18:07:35,833 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 41 [2022-11-25 18:07:35,840 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) is different from false [2022-11-25 18:07:35,849 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-25 18:07:35,858 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-25 18:07:35,898 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-25 18:07:35,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-25 18:07:35,932 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-25 18:07:36,037 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| Int) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3567 (Array Int Int)) (v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3567)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3566))) (let ((.cse2 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store .cse1 .cse2 v_ArrVal_3557) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse3 .cse2 v_ArrVal_3556) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| |c_#StackHeapBarrier|)))) is different from false [2022-11-25 18:07:36,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853910102] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:07:36,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:07:36,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 63 [2022-11-25 18:07:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359279425] [2022-11-25 18:07:36,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:07:36,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 18:07:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:36,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 18:07:36,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3861, Unknown=9, NotChecked=1188, Total=5256 [2022-11-25 18:07:36,041 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:07:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:42,472 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-11-25 18:07:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 18:07:42,473 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-25 18:07:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:42,474 INFO L225 Difference]: With dead ends: 134 [2022-11-25 18:07:42,474 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 18:07:42,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=598, Invalid=6911, Unknown=9, NotChecked=1602, Total=9120 [2022-11-25 18:07:42,476 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 938 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:42,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1031 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 18:07:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 18:07:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 87. [2022-11-25 18:07:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 82 states have internal predecessors, (88), 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) [2022-11-25 18:07:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-11-25 18:07:42,479 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 62 [2022-11-25 18:07:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:42,480 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-11-25 18:07:42,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:07:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-11-25 18:07:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 18:07:42,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:42,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:42,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:42,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:07:42,688 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:07:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:42,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2022-11-25 18:07:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:42,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517669099] [2022-11-25 18:07:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:47,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:07:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:07:48,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:48,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517669099] [2022-11-25 18:07:48,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517669099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:07:48,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838820192] [2022-11-25 18:07:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:07:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:07:48,730 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:07:48,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 18:07:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:49,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-25 18:07:49,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:49,085 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:07:49,300 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:07:49,620 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:07:49,620 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:07:50,394 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 18:07:50,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-25 18:07:50,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:07:50,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:07:50,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-25 18:07:51,223 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:07:51,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-25 18:07:51,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 18:07:52,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:52,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:07:52,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:52,868 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:07:52,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 65 [2022-11-25 18:07:52,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:52,941 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-25 18:07:52,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 42 [2022-11-25 18:07:52,972 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:07:52,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:53,016 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-25 18:07:53,016 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 37 [2022-11-25 18:07:55,212 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 18:07:55,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2022-11-25 18:07:55,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:55,256 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 18:07:55,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-11-25 18:07:55,513 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:07:55,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 63 [2022-11-25 18:07:55,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:55,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 30 [2022-11-25 18:07:56,273 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-25 18:07:56,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2022-11-25 18:07:56,875 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:07:56,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-25 18:07:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:57,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:07:58,170 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 4))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 8) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2022-11-25 18:08:05,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838820192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:08:05,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:08:05,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35] total 76 [2022-11-25 18:08:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913194990] [2022-11-25 18:08:05,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:08:05,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-25 18:08:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-25 18:08:05,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=7461, Unknown=101, NotChecked=174, Total=8010 [2022-11-25 18:08:05,610 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:08:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:08:20,981 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-11-25 18:08:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:08:20,982 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-25 18:08:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:08:20,983 INFO L225 Difference]: With dead ends: 156 [2022-11-25 18:08:20,983 INFO L226 Difference]: Without dead ends: 156 [2022-11-25 18:08:20,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=924, Invalid=12551, Unknown=101, NotChecked=230, Total=13806 [2022-11-25 18:08:20,985 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2110 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 3119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:08:20,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 1281 Invalid, 3119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3063 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 18:08:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-25 18:08:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2022-11-25 18:08:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 84 states have internal predecessors, (90), 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) [2022-11-25 18:08:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-11-25 18:08:20,989 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 62 [2022-11-25 18:08:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:08:20,989 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-11-25 18:08:20,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:08:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-11-25 18:08:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 18:08:20,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:08:20,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:08:21,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 18:08:21,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 18:08:21,199 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:08:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1350141375, now seen corresponding path program 1 times [2022-11-25 18:08:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:21,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455452732] [2022-11-25 18:08:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:23,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:08:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:08:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:24,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:08:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:08:24,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:24,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455452732] [2022-11-25 18:08:24,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455452732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:08:24,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794447895] [2022-11-25 18:08:24,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:24,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:08:24,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:08:24,952 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:08:24,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 18:08:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:25,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-25 18:08:25,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:08:25,311 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:08:25,403 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:08:25,691 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:08:25,691 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:08:25,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:08:26,201 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:08:26,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:08:26,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-25 18:08:26,885 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:08:26,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-25 18:08:27,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:08:27,399 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:08:27,400 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2022-11-25 18:08:27,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:08:28,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:28,128 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 53 [2022-11-25 18:08:28,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:28,149 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:08:28,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 50 [2022-11-25 18:08:28,169 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:08:28,169 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:08:29,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:08:29,600 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-25 18:08:29,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2022-11-25 18:08:29,622 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:08:29,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 83 [2022-11-25 18:08:29,936 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-25 18:08:29,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 89 [2022-11-25 18:08:29,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:29,945 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 86 [2022-11-25 18:08:29,974 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 29 [2022-11-25 18:08:30,259 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 90 [2022-11-25 18:08:31,459 INFO L321 Elim1Store]: treesize reduction 20, result has 71.0 percent of original size [2022-11-25 18:08:31,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 105 [2022-11-25 18:08:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:08:32,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:08:32,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-25 18:08:32,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-25 18:08:32,216 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-25 18:08:32,228 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-25 18:08:32,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-25 18:08:32,275 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-25 18:08:32,302 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-25 18:08:32,433 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| Int) (v_ArrVal_3975 (Array Int Int)) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3976 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| |c_#StackHeapBarrier|)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3975)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3976))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_3964) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-25 18:08:32,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794447895] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:08:32,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:08:32,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 66 [2022-11-25 18:08:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962638979] [2022-11-25 18:08:32,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:08:32,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-25 18:08:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-25 18:08:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=4095, Unknown=9, NotChecked=1080, Total=5402 [2022-11-25 18:08:32,439 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:08:36,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:08:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:08:43,126 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-11-25 18:08:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:08:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-11-25 18:08:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:08:43,127 INFO L225 Difference]: With dead ends: 110 [2022-11-25 18:08:43,127 INFO L226 Difference]: Without dead ends: 110 [2022-11-25 18:08:43,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=623, Invalid=7410, Unknown=9, NotChecked=1464, Total=9506 [2022-11-25 18:08:43,129 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 750 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:08:43,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1192 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1977 Invalid, 5 Unknown, 0 Unchecked, 4.4s Time] [2022-11-25 18:08:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-25 18:08:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2022-11-25 18:08:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 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) [2022-11-25 18:08:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-25 18:08:43,133 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 63 [2022-11-25 18:08:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:08:43,133 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-25 18:08:43,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:08:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-25 18:08:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 18:08:43,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:08:43,134 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:08:43,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 18:08:43,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 18:08:43,341 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:08:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2022-11-25 18:08:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:43,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737747614] [2022-11-25 18:08:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:08:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:08:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:48,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:08:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:08:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:49,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737747614] [2022-11-25 18:08:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737747614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:08:49,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183190986] [2022-11-25 18:08:49,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:08:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:08:49,200 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:08:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 18:08:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:49,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 203 conjunts are in the unsatisfiable core [2022-11-25 18:08:49,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:08:49,571 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:08:49,582 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:08:49,708 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:08:49,712 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:08:49,999 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 18:08:50,357 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:08:50,358 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:08:50,374 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:08:50,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:08:50,779 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:08:50,784 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:08:51,613 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:08:51,613 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2022-11-25 18:08:51,622 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:08:51,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:51,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:08:51,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:51,703 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:08:51,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 18:08:52,111 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 18:08:52,139 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:08:52,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:08:52,632 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:08:52,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2022-11-25 18:08:52,645 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-25 18:08:52,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-25 18:08:53,360 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:08:53,360 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 39 [2022-11-25 18:08:53,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:53,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:08:53,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:08:53,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:08:53,392 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:08:54,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:54,288 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:08:54,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:54,323 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:08:54,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 74 [2022-11-25 18:08:54,360 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:08:54,360 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-25 18:08:54,374 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:08:54,406 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 18:08:54,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 18:08:54,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:54,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:54,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 30 [2022-11-25 18:08:56,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:56,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:08:57,859 INFO L321 Elim1Store]: treesize reduction 151, result has 10.7 percent of original size [2022-11-25 18:08:57,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 105 [2022-11-25 18:08:57,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:57,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2022-11-25 18:08:57,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:57,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2022-11-25 18:08:58,337 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-25 18:08:58,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 160 [2022-11-25 18:08:58,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:58,376 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 18:08:58,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 144 [2022-11-25 18:08:58,392 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 48 [2022-11-25 18:08:59,462 INFO L321 Elim1Store]: treesize reduction 48, result has 20.0 percent of original size [2022-11-25 18:08:59,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 75 [2022-11-25 18:08:59,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:59,483 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:08:59,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-25 18:08:59,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:09:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:00,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:09:00,867 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-11-25 18:09:00,891 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4182) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_4183)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-11-25 18:09:04,403 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| Int) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4199 (Array Int Int)) (v_ArrVal_4201 (Array Int Int)) (v_ArrVal_4202 (Array Int Int)) (v_ArrVal_4200 Int) (v_ArrVal_4182 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4201)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4202))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse7 .cse11) .cse10))) (let ((.cse8 (select .cse7 .cse1)) (.cse2 (select (select .cse9 .cse11) .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse9 .cse1 v_ArrVal_4182) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4185)) (.cse3 (store (store .cse7 .cse1 (store .cse8 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4187))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4199))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4183))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4186) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (not (<= (+ .cse2 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4200) .cse1))) (not (<= 0 .cse10)) (not (<= 0 .cse2)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select .cse8 .cse2) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|) 0)))))))) is different from false [2022-11-25 18:09:04,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183190986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:09:04,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:09:04,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 79 [2022-11-25 18:09:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970281686] [2022-11-25 18:09:04,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:09:04,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-25 18:09:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:04,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-25 18:09:04,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8209, Unknown=12, NotChecked=552, Total=9120 [2022-11-25 18:09:04,412 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:09:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:20,333 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-11-25 18:09:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:09:20,333 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-11-25 18:09:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:20,334 INFO L225 Difference]: With dead ends: 108 [2022-11-25 18:09:20,334 INFO L226 Difference]: Without dead ends: 108 [2022-11-25 18:09:20,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3037 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=1015, Invalid=13988, Unknown=15, NotChecked=732, Total=15750 [2022-11-25 18:09:20,336 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 716 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 2978 mSolverCounterSat, 32 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2978 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:20,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1053 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2978 Invalid, 4 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 18:09:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-25 18:09:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-11-25 18:09:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 84 states have internal predecessors, (88), 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) [2022-11-25 18:09:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-11-25 18:09:20,339 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 64 [2022-11-25 18:09:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:20,339 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-11-25 18:09:20,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:09:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-11-25 18:09:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:09:20,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:20,340 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:20,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 18:09:20,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 18:09:20,541 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:09:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2022-11-25 18:09:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:20,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771953220] [2022-11-25 18:09:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:09:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:09:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:24,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771953220] [2022-11-25 18:09:24,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771953220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:09:24,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398723836] [2022-11-25 18:09:24,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:09:24,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:09:24,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:09:24,584 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:09:24,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 18:09:24,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:09:24,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:09:24,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 188 conjunts are in the unsatisfiable core [2022-11-25 18:09:24,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:09:25,003 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:09:25,095 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:09:25,170 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:09:25,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:25,482 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:09:25,746 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:09:25,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:25,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:09:26,144 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:09:26,145 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-25 18:09:26,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:26,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:26,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 18:09:26,466 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:09:26,872 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:09:26,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-11-25 18:09:27,424 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:09:27,425 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-25 18:09:27,432 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 18:09:27,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:27,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:09:27,445 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:09:28,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:28,306 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-25 18:09:28,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:28,336 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:09:28,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 57 [2022-11-25 18:09:28,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:28,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:28,391 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:09:28,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 42 [2022-11-25 18:09:28,432 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:09:28,432 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:09:31,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:09:31,856 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2022-11-25 18:09:31,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 209 treesize of output 122 [2022-11-25 18:09:31,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:31,907 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 18:09:31,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 121 [2022-11-25 18:09:32,664 INFO L321 Elim1Store]: treesize reduction 88, result has 27.9 percent of original size [2022-11-25 18:09:32,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 160 [2022-11-25 18:09:32,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:32,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:32,694 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-11-25 18:09:32,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 147 [2022-11-25 18:09:36,327 INFO L321 Elim1Store]: treesize reduction 48, result has 72.9 percent of original size [2022-11-25 18:09:36,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 401 treesize of output 467 [2022-11-25 18:09:42,587 INFO L321 Elim1Store]: treesize reduction 172, result has 62.7 percent of original size [2022-11-25 18:09:42,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 362 treesize of output 482 [2022-11-25 18:09:43,056 INFO L321 Elim1Store]: treesize reduction 72, result has 69.6 percent of original size [2022-11-25 18:09:43,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 318 treesize of output 355 [2022-11-25 18:09:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:56,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:10:01,443 INFO L321 Elim1Store]: treesize reduction 18, result has 98.3 percent of original size [2022-11-25 18:10:01,443 INFO L350 Elim1Store]: Elim1 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 550 treesize of output 1082 [2022-11-25 18:10:06,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398723836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:06,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:10:06,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 42] total 78 [2022-11-25 18:10:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519787199] [2022-11-25 18:10:06,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:10:06,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-25 18:10:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-25 18:10:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=9298, Unknown=3, NotChecked=0, Total=9702 [2022-11-25 18:10:06,553 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:10:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:27,867 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2022-11-25 18:10:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-25 18:10:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2022-11-25 18:10:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:27,872 INFO L225 Difference]: With dead ends: 178 [2022-11-25 18:10:27,872 INFO L226 Difference]: Without dead ends: 178 [2022-11-25 18:10:27,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3797 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=1308, Invalid=16777, Unknown=5, NotChecked=0, Total=18090 [2022-11-25 18:10:27,875 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1723 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 3370 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3370 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:27,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 1238 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3370 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-11-25 18:10:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-25 18:10:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 99. [2022-11-25 18:10:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3) internal successors, (104), 94 states have internal predecessors, (104), 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) [2022-11-25 18:10:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-11-25 18:10:27,879 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 68 [2022-11-25 18:10:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:27,880 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-11-25 18:10:27,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:10:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-11-25 18:10:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:10:27,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:27,883 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:27,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:28,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:28,087 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:10:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2022-11-25 18:10:28,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:28,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427223259] [2022-11-25 18:10:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:31,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:31,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:10:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:10:33,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:33,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427223259] [2022-11-25 18:10:33,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427223259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:33,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195365836] [2022-11-25 18:10:33,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:10:33,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:33,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:33,118 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:33,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 18:10:33,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:10:33,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:10:33,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-25 18:10:33,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:34,478 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 5 [2022-11-25 18:10:34,483 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 18:10:34,587 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:10:35,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:35,132 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 11 [2022-11-25 18:10:35,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:35,151 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 13 [2022-11-25 18:10:35,163 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:10:35,163 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:10:37,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:37,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:37,959 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-25 18:10:37,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 159 treesize of output 106 [2022-11-25 18:10:37,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:38,001 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-25 18:10:38,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 84 [2022-11-25 18:10:38,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:38,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:38,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:38,890 INFO L321 Elim1Store]: treesize reduction 156, result has 29.7 percent of original size [2022-11-25 18:10:38,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 124 treesize of output 143 [2022-11-25 18:10:38,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:38,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:38,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:39,103 INFO L321 Elim1Store]: treesize reduction 116, result has 46.5 percent of original size [2022-11-25 18:10:39,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 136 treesize of output 184 [2022-11-25 18:10:48,437 INFO L321 Elim1Store]: treesize reduction 303, result has 45.2 percent of original size [2022-11-25 18:10:48,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 21 new quantified variables, introduced 45 case distinctions, treesize of input 456 treesize of output 478 [2022-11-25 18:10:49,149 INFO L321 Elim1Store]: treesize reduction 264, result has 48.9 percent of original size [2022-11-25 18:10:49,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 477 treesize of output 544 [2022-11-25 18:11:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:11:33,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:43,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:43,735 INFO L350 Elim1Store]: Elim1 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 14128 treesize of output 14132 [2022-11-25 18:11:54,861 WARN L859 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse0 (select (select .cse14 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse3 (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select .cse12 .cse3) .cse0)) (.cse2 (select (select .cse14 .cse3) .cse0))) (let ((.cse9 (let ((.cse13 (store .cse14 .cse4 (store (select .cse14 .cse4) .cse2 0)))) (store .cse13 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse13 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse13 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse10 (let ((.cse11 (store .cse12 .cse4 (store (select .cse12 .cse4) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse11 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse10 .cse7) .cse1)) (.cse6 (select (select .cse9 .cse7) .cse1))) (let ((.cse8 (select (select .cse10 .cse5) .cse6))) (or (not (<= 0 .cse1)) (not (<= 0 .cse2)) (= .cse3 .cse4) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse5) (not (<= 0 .cse6)) (= .cse7 .cse8) (= .cse8 .cse5) (<= (select (select .cse9 .cse5) .cse6) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse15 (select (select .cse29 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse15)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse18 (select (select .cse27 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse19 (select (select .cse27 .cse18) .cse15)) (.cse17 (select (select .cse29 .cse18) .cse15))) (let ((.cse23 (let ((.cse28 (store .cse29 .cse19 (store (select .cse29 .cse19) .cse17 0)))) (store .cse28 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse28 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse28 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse24 (let ((.cse26 (store .cse27 .cse19 (store (select .cse27 .cse19) .cse17 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse26 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (select (select .cse24 .cse25) .cse16)) (.cse22 (select (select .cse23 .cse25) .cse16))) (let ((.cse20 (select (select .cse24 .cse21) .cse22))) (or (not (<= 0 .cse16)) (not (<= 0 .cse17)) (= .cse18 .cse19) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse20) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse21) (not (<= 0 .cse22)) (= .cse20 .cse21) (= (select (select .cse23 .cse21) .cse22) .cse16)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse30 (select (select .cse42 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse30)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse43 (select (select .cse39 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse40 (select (select .cse39 .cse43) .cse30)) (.cse31 (select (select .cse42 .cse43) .cse30))) (let ((.cse33 (let ((.cse41 (store .cse42 .cse40 (store (select .cse42 .cse40) .cse31 0)))) (store .cse41 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse41 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse41 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse36 (let ((.cse38 (store .cse39 .cse40 (store (select .cse39 .cse40) .cse31 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse38 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse35 (select (select .cse33 .cse37) .cse32)) (.cse34 (select (select .cse36 .cse37) .cse32))) (or (= .cse31 .cse30) (not (<= 0 .cse32)) (not (<= 0 .cse31)) (<= 0 (+ (select (select .cse33 .cse34) .cse35) 4)) (< 0 .cse35) (not (<= 0 .cse35)) (= (select (select .cse36 .cse34) .cse35) .cse34))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse45 (select (select .cse57 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse58 (select (select .cse54 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse55 (select (select .cse54 .cse58) .cse45)) (.cse44 (select (select .cse57 .cse58) .cse45))) (let ((.cse52 (let ((.cse56 (store .cse57 .cse55 (store (select .cse57 .cse55) .cse44 0)))) (store .cse56 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse56 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse56 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse51 (let ((.cse53 (store .cse54 .cse55 (store (select .cse54 .cse55) .cse44 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse53 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (select (select .cse52 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse48 (select (select .cse51 .cse50) .cse46)) (.cse49 (select (select .cse52 .cse50) .cse46))) (let ((.cse47 (select (select .cse51 .cse48) .cse49))) (or (= .cse44 .cse45) (not (<= 0 .cse46)) (not (<= 0 .cse44)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse47) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse48) (not (<= 0 .cse49)) (= .cse50 .cse47) (= .cse47 .cse48)))))))))) (not (<= 0 .cse45)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse60 (select (select .cse72 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse73 (select (select .cse69 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse70 (select (select .cse69 .cse73) .cse60)) (.cse59 (select (select .cse72 .cse73) .cse60))) (let ((.cse66 (let ((.cse71 (store .cse72 .cse70 (store (select .cse72 .cse70) .cse59 0)))) (store .cse71 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse71 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse71 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse67 (let ((.cse68 (store .cse69 .cse70 (store (select .cse69 .cse70) .cse59 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse68 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse64 (select (select .cse67 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (select (select .cse66 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse62 (select (select .cse67 .cse64) .cse61)) (.cse63 (select (select .cse66 .cse64) .cse61))) (let ((.cse65 (select (select .cse67 .cse62) .cse63))) (or (= .cse59 .cse60) (not (<= 0 .cse61)) (not (<= 0 .cse59)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse62) (not (<= 0 .cse63)) (= .cse64 .cse65) (= .cse65 .cse62) (<= (select (select .cse66 .cse62) .cse63) 0)))))))))) (not (<= 0 .cse60)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse74 (select (select .cse87 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse74)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse77 (select (select .cse85 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse78 (select (select .cse85 .cse77) .cse74)) (.cse76 (select (select .cse87 .cse77) .cse74))) (let ((.cse79 (let ((.cse86 (store .cse87 .cse78 (store (select .cse87 .cse78) .cse76 0)))) (store .cse86 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse86 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse86 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse82 (let ((.cse84 (store .cse85 .cse78 (store (select .cse85 .cse78) .cse76 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse84 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse84 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse84 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse83 (select (select .cse82 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse75 (select (select .cse79 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse81 (select (select .cse79 .cse83) .cse75)) (.cse80 (select (select .cse82 .cse83) .cse75))) (or (not (<= 0 .cse75)) (not (<= 0 .cse76)) (= .cse77 .cse78) (<= 0 (+ (select (select .cse79 .cse80) .cse81) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse80) (not (<= 0 .cse81)) (= (select (select .cse82 .cse80) .cse81) .cse80))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse101 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse88 (select (select .cse101 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse88)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse91 (select (select .cse99 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse92 (select (select .cse99 .cse91) .cse88)) (.cse90 (select (select .cse101 .cse91) .cse88))) (let ((.cse97 (let ((.cse100 (store .cse101 .cse92 (store (select .cse101 .cse92) .cse90 0)))) (store .cse100 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse100 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse100 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse95 (let ((.cse98 (store .cse99 .cse92 (store (select .cse99 .cse92) .cse90 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse98 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse98 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse98 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse94 (select (select .cse95 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse89 (select (select .cse97 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse93 (select (select .cse97 .cse94) .cse89)) (.cse96 (select (select .cse95 .cse94) .cse89))) (or (not (<= 0 .cse89)) (not (<= 0 .cse90)) (= .cse91 .cse92) (not (<= 0 .cse93)) (not (<= .cse93 0)) (= .cse94 (select (select .cse95 .cse96) .cse93)) (<= (select (select .cse97 .cse96) .cse93) 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse96)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse102 (select (select .cse115 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse102)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse116 (select (select .cse112 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse113 (select (select .cse112 .cse116) .cse102)) (.cse103 (select (select .cse115 .cse116) .cse102))) (let ((.cse110 (let ((.cse114 (store .cse115 .cse113 (store (select .cse115 .cse113) .cse103 0)))) (store .cse114 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse114 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse114 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse109 (let ((.cse111 (store .cse112 .cse113 (store (select .cse112 .cse113) .cse103 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse111 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse111 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse111 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse107 (select (select .cse109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse104 (select (select .cse110 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse108 (select (select .cse109 .cse107) .cse104)) (.cse105 (select (select .cse110 .cse107) .cse104))) (let ((.cse106 (select (select .cse109 .cse108) .cse105))) (or (= .cse103 .cse102) (not (<= 0 .cse104)) (not (<= 0 .cse103)) (< 0 .cse105) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse106) (not (<= 0 .cse105)) (= .cse107 .cse106) (= .cse106 .cse108)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse130 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse117 (select (select .cse130 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse117)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse127 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse131 (select (select .cse127 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse128 (select (select .cse127 .cse131) .cse117)) (.cse118 (select (select .cse130 .cse131) .cse117))) (let ((.cse124 (let ((.cse129 (store .cse130 .cse128 (store (select .cse130 .cse128) .cse118 0)))) (store .cse129 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse129 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse129 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse121 (let ((.cse126 (store .cse127 .cse128 (store (select .cse127 .cse128) .cse118 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse126 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse126 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse126 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse125 (select (select .cse121 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse119 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse122 (select (select .cse121 .cse125) .cse119)) (.cse120 (select (select .cse124 .cse125) .cse119))) (let ((.cse123 (select (select .cse124 .cse122) .cse120))) (or (= .cse118 .cse117) (not (<= 0 .cse119)) (not (<= 0 .cse118)) (< 0 .cse120) (not (<= 0 .cse120)) (= (select (select .cse121 .cse122) .cse120) .cse122) (<= .cse123 0) (= .cse123 .cse119)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse146 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse132 (select (select .cse146 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse132)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse135 (select (select .cse144 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse136 (select (select .cse144 .cse135) .cse132)) (.cse134 (select (select .cse146 .cse135) .cse132))) (let ((.cse142 (let ((.cse145 (store .cse146 .cse136 (store (select .cse146 .cse136) .cse134 0)))) (store .cse145 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse145 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse145 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse141 (let ((.cse143 (store .cse144 .cse136 (store (select .cse144 .cse136) .cse134 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse143 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse143 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse143 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse140 (select (select .cse141 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse133 (select (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse138 (select (select .cse141 .cse140) .cse133)) (.cse139 (select (select .cse142 .cse140) .cse133))) (let ((.cse137 (select (select .cse141 .cse138) .cse139))) (or (not (<= 0 .cse133)) (not (<= 0 .cse134)) (= .cse135 .cse136) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse137) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse138) (not (<= 0 .cse139)) (= .cse140 .cse137) (= .cse137 .cse138)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse160 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse147 (select (select .cse160 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse147)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse158 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse150 (select (select .cse158 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse151 (select (select .cse158 .cse150) .cse147)) (.cse149 (select (select .cse160 .cse150) .cse147))) (let ((.cse152 (let ((.cse159 (store .cse160 .cse151 (store (select .cse160 .cse151) .cse149 0)))) (store .cse159 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse159 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse159 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse156 (let ((.cse157 (store .cse158 .cse151 (store (select .cse158 .cse151) .cse149 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse157 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse157 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse157 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse155 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse148 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse153 (select (select .cse156 .cse155) .cse148)) (.cse154 (select (select .cse152 .cse155) .cse148))) (or (not (<= 0 .cse148)) (not (<= 0 .cse149)) (= .cse150 .cse151) (<= 0 (+ (select (select .cse152 .cse153) .cse154) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse153) (not (<= 0 .cse154)) (= .cse155 (select (select .cse156 .cse153) .cse154)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse175 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse161 (select (select .cse175 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse161)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse173 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse164 (select (select .cse173 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse165 (select (select .cse173 .cse164) .cse161)) (.cse163 (select (select .cse175 .cse164) .cse161))) (let ((.cse170 (let ((.cse174 (store .cse175 .cse165 (store (select .cse175 .cse165) .cse163 0)))) (store .cse174 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse174 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse174 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse166 (let ((.cse172 (store .cse173 .cse165 (store (select .cse173 .cse165) .cse163 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse172 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse172 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse172 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse171 (select (select .cse166 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse162 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse167 (select (select .cse166 .cse171) .cse162)) (.cse168 (select (select .cse170 .cse171) .cse162))) (let ((.cse169 (select (select .cse170 .cse167) .cse168))) (or (not (<= 0 .cse162)) (not (<= 0 .cse163)) (= .cse164 .cse165) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (select (select .cse166 .cse167) .cse168)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse167) (< .cse169 (+ .cse168 1)) (not (<= 0 .cse168)) (= .cse169 .cse162)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse189 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse176 (select (select .cse189 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse176)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse187 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse179 (select (select .cse187 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse180 (select (select .cse187 .cse179) .cse176)) (.cse178 (select (select .cse189 .cse179) .cse176))) (let ((.cse181 (let ((.cse188 (store .cse189 .cse180 (store (select .cse189 .cse180) .cse178 0)))) (store .cse188 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse188 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse188 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse184 (let ((.cse186 (store .cse187 .cse180 (store (select .cse187 .cse180) .cse178 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse186 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse186 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse186 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse185 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse177 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse183 (select (select .cse181 .cse185) .cse177)) (.cse182 (select (select .cse184 .cse185) .cse177))) (or (not (<= 0 .cse177)) (not (<= 0 .cse178)) (= .cse179 .cse180) (<= 0 (+ (select (select .cse181 .cse182) .cse183) 4)) (< 0 .cse183) (not (<= 0 .cse183)) (= (select (select .cse184 .cse182) .cse183) .cse182))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse204 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse190 (select (select .cse204 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse190)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse202 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse193 (select (select .cse202 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse194 (select (select .cse202 .cse193) .cse190)) (.cse192 (select (select .cse204 .cse193) .cse190))) (let ((.cse199 (let ((.cse203 (store .cse204 .cse194 (store (select .cse204 .cse194) .cse192 0)))) (store .cse203 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse203 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse203 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse200 (let ((.cse201 (store .cse202 .cse194 (store (select .cse202 .cse194) .cse192 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse201 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse201 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse201 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse196 (select (select .cse200 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse191 (select (select .cse199 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse198 (select (select .cse200 .cse196) .cse191)) (.cse195 (select (select .cse199 .cse196) .cse191))) (let ((.cse197 (select (select .cse200 .cse198) .cse195))) (or (not (<= 0 .cse191)) (not (<= 0 .cse192)) (= .cse193 .cse194) (< 0 .cse195) (not (<= 0 .cse195)) (= .cse196 .cse197) (= .cse197 .cse198) (<= (select (select .cse199 .cse198) .cse195) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse217 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse205 (select (select .cse217 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse205)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse214 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse218 (select (select .cse214 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse215 (select (select .cse214 .cse218) .cse205)) (.cse206 (select (select .cse217 .cse218) .cse205))) (let ((.cse208 (let ((.cse216 (store .cse217 .cse215 (store (select .cse217 .cse215) .cse206 0)))) (store .cse216 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse216 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse216 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse211 (let ((.cse213 (store .cse214 .cse215 (store (select .cse214 .cse215) .cse206 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse213 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse213 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse213 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse212 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse207 (select (select .cse208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse210 (select (select .cse208 .cse212) .cse207)) (.cse209 (select (select .cse211 .cse212) .cse207))) (or (= .cse206 .cse205) (not (<= 0 .cse207)) (not (<= 0 .cse206)) (<= 0 (+ (select (select .cse208 .cse209) .cse210) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse209) (not (<= 0 .cse210)) (= (select (select .cse211 .cse209) .cse210) .cse209))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse231 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse219 (select (select .cse231 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse219)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse228 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse232 (select (select .cse228 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse229 (select (select .cse228 .cse232) .cse219)) (.cse220 (select (select .cse231 .cse232) .cse219))) (let ((.cse222 (let ((.cse230 (store .cse231 .cse229 (store (select .cse231 .cse229) .cse220 0)))) (store .cse230 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse230 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse230 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse226 (let ((.cse227 (store .cse228 .cse229 (store (select .cse228 .cse229) .cse220 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse227 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse227 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse227 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse225 (select (select .cse226 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse221 (select (select .cse222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse223 (select (select .cse226 .cse225) .cse221)) (.cse224 (select (select .cse222 .cse225) .cse221))) (or (= .cse220 .cse219) (not (<= 0 .cse221)) (not (<= 0 .cse220)) (<= 0 (+ (select (select .cse222 .cse223) .cse224) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse223) (not (<= 0 .cse224)) (= .cse225 (select (select .cse226 .cse223) .cse224)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse246 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse247 (select (select .cse246 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse244 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse235 (select (select .cse244 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse236 (select (select .cse244 .cse235) .cse247)) (.cse234 (select (select .cse246 .cse235) .cse247))) (let ((.cse240 (let ((.cse245 (store .cse246 .cse236 (store (select .cse246 .cse236) .cse234 0)))) (store .cse245 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse245 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse245 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse242 (let ((.cse243 (store .cse244 .cse236 (store (select .cse244 .cse236) .cse234 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse243 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse243 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse243 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse241 (select (select .cse242 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse233 (select (select .cse240 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse239 (select (select .cse242 .cse241) .cse233)) (.cse237 (select (select .cse240 .cse241) .cse233))) (let ((.cse238 (select (select .cse240 .cse239) .cse237))) (or (not (<= 0 .cse233)) (not (<= 0 .cse234)) (= .cse235 .cse236) (not (<= 0 .cse237)) (not (<= .cse237 0)) (<= .cse238 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse239)) (= .cse238 .cse233)))))))))) (not (<= 0 .cse247)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse261 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse262 (select (select .cse261 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse259 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse250 (select (select .cse259 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse251 (select (select .cse259 .cse250) .cse262)) (.cse249 (select (select .cse261 .cse250) .cse262))) (let ((.cse252 (let ((.cse260 (store .cse261 .cse251 (store (select .cse261 .cse251) .cse249 0)))) (store .cse260 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse260 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse260 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse257 (let ((.cse258 (store .cse259 .cse251 (store (select .cse259 .cse251) .cse249 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse258 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse258 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse258 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse255 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse248 (select (select .cse252 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse253 (select (select .cse257 .cse255) .cse248)) (.cse254 (select (select .cse252 .cse255) .cse248))) (let ((.cse256 (select (select .cse257 .cse253) .cse254))) (or (not (<= 0 .cse248)) (not (<= 0 .cse249)) (= .cse250 .cse251) (<= 0 (+ (select (select .cse252 .cse253) .cse254) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse253) (not (<= 0 .cse254)) (= .cse255 .cse256) (= .cse256 .cse253)))))))))) (not (<= 0 .cse262)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse275 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse263 (select (select .cse275 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse263)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse272 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse276 (select (select .cse272 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse273 (select (select .cse272 .cse276) .cse263)) (.cse264 (select (select .cse275 .cse276) .cse263))) (let ((.cse270 (let ((.cse274 (store .cse275 .cse273 (store (select .cse275 .cse273) .cse264 0)))) (store .cse274 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse274 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse274 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse268 (let ((.cse271 (store .cse272 .cse273 (store (select .cse272 .cse273) .cse264 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse271 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse271 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse271 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse267 (select (select .cse268 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse265 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse266 (select (select .cse270 .cse267) .cse265)) (.cse269 (select (select .cse268 .cse267) .cse265))) (or (= .cse264 .cse263) (not (<= 0 .cse265)) (not (<= 0 .cse264)) (not (<= 0 .cse266)) (not (<= .cse266 0)) (= .cse267 (select (select .cse268 .cse269) .cse266)) (<= (select (select .cse270 .cse269) .cse266) 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse269)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse290 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse277 (select (select .cse290 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse277)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse287 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse291 (select (select .cse287 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse288 (select (select .cse287 .cse291) .cse277)) (.cse278 (select (select .cse290 .cse291) .cse277))) (let ((.cse283 (let ((.cse289 (store .cse290 .cse288 (store (select .cse290 .cse288) .cse278 0)))) (store .cse289 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse289 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse289 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse284 (let ((.cse286 (store .cse287 .cse288 (store (select .cse287 .cse288) .cse278 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse286 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse286 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse286 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse285 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse279 (select (select .cse283 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse281 (select (select .cse284 .cse285) .cse279)) (.cse282 (select (select .cse283 .cse285) .cse279))) (let ((.cse280 (select (select .cse284 .cse281) .cse282))) (or (= .cse278 .cse277) (not (<= 0 .cse279)) (not (<= 0 .cse278)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse280) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse281) (not (<= 0 .cse282)) (= .cse280 .cse281) (= (select (select .cse283 .cse281) .cse282) .cse279)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse305 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse293 (select (select .cse305 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse302 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse306 (select (select .cse302 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse303 (select (select .cse302 .cse306) .cse293)) (.cse292 (select (select .cse305 .cse306) .cse293))) (let ((.cse299 (let ((.cse304 (store .cse305 .cse303 (store (select .cse305 .cse303) .cse292 0)))) (store .cse304 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse304 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse304 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse300 (let ((.cse301 (store .cse302 .cse303 (store (select .cse302 .cse303) .cse292 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse301 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse301 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse301 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse296 (select (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse294 (select (select .cse299 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse298 (select (select .cse300 .cse296) .cse294)) (.cse295 (select (select .cse299 .cse296) .cse294))) (let ((.cse297 (select (select .cse300 .cse298) .cse295))) (or (= .cse292 .cse293) (not (<= 0 .cse294)) (not (<= 0 .cse292)) (< 0 .cse295) (not (<= 0 .cse295)) (= .cse296 .cse297) (= .cse297 .cse298) (<= (select (select .cse299 .cse298) .cse295) 0)))))))))) (not (<= 0 .cse293)))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse320 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse307 (select (select .cse320 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse307)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse317 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse321 (select (select .cse317 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse318 (select (select .cse317 .cse321) .cse307)) (.cse308 (select (select .cse320 .cse321) .cse307))) (let ((.cse314 (let ((.cse319 (store .cse320 .cse318 (store (select .cse320 .cse318) .cse308 0)))) (store .cse319 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse319 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse319 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse310 (let ((.cse316 (store .cse317 .cse318 (store (select .cse317 .cse318) .cse308 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse316 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse316 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse316 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse315 (select (select .cse310 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse309 (select (select .cse314 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse311 (select (select .cse310 .cse315) .cse309)) (.cse312 (select (select .cse314 .cse315) .cse309))) (let ((.cse313 (select (select .cse314 .cse311) .cse312))) (or (= .cse308 .cse307) (not (<= 0 .cse309)) (not (<= 0 .cse308)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (select (select .cse310 .cse311) .cse312)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse311) (< .cse313 (+ .cse312 1)) (not (<= 0 .cse312)) (= .cse313 .cse309)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse334 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse323 (select (select .cse334 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse331 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse335 (select (select .cse331 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse332 (select (select .cse331 .cse335) .cse323)) (.cse322 (select (select .cse334 .cse335) .cse323))) (let ((.cse325 (let ((.cse333 (store .cse334 .cse332 (store (select .cse334 .cse332) .cse322 0)))) (store .cse333 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse333 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse333 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse329 (let ((.cse330 (store .cse331 .cse332 (store (select .cse331 .cse332) .cse322 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse330 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse330 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse330 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse328 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse324 (select (select .cse325 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse326 (select (select .cse329 .cse328) .cse324)) (.cse327 (select (select .cse325 .cse328) .cse324))) (or (= .cse322 .cse323) (not (<= 0 .cse324)) (not (<= 0 .cse322)) (<= 0 (+ (select (select .cse325 .cse326) .cse327) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse326) (not (<= 0 .cse327)))))))))) (not (<= 0 .cse323)))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse350 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse336 (select (select .cse350 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse336)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse348 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse339 (select (select .cse348 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse340 (select (select .cse348 .cse339) .cse336)) (.cse338 (select (select .cse350 .cse339) .cse336))) (let ((.cse344 (let ((.cse349 (store .cse350 .cse340 (store (select .cse350 .cse340) .cse338 0)))) (store .cse349 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse349 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse349 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse345 (let ((.cse347 (store .cse348 .cse340 (store (select .cse348 .cse340) .cse338 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse347 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse347 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse347 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse346 (select (select .cse345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse337 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse343 (select (select .cse345 .cse346) .cse337)) (.cse341 (select (select .cse344 .cse346) .cse337))) (let ((.cse342 (select (select .cse345 .cse343) .cse341))) (or (not (<= 0 .cse337)) (not (<= 0 .cse338)) (= .cse339 .cse340) (< 0 .cse341) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse342) (not (<= 0 .cse341)) (= .cse342 .cse343) (= (select (select .cse344 .cse343) .cse341) .cse337)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse364 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse351 (select (select .cse364 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse351)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse361 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse365 (select (select .cse361 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse362 (select (select .cse361 .cse365) .cse351)) (.cse352 (select (select .cse364 .cse365) .cse351))) (let ((.cse354 (let ((.cse363 (store .cse364 .cse362 (store (select .cse364 .cse362) .cse352 0)))) (store .cse363 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse363 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse363 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse359 (let ((.cse360 (store .cse361 .cse362 (store (select .cse361 .cse362) .cse352 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse360 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse360 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse360 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse357 (select (select .cse359 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse353 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse355 (select (select .cse359 .cse357) .cse353)) (.cse356 (select (select .cse354 .cse357) .cse353))) (let ((.cse358 (select (select .cse359 .cse355) .cse356))) (or (= .cse352 .cse351) (not (<= 0 .cse353)) (not (<= 0 .cse352)) (<= 0 (+ (select (select .cse354 .cse355) .cse356) 4)) (< 0 .cse356) (not (<= 0 .cse356)) (= .cse357 .cse358) (= .cse358 .cse355)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse380 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse366 (select (select .cse380 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse366)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse378 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse369 (select (select .cse378 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse370 (select (select .cse378 .cse369) .cse366)) (.cse368 (select (select .cse380 .cse369) .cse366))) (let ((.cse371 (let ((.cse379 (store .cse380 .cse370 (store (select .cse380 .cse370) .cse368 0)))) (store .cse379 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse379 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse379 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse376 (let ((.cse377 (store .cse378 .cse370 (store (select .cse378 .cse370) .cse368 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse377 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse377 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse377 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse374 (select (select .cse376 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse367 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse372 (select (select .cse376 .cse374) .cse367)) (.cse373 (select (select .cse371 .cse374) .cse367))) (let ((.cse375 (select (select .cse376 .cse372) .cse373))) (or (not (<= 0 .cse367)) (not (<= 0 .cse368)) (= .cse369 .cse370) (<= 0 (+ (select (select .cse371 .cse372) .cse373) 4)) (< 0 .cse373) (not (<= 0 .cse373)) (= .cse374 .cse375) (= .cse375 .cse372)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse394 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse381 (select (select .cse394 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse381)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse391 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse395 (select (select .cse391 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse392 (select (select .cse391 .cse395) .cse381)) (.cse382 (select (select .cse394 .cse395) .cse381))) (let ((.cse387 (let ((.cse393 (store .cse394 .cse392 (store (select .cse394 .cse392) .cse382 0)))) (store .cse393 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse393 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse393 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse388 (let ((.cse390 (store .cse391 .cse392 (store (select .cse391 .cse392) .cse382 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse390 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse390 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse390 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse389 (select (select .cse388 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse383 (select (select .cse387 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse386 (select (select .cse388 .cse389) .cse383)) (.cse384 (select (select .cse387 .cse389) .cse383))) (let ((.cse385 (select (select .cse388 .cse386) .cse384))) (or (= .cse382 .cse381) (not (<= 0 .cse383)) (not (<= 0 .cse382)) (< 0 .cse384) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse385) (not (<= 0 .cse384)) (= .cse385 .cse386) (= (select (select .cse387 .cse386) .cse384) .cse383)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse409 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse396 (select (select .cse409 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse396)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse406 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse410 (select (select .cse406 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse407 (select (select .cse406 .cse410) .cse396)) (.cse397 (select (select .cse409 .cse410) .cse396))) (let ((.cse399 (let ((.cse408 (store .cse409 .cse407 (store (select .cse409 .cse407) .cse397 0)))) (store .cse408 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse408 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse408 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse404 (let ((.cse405 (store .cse406 .cse407 (store (select .cse406 .cse407) .cse397 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse405 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse405 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse405 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse402 (select (select .cse404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse398 (select (select .cse399 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse400 (select (select .cse404 .cse402) .cse398)) (.cse401 (select (select .cse399 .cse402) .cse398))) (let ((.cse403 (select (select .cse404 .cse400) .cse401))) (or (= .cse397 .cse396) (not (<= 0 .cse398)) (not (<= 0 .cse397)) (<= 0 (+ (select (select .cse399 .cse400) .cse401) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse400) (not (<= 0 .cse401)) (= .cse402 .cse403) (= .cse403 .cse400)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse424 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse422 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse413 (select (select .cse422 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse414 (select (select .cse422 .cse413) .cse425)) (.cse412 (select (select .cse424 .cse413) .cse425))) (let ((.cse417 (let ((.cse423 (store .cse424 .cse414 (store (select .cse424 .cse414) .cse412 0)))) (store .cse423 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse423 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse423 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse420 (let ((.cse421 (store .cse422 .cse414 (store (select .cse422 .cse414) .cse412 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse421 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse421 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse421 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse419 (select (select .cse420 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse411 (select (select .cse417 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse416 (select (select .cse420 .cse419) .cse411)) (.cse418 (select (select .cse417 .cse419) .cse411))) (let ((.cse415 (select (select .cse420 .cse416) .cse418))) (or (not (<= 0 .cse411)) (not (<= 0 .cse412)) (= .cse413 .cse414) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse415) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse416) (< (select (select .cse417 .cse416) .cse418) (+ .cse418 1)) (not (<= 0 .cse418)) (= .cse419 .cse415)))))))))) (not (<= 0 .cse425)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse439 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse426 (select (select .cse439 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse426)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse436 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse440 (select (select .cse436 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse437 (select (select .cse436 .cse440) .cse426)) (.cse427 (select (select .cse439 .cse440) .cse426))) (let ((.cse433 (let ((.cse438 (store .cse439 .cse437 (store (select .cse439 .cse437) .cse427 0)))) (store .cse438 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse438 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse438 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse431 (let ((.cse435 (store .cse436 .cse437 (store (select .cse436 .cse437) .cse427 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse435 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse435 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse435 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse434 (select (select .cse431 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse428 (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse429 (select (select .cse431 .cse434) .cse428)) (.cse430 (select (select .cse433 .cse434) .cse428))) (let ((.cse432 (select (select .cse433 .cse429) .cse430))) (or (= .cse427 .cse426) (not (<= 0 .cse428)) (not (<= 0 .cse427)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse429) (not (<= 0 .cse430)) (= (select (select .cse431 .cse429) .cse430) .cse429) (<= .cse432 0) (= .cse432 .cse428)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse455 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse441 (select (select .cse455 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse441)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse453 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse444 (select (select .cse453 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse445 (select (select .cse453 .cse444) .cse441)) (.cse443 (select (select .cse455 .cse444) .cse441))) (let ((.cse450 (let ((.cse454 (store .cse455 .cse445 (store (select .cse455 .cse445) .cse443 0)))) (store .cse454 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse454 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse454 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse447 (let ((.cse452 (store .cse453 .cse445 (store (select .cse453 .cse445) .cse443 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse452 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse452 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse452 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse451 (select (select .cse447 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse442 (select (select .cse450 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse448 (select (select .cse447 .cse451) .cse442)) (.cse446 (select (select .cse450 .cse451) .cse442))) (let ((.cse449 (select (select .cse450 .cse448) .cse446))) (or (not (<= 0 .cse442)) (not (<= 0 .cse443)) (= .cse444 .cse445) (< 0 .cse446) (not (<= 0 .cse446)) (= (select (select .cse447 .cse448) .cse446) .cse448) (<= .cse449 0) (= .cse449 .cse442)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse470 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse456 (select (select .cse470 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse456)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse468 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse459 (select (select .cse468 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse460 (select (select .cse468 .cse459) .cse456)) (.cse458 (select (select .cse470 .cse459) .cse456))) (let ((.cse466 (let ((.cse469 (store .cse470 .cse460 (store (select .cse470 .cse460) .cse458 0)))) (store .cse469 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse469 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse469 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse465 (let ((.cse467 (store .cse468 .cse460 (store (select .cse468 .cse460) .cse458 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse467 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse467 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse467 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse463 (select (select .cse465 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse457 (select (select .cse466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse464 (select (select .cse465 .cse463) .cse457)) (.cse461 (select (select .cse466 .cse463) .cse457))) (let ((.cse462 (select (select .cse465 .cse464) .cse461))) (or (not (<= 0 .cse457)) (not (<= 0 .cse458)) (= .cse459 .cse460) (< 0 .cse461) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse462) (not (<= 0 .cse461)) (= .cse463 .cse462) (= .cse462 .cse464)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse485 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse471 (select (select .cse485 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse471)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse483 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse474 (select (select .cse483 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse475 (select (select .cse483 .cse474) .cse471)) (.cse473 (select (select .cse485 .cse474) .cse471))) (let ((.cse480 (let ((.cse484 (store .cse485 .cse475 (store (select .cse485 .cse475) .cse473 0)))) (store .cse484 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse484 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse484 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse478 (let ((.cse482 (store .cse483 .cse475 (store (select .cse483 .cse475) .cse473 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse482 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse482 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse482 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse481 (select (select .cse478 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse472 (select (select .cse480 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse476 (select (select .cse478 .cse481) .cse472)) (.cse477 (select (select .cse480 .cse481) .cse472))) (let ((.cse479 (select (select .cse480 .cse476) .cse477))) (or (not (<= 0 .cse472)) (not (<= 0 .cse473)) (= .cse474 .cse475) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse476) (not (<= 0 .cse477)) (= (select (select .cse478 .cse476) .cse477) .cse476) (<= .cse479 0) (= .cse479 .cse472)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse499 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse486 (select (select .cse499 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse486)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse496 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse500 (select (select .cse496 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse497 (select (select .cse496 .cse500) .cse486)) (.cse487 (select (select .cse499 .cse500) .cse486))) (let ((.cse492 (let ((.cse498 (store .cse499 .cse497 (store (select .cse499 .cse497) .cse487 0)))) (store .cse498 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse498 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse498 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse494 (let ((.cse495 (store .cse496 .cse497 (store (select .cse496 .cse497) .cse487 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse495 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse495 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse495 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse493 (select (select .cse494 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse488 (select (select .cse492 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse491 (select (select .cse494 .cse493) .cse488)) (.cse489 (select (select .cse492 .cse493) .cse488))) (let ((.cse490 (select (select .cse492 .cse491) .cse489))) (or (= .cse487 .cse486) (not (<= 0 .cse488)) (not (<= 0 .cse487)) (not (<= 0 .cse489)) (not (<= .cse489 0)) (<= .cse490 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse491)) (= .cse490 .cse488)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse514 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse501 (select (select .cse514 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse501)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse511 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse515 (select (select .cse511 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse512 (select (select .cse511 .cse515) .cse501)) (.cse502 (select (select .cse514 .cse515) .cse501))) (let ((.cse506 (let ((.cse513 (store .cse514 .cse512 (store (select .cse514 .cse512) .cse502 0)))) (store .cse513 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse513 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse513 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse509 (let ((.cse510 (store .cse511 .cse512 (store (select .cse511 .cse512) .cse502 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse510 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse510 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse510 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse508 (select (select .cse509 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse503 (select (select .cse506 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse505 (select (select .cse509 .cse508) .cse503)) (.cse507 (select (select .cse506 .cse508) .cse503))) (let ((.cse504 (select (select .cse509 .cse505) .cse507))) (or (= .cse502 .cse501) (not (<= 0 .cse503)) (not (<= 0 .cse502)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse504) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse505) (< (select (select .cse506 .cse505) .cse507) (+ .cse507 1)) (not (<= 0 .cse507)) (= .cse508 .cse504)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse529 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse516 (select (select .cse529 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse516)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse527 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse519 (select (select .cse527 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse520 (select (select .cse527 .cse519) .cse516)) (.cse518 (select (select .cse529 .cse519) .cse516))) (let ((.cse521 (let ((.cse528 (store .cse529 .cse520 (store (select .cse529 .cse520) .cse518 0)))) (store .cse528 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse528 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse528 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse525 (let ((.cse526 (store .cse527 .cse520 (store (select .cse527 .cse520) .cse518 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse526 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse526 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse526 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse524 (select (select .cse525 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse517 (select (select .cse521 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse522 (select (select .cse525 .cse524) .cse517)) (.cse523 (select (select .cse521 .cse524) .cse517))) (or (not (<= 0 .cse517)) (not (<= 0 .cse518)) (= .cse519 .cse520) (<= 0 (+ (select (select .cse521 .cse522) .cse523) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse522) (not (<= 0 .cse523))))))))))))))))) (not (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) is different from true [2022-11-25 18:11:54,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195365836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:54,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:11:54,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39] total 77 [2022-11-25 18:11:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419857675] [2022-11-25 18:11:54,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:11:54,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-25 18:11:54,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:54,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-25 18:11:54,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=10032, Unknown=1, NotChecked=202, Total=10712 [2022-11-25 18:11:54,897 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 18:12:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:24,681 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-11-25 18:12:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-25 18:12:24,682 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-11-25 18:12:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:24,683 INFO L225 Difference]: With dead ends: 165 [2022-11-25 18:12:24,683 INFO L226 Difference]: Without dead ends: 165 [2022-11-25 18:12:24,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=1469, Invalid=18556, Unknown=1, NotChecked=280, Total=20306 [2022-11-25 18:12:24,685 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1782 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 3215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:12:24,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 1355 Invalid, 3215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-11-25 18:12:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-25 18:12:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 99. [2022-11-25 18:12:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.275) internal successors, (102), 94 states have internal predecessors, (102), 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) [2022-11-25 18:12:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-25 18:12:24,690 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 68 [2022-11-25 18:12:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:24,690 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-25 18:12:24,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 18:12:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-25 18:12:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:12:24,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:24,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:12:24,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 18:12:24,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:12:24,899 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:12:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1057077042, now seen corresponding path program 1 times [2022-11-25 18:12:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:24,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620743910] [2022-11-25 18:12:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:28,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:12:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:29,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:12:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:12:29,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:29,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620743910] [2022-11-25 18:12:29,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620743910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:12:29,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037324071] [2022-11-25 18:12:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:29,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:12:29,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:12:29,922 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:12:29,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 18:12:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:30,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-25 18:12:30,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:12:30,328 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:12:30,495 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:12:31,061 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:12:31,062 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:12:31,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:12:31,738 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:12:31,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:12:32,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-25 18:12:32,816 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:12:32,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-25 18:12:33,627 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 18:12:33,628 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2022-11-25 18:12:34,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:34,694 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:12:34,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 62 [2022-11-25 18:12:34,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:34,705 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 53 [2022-11-25 18:12:34,764 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-25 18:12:34,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 18:12:37,124 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-25 18:12:37,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 69 [2022-11-25 18:12:37,183 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 18:12:37,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 100 [2022-11-25 18:12:37,627 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-25 18:12:37,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 153 [2022-11-25 18:12:37,682 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 18:12:37,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 154 [2022-11-25 18:12:38,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 107 [2022-11-25 18:12:40,382 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 18:12:40,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 38 [2022-11-25 18:12:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:12:40,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:12:40,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-11-25 18:12:42,009 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2022-11-25 18:12:42,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2022-11-25 18:12:42,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2022-11-25 18:12:42,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2022-11-25 18:12:42,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| Int) (v_ArrVal_4810 (Array Int Int)) (v_ArrVal_4811 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56|) 0)) (not (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4810)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4811))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse8 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse5 (select (select .cse6 .cse7) .cse8))) (let ((.cse1 (store (store .cse6 .cse5 (store (select .cse6 .cse5) (select (select .cse4 .cse7) .cse8) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store .cse4 .cse5 v_ArrVal_4800) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| |c_#StackHeapBarrier|)))) is different from false [2022-11-25 18:12:42,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037324071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:12:42,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:12:42,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 68 [2022-11-25 18:12:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655146054] [2022-11-25 18:12:42,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:12:42,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-25 18:12:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:42,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-25 18:12:42,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4533, Unknown=112, NotChecked=846, Total=5700 [2022-11-25 18:12:42,359 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:12:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:57,243 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-11-25 18:12:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 18:12:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 69 [2022-11-25 18:12:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:57,249 INFO L225 Difference]: With dead ends: 119 [2022-11-25 18:12:57,249 INFO L226 Difference]: Without dead ends: 119 [2022-11-25 18:12:57,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=644, Invalid=8186, Unknown=124, NotChecked=1146, Total=10100 [2022-11-25 18:12:57,250 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 842 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 29 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:12:57,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1489 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2591 Invalid, 53 Unknown, 0 Unchecked, 6.0s Time] [2022-11-25 18:12:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-25 18:12:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2022-11-25 18:12:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.2625) internal successors, (101), 94 states have internal predecessors, (101), 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) [2022-11-25 18:12:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-11-25 18:12:57,255 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 69 [2022-11-25 18:12:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:57,255 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-11-25 18:12:57,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:12:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-11-25 18:12:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 18:12:57,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:57,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:12:57,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-25 18:12:57,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-25 18:12:57,464 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:12:57,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1590317415, now seen corresponding path program 2 times [2022-11-25 18:12:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:57,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081006593] [2022-11-25 18:12:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:13:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:13:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:13:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:05,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081006593] [2022-11-25 18:13:05,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081006593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:13:05,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765578524] [2022-11-25 18:13:05,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:13:05,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:05,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:13:05,842 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:13:05,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-25 18:13:06,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:13:06,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:13:06,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 213 conjunts are in the unsatisfiable core [2022-11-25 18:13:06,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:06,302 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:13:06,504 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:13:06,697 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:13:07,265 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:13:07,266 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:13:07,939 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:13:07,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:13:08,745 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:13:08,745 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 18:13:08,837 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:13:08,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:13:09,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:13:09,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-25 18:13:10,329 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:13:10,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-25 18:13:10,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 18:13:11,522 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:13:11,522 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 38 [2022-11-25 18:13:11,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:13:11,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:13:12,567 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 18:13:13,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:13,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:13,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:13,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-25 18:13:13,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:13,422 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:13:13,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 65 [2022-11-25 18:13:13,465 INFO L321 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-25 18:13:13,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:13:13,548 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 18:13:13,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 18:13:18,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:18,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:18,565 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2022-11-25 18:13:18,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 185 treesize of output 102 [2022-11-25 18:13:18,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:18,665 INFO L321 Elim1Store]: treesize reduction 132, result has 18.5 percent of original size [2022-11-25 18:13:18,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 142 [2022-11-25 18:13:18,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 18:13:19,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:19,916 INFO L321 Elim1Store]: treesize reduction 120, result has 17.8 percent of original size [2022-11-25 18:13:19,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 564 treesize of output 184 [2022-11-25 18:13:19,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:20,085 INFO L321 Elim1Store]: treesize reduction 275, result has 11.6 percent of original size [2022-11-25 18:13:20,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 539 treesize of output 257 [2022-11-25 18:13:20,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:20,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 100 [2022-11-25 18:13:23,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:23,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:23,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:23,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 12 [2022-11-25 18:13:25,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:25,611 INFO L321 Elim1Store]: treesize reduction 158, result has 12.7 percent of original size [2022-11-25 18:13:25,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 308 treesize of output 154 [2022-11-25 18:13:25,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:25,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:25,671 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-25 18:13:25,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 46 [2022-11-25 18:13:26,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:13:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:26,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:13:40,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:13:40,492 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 3539 treesize of output 3532 [2022-11-25 18:13:40,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:13:40,610 INFO L350 Elim1Store]: Elim1 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 38318 treesize of output 36587 [2022-11-25 18:13:40,660 INFO L350 Elim1Store]: Elim1 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 41788 treesize of output 34856 [2022-11-25 18:13:41,308 INFO L350 Elim1Store]: Elim1 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 1736 treesize of output 3 [2022-11-25 18:13:41,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:13:41,392 INFO L350 Elim1Store]: Elim1 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 8705 treesize of output 8707 [2022-11-25 18:15:39,686 WARN L233 SmtUtils]: Spent 29.95s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:15:39,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765578524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:15:39,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:15:39,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 85 [2022-11-25 18:15:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518575928] [2022-11-25 18:15:39,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:15:39,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-25 18:15:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:39,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-25 18:15:39,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=10672, Unknown=16, NotChecked=0, Total=11130 [2022-11-25 18:15:39,694 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:16:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:22,275 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-11-25 18:16:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:16:22,276 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2022-11-25 18:16:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:22,277 INFO L225 Difference]: With dead ends: 117 [2022-11-25 18:16:22,277 INFO L226 Difference]: Without dead ends: 117 [2022-11-25 18:16:22,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4567 ImplicationChecksByTransitivity, 182.8s TimeCoverageRelationStatistics Valid=1229, Invalid=17656, Unknown=21, NotChecked=0, Total=18906 [2022-11-25 18:16:22,279 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 661 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:22,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 970 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2761 Invalid, 3 Unknown, 0 Unchecked, 7.6s Time] [2022-11-25 18:16:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-25 18:16:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-11-25 18:16:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.25) internal successors, (100), 94 states have internal predecessors, (100), 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) [2022-11-25 18:16:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-11-25 18:16:22,284 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 70 [2022-11-25 18:16:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:22,284 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-11-25 18:16:22,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:16:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-11-25 18:16:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:16:22,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:22,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:22,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:22,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-25 18:16:22,494 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:16:22,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1692406426, now seen corresponding path program 3 times [2022-11-25 18:16:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:22,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167532459] [2022-11-25 18:16:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:16:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:28,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:16:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:16:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167532459] [2022-11-25 18:16:29,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167532459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565251831] [2022-11-25 18:16:29,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:16:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:29,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:29,088 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:29,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-25 18:16:30,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 18:16:30,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:16:30,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 178 conjunts are in the unsatisfiable core [2022-11-25 18:16:30,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:30,467 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:16:31,469 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:16:32,417 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:16:32,418 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-25 18:16:33,019 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:16:33,050 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:16:33,843 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:16:33,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2022-11-25 18:16:33,868 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-25 18:16:34,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:16:34,971 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:16:34,972 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 36 [2022-11-25 18:16:34,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2022-11-25 18:16:34,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:16:35,262 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:16:36,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:36,635 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:16:36,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 75 [2022-11-25 18:16:36,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:36,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:36,658 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:16:36,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 85 [2022-11-25 18:16:36,739 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-25 18:16:36,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 18:16:40,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:16:40,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:16:41,026 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-25 18:16:41,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 171 treesize of output 96 [2022-11-25 18:16:41,132 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-11-25 18:16:41,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 161 treesize of output 114 [2022-11-25 18:16:42,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:16:42,220 INFO L321 Elim1Store]: treesize reduction 108, result has 19.4 percent of original size [2022-11-25 18:16:42,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 109 [2022-11-25 18:16:42,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:42,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:42,264 INFO L321 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2022-11-25 18:16:42,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 108 [2022-11-25 18:16:46,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:16:46,624 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 18:16:48,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:48,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:16:48,653 INFO L321 Elim1Store]: treesize reduction 235, result has 8.6 percent of original size [2022-11-25 18:16:48,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 237 treesize of output 139 [2022-11-25 18:16:48,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:48,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:48,691 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:16:48,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 31 [2022-11-25 18:16:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:49,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:01,243 INFO L350 Elim1Store]: Elim1 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 14885 treesize of output 11423 [2022-11-25 18:17:17,311 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:17:17,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565251831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:17,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:17,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 79 [2022-11-25 18:17:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715340467] [2022-11-25 18:17:17,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:17,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-25 18:17:17,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:17,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-25 18:17:17,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=8995, Unknown=1, NotChecked=0, Total=9312 [2022-11-25 18:17:17,318 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 79 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 70 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:17:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:42,305 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-11-25 18:17:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-25 18:17:42,305 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 70 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2022-11-25 18:17:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:42,307 INFO L225 Difference]: With dead ends: 107 [2022-11-25 18:17:42,307 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 18:17:42,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3656 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=894, Invalid=15615, Unknown=3, NotChecked=0, Total=16512 [2022-11-25 18:17:42,308 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 442 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3461 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 3477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3461 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:42,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1441 Invalid, 3477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3461 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2022-11-25 18:17:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 18:17:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-11-25 18:17:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.178082191780822) internal successors, (86), 84 states have internal predecessors, (86), 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) [2022-11-25 18:17:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-11-25 18:17:42,311 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 74 [2022-11-25 18:17:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:42,311 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-11-25 18:17:42,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 70 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:17:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-11-25 18:17:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 18:17:42,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:42,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:42,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:42,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:42,513 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:17:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash -924992669, now seen corresponding path program 2 times [2022-11-25 18:17:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:42,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147379352] [2022-11-25 18:17:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:42,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:17:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:17:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 18:17:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147379352] [2022-11-25 18:17:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147379352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954693955] [2022-11-25 18:17:42,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:17:42,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:42,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:42,930 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:42,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-25 18:17:43,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:17:43,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:17:43,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 18:17:43,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:17:44,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:17:44,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954693955] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:17:44,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:17:44,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-25 18:17:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189846825] [2022-11-25 18:17:44,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:44,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:17:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:17:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:17:44,705 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:17:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:45,034 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-11-25 18:17:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:17:45,035 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2022-11-25 18:17:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:45,036 INFO L225 Difference]: With dead ends: 87 [2022-11-25 18:17:45,036 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 18:17:45,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:17:45,037 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 58 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:45,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 597 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:17:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 18:17:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-25 18:17:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 82 states have internal predecessors, (84), 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) [2022-11-25 18:17:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-11-25 18:17:45,040 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 75 [2022-11-25 18:17:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:45,041 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-11-25 18:17:45,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:17:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-11-25 18:17:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-25 18:17:45,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:45,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:45,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-25 18:17:45,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-25 18:17:45,247 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:17:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash 54226440, now seen corresponding path program 1 times [2022-11-25 18:17:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:45,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291799736] [2022-11-25 18:17:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:17:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:17:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-25 18:17:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:45,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291799736] [2022-11-25 18:17:45,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291799736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:45,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112119255] [2022-11-25 18:17:45,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:45,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:45,773 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:45,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-25 18:17:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:46,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 18:17:46,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:46,521 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2022-11-25 18:17:46,527 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 14 [2022-11-25 18:17:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-25 18:17:46,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:47,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:17:47,056 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 36 [2022-11-25 18:17:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-25 18:17:47,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112119255] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:17:47,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:17:47,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-11-25 18:17:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6487319] [2022-11-25 18:17:47,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:47,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 18:17:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:47,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 18:17:47,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:17:47,288 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:17:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:48,348 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-25 18:17:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:17:48,349 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2022-11-25 18:17:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:48,350 INFO L225 Difference]: With dead ends: 86 [2022-11-25 18:17:48,350 INFO L226 Difference]: Without dead ends: 86 [2022-11-25 18:17:48,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:17:48,351 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:48,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 410 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:17:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-25 18:17:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-25 18:17:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 81 states have internal predecessors, (83), 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) [2022-11-25 18:17:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-11-25 18:17:48,355 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 78 [2022-11-25 18:17:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:48,356 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-11-25 18:17:48,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:17:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-11-25 18:17:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-25 18:17:48,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:48,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:48,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-11-25 18:17:48,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-25 18:17:48,566 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:17:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 54226439, now seen corresponding path program 1 times [2022-11-25 18:17:48,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:48,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980728518] [2022-11-25 18:17:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:48,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:17:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:17:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-25 18:17:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:48,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980728518] [2022-11-25 18:17:48,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980728518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:48,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371539003] [2022-11-25 18:17:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:48,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:48,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:48,895 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:48,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-25 18:17:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:49,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:17:49,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:49,552 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-25 18:17:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:17:49,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:49,737 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-25 18:17:49,737 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 15 [2022-11-25 18:17:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:17:49,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371539003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:17:49,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:17:49,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-11-25 18:17:49,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077463914] [2022-11-25 18:17:49,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:49,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:17:49,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:49,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:17:49,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:17:49,766 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:17:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:50,437 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-11-25 18:17:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:17:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2022-11-25 18:17:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:50,438 INFO L225 Difference]: With dead ends: 102 [2022-11-25 18:17:50,439 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 18:17:50,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:17:50,439 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:50,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 278 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:17:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 18:17:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2022-11-25 18:17:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 84 states have internal predecessors, (89), 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) [2022-11-25 18:17:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-25 18:17:50,444 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 78 [2022-11-25 18:17:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:50,444 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-25 18:17:50,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:17:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-25 18:17:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-25 18:17:50,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:50,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:50,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:50,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-25 18:17:50,646 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:17:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1681053503, now seen corresponding path program 1 times [2022-11-25 18:17:50,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:50,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122420881] [2022-11-25 18:17:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:50,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:52,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:17:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:17:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 18:17:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:52,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122420881] [2022-11-25 18:17:52,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122420881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:52,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175911432] [2022-11-25 18:17:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:52,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:52,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:52,894 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:52,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-25 18:17:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:53,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 18:17:53,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:53,496 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:17:53,714 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5953 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5953))))) is different from true [2022-11-25 18:17:53,777 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:17:53,829 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5954 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5954))))) is different from true [2022-11-25 18:17:53,890 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:17:53,990 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5955 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5955))))) is different from true [2022-11-25 18:17:54,051 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-25 18:17:54,512 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:17:54,513 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:17:54,809 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2022-11-25 18:17:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 18 not checked. [2022-11-25 18:17:54,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:55,170 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-25 18:17:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:17:57,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175911432] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:57,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:57,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [24, 12] total 37 [2022-11-25 18:17:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740088594] [2022-11-25 18:17:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:57,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:17:57,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:57,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:17:57,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1017, Unknown=3, NotChecked=198, Total=1332 [2022-11-25 18:17:57,349 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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) [2022-11-25 18:17:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:58,137 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-11-25 18:17:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:17:58,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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 79 [2022-11-25 18:17:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:58,139 INFO L225 Difference]: With dead ends: 89 [2022-11-25 18:17:58,139 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 18:17:58,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 142 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=165, Invalid=1404, Unknown=3, NotChecked=234, Total=1806 [2022-11-25 18:17:58,140 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:58,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 157 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:17:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 18:17:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-25 18:17:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 84 states have internal predecessors, (88), 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) [2022-11-25 18:17:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-11-25 18:17:58,144 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 79 [2022-11-25 18:17:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:58,144 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-11-25 18:17:58,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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) [2022-11-25 18:17:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-11-25 18:17:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 18:17:58,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:58,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:58,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:58,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-25 18:17:58,354 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:17:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 552239499, now seen corresponding path program 1 times [2022-11-25 18:17:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:58,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901757235] [2022-11-25 18:17:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:58,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:59,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:17:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:17:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 18:17:59,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:59,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901757235] [2022-11-25 18:17:59,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901757235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:59,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937293442] [2022-11-25 18:17:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:59,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:59,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:59,245 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:59,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-25 18:17:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:59,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 18:17:59,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:00,526 INFO L321 Elim1Store]: treesize reduction 12, result has 85.9 percent of original size [2022-11-25 18:18:00,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 122 [2022-11-25 18:18:00,763 INFO L321 Elim1Store]: treesize reduction 12, result has 83.6 percent of original size [2022-11-25 18:18:00,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 126 [2022-11-25 18:18:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 18:18:05,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:18:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 18:18:06,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937293442] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:06,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:18:06,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 12] total 20 [2022-11-25 18:18:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15603280] [2022-11-25 18:18:06,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:18:06,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:18:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:18:06,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:18:06,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:18:06,309 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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) [2022-11-25 18:18:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:18:07,404 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-11-25 18:18:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:18:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 81 [2022-11-25 18:18:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:18:07,406 INFO L225 Difference]: With dead ends: 86 [2022-11-25 18:18:07,406 INFO L226 Difference]: Without dead ends: 86 [2022-11-25 18:18:07,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:18:07,406 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 131 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:18:07,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 320 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:18:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-25 18:18:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-25 18:18:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 81 states have internal predecessors, (82), 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) [2022-11-25 18:18:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2022-11-25 18:18:07,411 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 81 [2022-11-25 18:18:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:18:07,411 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2022-11-25 18:18:07,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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) [2022-11-25 18:18:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-11-25 18:18:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 18:18:07,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:18:07,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:07,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-25 18:18:07,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-25 18:18:07,622 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:18:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 552239549, now seen corresponding path program 1 times [2022-11-25 18:18:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:18:07,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391973037] [2022-11-25 18:18:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:18:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:18:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:18:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:18:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 18:18:08,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:18:08,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391973037] [2022-11-25 18:18:08,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391973037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:08,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426334665] [2022-11-25 18:18:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:08,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:08,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:08,265 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:18:08,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-25 18:18:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:08,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 18:18:08,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:08,928 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 17 [2022-11-25 18:18:09,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:09,118 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 18:18:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 18:18:09,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:18:09,257 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-25 18:18:09,257 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 23 [2022-11-25 18:18:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 18:18:09,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426334665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:18:09,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:18:09,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 16 [2022-11-25 18:18:09,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668871574] [2022-11-25 18:18:09,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:18:09,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 18:18:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:18:09,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 18:18:09,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:18:09,431 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:18:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:18:10,977 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-11-25 18:18:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:18:10,977 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2022-11-25 18:18:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:18:10,978 INFO L225 Difference]: With dead ends: 93 [2022-11-25 18:18:10,978 INFO L226 Difference]: Without dead ends: 93 [2022-11-25 18:18:10,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:18:10,979 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:18:10,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 554 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 18:18:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-25 18:18:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2022-11-25 18:18:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 81 states have internal predecessors, (83), 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) [2022-11-25 18:18:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-11-25 18:18:10,984 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 81 [2022-11-25 18:18:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:18:10,985 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-11-25 18:18:10,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:18:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-11-25 18:18:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 18:18:10,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:18:10,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:10,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-25 18:18:11,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-25 18:18:11,187 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:18:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash 552239550, now seen corresponding path program 1 times [2022-11-25 18:18:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:18:11,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256437525] [2022-11-25 18:18:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:18:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:12,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:18:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:18:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:12,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:18:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 18:18:12,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:18:12,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256437525] [2022-11-25 18:18:12,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256437525] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:12,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115189110] [2022-11-25 18:18:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:12,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:12,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:12,045 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:18:12,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-25 18:18:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:12,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 18:18:12,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:13,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:13,135 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 60 [2022-11-25 18:18:13,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:13,160 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2022-11-25 18:18:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 18:18:13,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:18:13,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:13,956 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 60 [2022-11-25 18:18:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 18:18:14,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115189110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:18:14,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:18:14,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-11-25 18:18:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486223879] [2022-11-25 18:18:14,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:18:14,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:18:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:18:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:18:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:18:14,667 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:18:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:18:17,151 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-11-25 18:18:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:18:17,152 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2022-11-25 18:18:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:18:17,153 INFO L225 Difference]: With dead ends: 92 [2022-11-25 18:18:17,153 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 18:18:17,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:18:17,154 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 197 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:18:17,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 535 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 18:18:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 18:18:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2022-11-25 18:18:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 81 states have internal predecessors, (82), 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) [2022-11-25 18:18:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2022-11-25 18:18:17,158 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 81 [2022-11-25 18:18:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:18:17,159 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2022-11-25 18:18:17,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:18:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-11-25 18:18:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:18:17,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:18:17,160 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:17,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-25 18:18:17,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:17,360 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-25 18:18:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1873734531, now seen corresponding path program 1 times [2022-11-25 18:18:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:18:17,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181615306] [2022-11-25 18:18:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:17,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:18:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:18:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:18:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:18:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:18:24,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:18:24,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181615306] [2022-11-25 18:18:24,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181615306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:24,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440773897] [2022-11-25 18:18:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:24,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:24,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:24,280 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:18:24,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee6b41f-009d-4189-ad28-f9efae0f2909/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-25 18:18:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:24,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-25 18:18:24,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:24,825 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 18:18:25,021 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-25 18:18:25,721 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:18:25,721 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-25 18:18:26,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:18:26,830 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:18:26,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:18:27,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-25 18:18:27,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:18:28,197 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:18:28,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-25 18:18:28,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 18:18:29,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:18:29,222 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2022-11-25 18:18:29,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:18:30,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:30,789 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:18:30,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2022-11-25 18:18:30,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:30,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:30,855 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:18:30,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-25 18:18:30,906 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:18:30,906 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-25 18:18:33,809 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 18:18:33,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 82 [2022-11-25 18:18:33,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:33,896 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 18:18:33,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2022-11-25 18:18:34,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:34,413 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:18:34,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 63 [2022-11-25 18:18:34,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:34,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:34,472 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-25 18:18:34,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 57 [2022-11-25 18:18:36,452 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-25 18:18:36,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 42 [2022-11-25 18:18:37,139 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:18:37,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-25 18:18:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 18:18:37,403 INFO L328 TraceCheckSpWp]: Computing backward predicates...