./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:22:18,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:22:18,308 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 20:22:18,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:22:18,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:22:18,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:22:18,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:22:18,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:22:18,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:22:18,341 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:22:18,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:22:18,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:22:18,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:22:18,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:22:18,344 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:22:18,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:22:18,345 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:22:18,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:22:18,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:22:18,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:22:18,347 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:22:18,349 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:22:18,349 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:22:18,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:22:18,350 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:22:18,350 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:22:18,351 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:22:18,351 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:22:18,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:22:18,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:22:18,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:22:18,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:22:18,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:18,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:22:18,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:22:18,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:22:18,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:22:18,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:22:18,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:22:18,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:22:18,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:22:18,376 INFO L153 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_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/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_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2023-11-28 20:22:18,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:22:18,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:22:18,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:22:18,627 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:22:18,628 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:22:18,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-11-28 20:22:21,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:22:21,812 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:22:21,813 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-11-28 20:22:21,830 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/data/44724f253/f9113dad49c44fe0857a901cf66d013a/FLAGd3f80736c [2023-11-28 20:22:21,845 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/data/44724f253/f9113dad49c44fe0857a901cf66d013a [2023-11-28 20:22:21,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:22:21,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:22:21,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:21,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:22:21,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:22:21,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:21" (1/1) ... [2023-11-28 20:22:21,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0e2086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21, skipping insertion in model container [2023-11-28 20:22:21,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:21" (1/1) ... [2023-11-28 20:22:21,918 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:22:22,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:22,276 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:22:22,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:22,361 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:22:22,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22 WrapperNode [2023-11-28 20:22:22,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:22,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:22,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:22:22,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:22:22,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,419 INFO L138 Inliner]: procedures = 127, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 122 [2023-11-28 20:22:22,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:22,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:22:22,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:22:22,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:22:22,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,461 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 7, 12]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2023-11-28 20:22:22,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:22:22,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:22:22,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:22:22,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:22:22,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (1/1) ... [2023-11-28 20:22:22,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:22,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:22,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:22:22,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:22:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-28 20:22:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-28 20:22:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 20:22:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 20:22:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 20:22:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:22:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:22:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:22:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 20:22:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:22:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:22:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-28 20:22:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-28 20:22:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-28 20:22:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-28 20:22:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-28 20:22:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-28 20:22:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:22:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-28 20:22:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-28 20:22:22,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-28 20:22:22,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:22:22,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:22:22,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:22:22,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:22:22,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:22:22,738 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:22:22,741 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:22:22,774 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-28 20:22:23,102 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:22:23,152 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:22:23,153 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-28 20:22:23,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:23 BoogieIcfgContainer [2023-11-28 20:22:23,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:22:23,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:22:23,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:22:23,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:22:23,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:21" (1/3) ... [2023-11-28 20:22:23,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c962b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:23, skipping insertion in model container [2023-11-28 20:22:23,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:22" (2/3) ... [2023-11-28 20:22:23,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c962b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:23, skipping insertion in model container [2023-11-28 20:22:23,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:23" (3/3) ... [2023-11-28 20:22:23,164 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2023-11-28 20:22:23,183 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:22:23,184 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-28 20:22:23,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:22:23,242 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;@28dc653d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:22:23,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-28 20:22:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 41 states have (on average 2.317073170731707) internal successors, (95), 83 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 20:22:23,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:23,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 20:22:23,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:23,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash 6361566, now seen corresponding path program 1 times [2023-11-28 20:22:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95155502] [2023-11-28 20:22:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:23,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:23,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95155502] [2023-11-28 20:22:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95155502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023091476] [2023-11-28 20:22:23,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:23,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:23,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:23,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:23,607 INFO L87 Difference]: Start difference. First operand has 85 states, 41 states have (on average 2.317073170731707) internal successors, (95), 83 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:23,749 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-11-28 20:22:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:23,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-28 20:22:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:23,760 INFO L225 Difference]: With dead ends: 81 [2023-11-28 20:22:23,761 INFO L226 Difference]: Without dead ends: 76 [2023-11-28 20:22:23,763 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 [2023-11-28 20:22:23,768 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:23,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-28 20:22:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-28 20:22:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-11-28 20:22:23,811 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 4 [2023-11-28 20:22:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:23,812 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-11-28 20:22:23,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-11-28 20:22:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 20:22:23,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:23,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 20:22:23,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:22:23,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:23,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash 6361567, now seen corresponding path program 1 times [2023-11-28 20:22:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:23,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795023562] [2023-11-28 20:22:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:23,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:23,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:23,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795023562] [2023-11-28 20:22:23,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795023562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:23,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:23,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242718719] [2023-11-28 20:22:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:23,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:23,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:23,945 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:24,036 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2023-11-28 20:22:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-28 20:22:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:24,038 INFO L225 Difference]: With dead ends: 73 [2023-11-28 20:22:24,039 INFO L226 Difference]: Without dead ends: 73 [2023-11-28 20:22:24,039 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 [2023-11-28 20:22:24,041 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:24,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 98 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-28 20:22:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-28 20:22:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2023-11-28 20:22:24,051 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 4 [2023-11-28 20:22:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:24,052 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2023-11-28 20:22:24,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2023-11-28 20:22:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 20:22:24,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:24,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:22:24,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:22:24,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:24,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash 197307524, now seen corresponding path program 1 times [2023-11-28 20:22:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190784555] [2023-11-28 20:22:24,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:24,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190784555] [2023-11-28 20:22:24,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190784555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:24,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195309997] [2023-11-28 20:22:24,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:24,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:24,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:24,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:24,122 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:24,163 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-11-28 20:22:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-28 20:22:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:24,165 INFO L225 Difference]: With dead ends: 83 [2023-11-28 20:22:24,165 INFO L226 Difference]: Without dead ends: 83 [2023-11-28 20:22:24,166 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 [2023-11-28 20:22:24,168 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:24,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:22:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-28 20:22:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2023-11-28 20:22:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-11-28 20:22:24,178 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 5 [2023-11-28 20:22:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:24,179 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-11-28 20:22:24,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-11-28 20:22:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 20:22:24,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:24,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:24,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:22:24,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:24,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash -475556254, now seen corresponding path program 1 times [2023-11-28 20:22:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:24,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036254597] [2023-11-28 20:22:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036254597] [2023-11-28 20:22:24,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036254597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:24,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838989552] [2023-11-28 20:22:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:24,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:24,257 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:24,304 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2023-11-28 20:22:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-28 20:22:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:24,306 INFO L225 Difference]: With dead ends: 80 [2023-11-28 20:22:24,306 INFO L226 Difference]: Without dead ends: 80 [2023-11-28 20:22:24,306 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 [2023-11-28 20:22:24,308 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:24,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:22:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-28 20:22:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-11-28 20:22:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-28 20:22:24,317 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 8 [2023-11-28 20:22:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:24,318 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-28 20:22:24,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-28 20:22:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-28 20:22:24,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:24,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:22:24,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:24,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash 136930353, now seen corresponding path program 1 times [2023-11-28 20:22:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:24,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946883378] [2023-11-28 20:22:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:22:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:24,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946883378] [2023-11-28 20:22:24,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946883378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302883429] [2023-11-28 20:22:24,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:24,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:24,417 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:24,499 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2023-11-28 20:22:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:24,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-28 20:22:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:24,501 INFO L225 Difference]: With dead ends: 76 [2023-11-28 20:22:24,501 INFO L226 Difference]: Without dead ends: 76 [2023-11-28 20:22:24,502 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 [2023-11-28 20:22:24,504 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:24,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-28 20:22:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-28 20:22:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-11-28 20:22:24,512 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 12 [2023-11-28 20:22:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:24,513 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-11-28 20:22:24,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-11-28 20:22:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-28 20:22:24,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:24,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:24,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:22:24,515 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:24,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash 136930354, now seen corresponding path program 1 times [2023-11-28 20:22:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:24,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606007679] [2023-11-28 20:22:24,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:24,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606007679] [2023-11-28 20:22:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606007679] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:22:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127976232] [2023-11-28 20:22:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:24,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:24,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:24,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:24,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:22:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:24,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:22:24,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:24,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:24,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127976232] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:22:24,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:22:24,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-11-28 20:22:24,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214587982] [2023-11-28 20:22:24,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:22:24,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:22:24,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:22:24,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:24,852 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:24,898 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-28 20:22:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:22:24,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-28 20:22:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:24,900 INFO L225 Difference]: With dead ends: 78 [2023-11-28 20:22:24,900 INFO L226 Difference]: Without dead ends: 78 [2023-11-28 20:22:24,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:24,901 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:24,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 178 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:22:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-28 20:22:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-28 20:22:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-11-28 20:22:24,917 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 12 [2023-11-28 20:22:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:24,917 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-11-28 20:22:24,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-11-28 20:22:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-28 20:22:24,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:24,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-28 20:22:24,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:22:25,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:25,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:25,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash 419439509, now seen corresponding path program 1 times [2023-11-28 20:22:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:25,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833768281] [2023-11-28 20:22:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:25,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:25,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:25,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833768281] [2023-11-28 20:22:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833768281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:22:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768837452] [2023-11-28 20:22:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:25,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:25,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:25,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:25,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:22:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:25,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 20:22:25,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:25,496 INFO L378 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 [2023-11-28 20:22:25,543 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-28 20:22:25,544 INFO L378 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 19 treesize of output 16 [2023-11-28 20:22:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:25,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:25,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768837452] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:22:25,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:22:25,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-11-28 20:22:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110977451] [2023-11-28 20:22:25,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:22:25,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:22:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:25,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:22:25,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:25,693 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:25,892 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2023-11-28 20:22:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:22:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-28 20:22:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:25,894 INFO L225 Difference]: With dead ends: 77 [2023-11-28 20:22:25,894 INFO L226 Difference]: Without dead ends: 77 [2023-11-28 20:22:25,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:22:25,895 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:25,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 185 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:22:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-28 20:22:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-28 20:22:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-11-28 20:22:25,902 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 15 [2023-11-28 20:22:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:25,902 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-11-28 20:22:25,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-11-28 20:22:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-28 20:22:25,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:25,903 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-28 20:22:25,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:22:26,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:26,109 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:26,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 419439510, now seen corresponding path program 1 times [2023-11-28 20:22:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438210806] [2023-11-28 20:22:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:26,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:26,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438210806] [2023-11-28 20:22:26,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438210806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:22:26,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788918667] [2023-11-28 20:22:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:26,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:26,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:26,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:26,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 20:22:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:26,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 20:22:26,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:26,536 INFO L378 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 [2023-11-28 20:22:26,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:22:26,643 INFO L378 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 14 treesize of output 9 [2023-11-28 20:22:26,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:22:26,657 INFO L378 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 [2023-11-28 20:22:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:26,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:26,943 INFO L378 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 49 treesize of output 45 [2023-11-28 20:22:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788918667] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:22:27,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:22:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-28 20:22:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560709535] [2023-11-28 20:22:27,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:22:27,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:22:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:22:27,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:22:27,022 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:27,284 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2023-11-28 20:22:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:22:27,285 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-28 20:22:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:27,286 INFO L225 Difference]: With dead ends: 76 [2023-11-28 20:22:27,286 INFO L226 Difference]: Without dead ends: 76 [2023-11-28 20:22:27,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:22:27,287 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:27,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 193 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:22:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-28 20:22:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-28 20:22:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-11-28 20:22:27,293 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 15 [2023-11-28 20:22:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:27,293 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-11-28 20:22:27,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-11-28 20:22:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-28 20:22:27,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:27,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-28 20:22:27,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 20:22:27,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:27,497 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:27,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1757274139, now seen corresponding path program 2 times [2023-11-28 20:22:27,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:27,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554547283] [2023-11-28 20:22:27,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:27,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554547283] [2023-11-28 20:22:27,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554547283] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:22:27,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041580595] [2023-11-28 20:22:27,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:22:27,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:27,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:27,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-28 20:22:27,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:22:27,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:22:27,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:22:27,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:27,721 INFO L378 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 8 treesize of output 1 [2023-11-28 20:22:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:22:27,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:27,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041580595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:27,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 20:22:27,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-28 20:22:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899508177] [2023-11-28 20:22:27,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:27,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:27,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:27,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:27,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:22:27,738 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:27,820 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2023-11-28 20:22:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:27,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-28 20:22:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:27,822 INFO L225 Difference]: With dead ends: 73 [2023-11-28 20:22:27,822 INFO L226 Difference]: Without dead ends: 73 [2023-11-28 20:22:27,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:22:27,823 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:27,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-28 20:22:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-28 20:22:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2023-11-28 20:22:27,828 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 19 [2023-11-28 20:22:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:27,829 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2023-11-28 20:22:27,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2023-11-28 20:22:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-28 20:22:27,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:27,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:27,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-28 20:22:28,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:28,038 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:28,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash 402498854, now seen corresponding path program 1 times [2023-11-28 20:22:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:28,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386394567] [2023-11-28 20:22:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386394567] [2023-11-28 20:22:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386394567] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:22:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802237450] [2023-11-28 20:22:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:28,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:28,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:28,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:28,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-28 20:22:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:28,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:22:28,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:28,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:28,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802237450] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:22:28,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:22:28,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-28 20:22:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268856384] [2023-11-28 20:22:28,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:22:28,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:22:28,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:22:28,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:28,330 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:28,393 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-11-28 20:22:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:22:28,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-28 20:22:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:28,395 INFO L225 Difference]: With dead ends: 73 [2023-11-28 20:22:28,395 INFO L226 Difference]: Without dead ends: 73 [2023-11-28 20:22:28,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:22:28,396 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:28,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-28 20:22:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-28 20:22:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.673913043478261) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-11-28 20:22:28,400 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 22 [2023-11-28 20:22:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:28,401 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-11-28 20:22:28,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-11-28 20:22:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-28 20:22:28,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:28,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:28,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-28 20:22:28,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:28,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:28,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1539222309, now seen corresponding path program 1 times [2023-11-28 20:22:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537309303] [2023-11-28 20:22:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:28,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:22:28,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537309303] [2023-11-28 20:22:28,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537309303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:22:28,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999316245] [2023-11-28 20:22:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:28,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:28,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:28,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:28,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-28 20:22:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:29,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-28 20:22:29,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:29,168 INFO L378 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 [2023-11-28 20:22:29,192 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-28 20:22:29,192 INFO L378 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 14 treesize of output 13 [2023-11-28 20:22:29,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:22:29,290 INFO L378 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 18 treesize of output 13 [2023-11-28 20:22:29,353 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-28 20:22:29,353 INFO L378 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 [2023-11-28 20:22:29,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:29,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999316245] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:22:47,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:22:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-28 20:22:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753942480] [2023-11-28 20:22:47,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:22:47,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 20:22:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:47,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 20:22:47,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=144, Unknown=5, NotChecked=0, Total=210 [2023-11-28 20:22:47,582 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:47,782 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-28 20:22:47,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:22:47,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-28 20:22:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:47,783 INFO L225 Difference]: With dead ends: 78 [2023-11-28 20:22:47,783 INFO L226 Difference]: Without dead ends: 78 [2023-11-28 20:22:47,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=74, Invalid=161, Unknown=5, NotChecked=0, Total=240 [2023-11-28 20:22:47,785 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 84 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:47,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 127 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:22:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-28 20:22:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2023-11-28 20:22:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-11-28 20:22:47,789 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2023-11-28 20:22:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:47,790 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-11-28 20:22:47,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-11-28 20:22:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-28 20:22:47,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:47,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:47,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-28 20:22:47,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:47,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:47,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1539222310, now seen corresponding path program 1 times [2023-11-28 20:22:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665140729] [2023-11-28 20:22:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-28 20:22:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665140729] [2023-11-28 20:22:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665140729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:22:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86778488] [2023-11-28 20:22:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:48,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:48,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:48,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:48,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-28 20:22:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:48,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-28 20:22:48,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:48,472 INFO L378 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 8 treesize of output 1 [2023-11-28 20:22:48,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:22:48,498 INFO L378 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 14 treesize of output 9 [2023-11-28 20:22:48,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:22:48,555 INFO L378 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 14 treesize of output 9 [2023-11-28 20:22:48,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:22:48,631 INFO L378 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 14 treesize of output 9 [2023-11-28 20:22:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:22:48,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:48,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86778488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:48,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 20:22:48,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2023-11-28 20:22:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835498315] [2023-11-28 20:22:48,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:48,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:22:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:22:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:22:48,665 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:48,750 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-28 20:22:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:22:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-28 20:22:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:48,751 INFO L225 Difference]: With dead ends: 61 [2023-11-28 20:22:48,751 INFO L226 Difference]: Without dead ends: 61 [2023-11-28 20:22:48,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:22:48,752 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:48,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 54 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-28 20:22:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-28 20:22:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-11-28 20:22:48,755 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 23 [2023-11-28 20:22:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:48,756 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-11-28 20:22:48,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-11-28 20:22:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-28 20:22:48,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:48,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:48,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-28 20:22:48,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-28 20:22:48,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:48,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash 471251364, now seen corresponding path program 1 times [2023-11-28 20:22:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069376351] [2023-11-28 20:22:48,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:48,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:22:49,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:49,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069376351] [2023-11-28 20:22:49,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069376351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:49,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:49,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:22:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387993517] [2023-11-28 20:22:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:49,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:22:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:49,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:22:49,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:49,062 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:49,131 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2023-11-28 20:22:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:22:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-28 20:22:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:49,132 INFO L225 Difference]: With dead ends: 60 [2023-11-28 20:22:49,132 INFO L226 Difference]: Without dead ends: 60 [2023-11-28 20:22:49,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:49,133 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:49,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-28 20:22:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-28 20:22:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.391304347826087) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-28 20:22:49,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 24 [2023-11-28 20:22:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:49,136 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-28 20:22:49,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-28 20:22:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-28 20:22:49,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:49,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:49,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:22:49,137 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:49,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash 471251365, now seen corresponding path program 1 times [2023-11-28 20:22:49,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:49,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903514051] [2023-11-28 20:22:49,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:22:49,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:49,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903514051] [2023-11-28 20:22:49,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903514051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:49,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:49,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:22:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029426358] [2023-11-28 20:22:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:49,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:22:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:22:49,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:49,297 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:49,361 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-11-28 20:22:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:22:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-28 20:22:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:49,362 INFO L225 Difference]: With dead ends: 59 [2023-11-28 20:22:49,362 INFO L226 Difference]: Without dead ends: 59 [2023-11-28 20:22:49,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:49,363 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:49,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-28 20:22:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-28 20:22:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-11-28 20:22:49,366 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 24 [2023-11-28 20:22:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:49,366 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-11-28 20:22:49,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-11-28 20:22:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-28 20:22:49,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:49,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:49,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:22:49,368 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:49,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:49,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1601500638, now seen corresponding path program 1 times [2023-11-28 20:22:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:49,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855172993] [2023-11-28 20:22:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:22:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855172993] [2023-11-28 20:22:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855172993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:49,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089619016] [2023-11-28 20:22:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:49,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:22:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:49,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:22:49,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:49,631 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:49,806 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-11-28 20:22:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:22:49,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-28 20:22:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:49,808 INFO L225 Difference]: With dead ends: 58 [2023-11-28 20:22:49,808 INFO L226 Difference]: Without dead ends: 58 [2023-11-28 20:22:49,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:22:49,809 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:49,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 138 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:22:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-28 20:22:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-28 20:22:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2023-11-28 20:22:49,812 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 28 [2023-11-28 20:22:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:49,812 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-11-28 20:22:49,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2023-11-28 20:22:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-28 20:22:49,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:49,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:49,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:22:49,813 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:49,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1601500639, now seen corresponding path program 1 times [2023-11-28 20:22:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968854228] [2023-11-28 20:22:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:22:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:50,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968854228] [2023-11-28 20:22:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968854228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588355413] [2023-11-28 20:22:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:50,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:50,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:50,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:50,190 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:50,329 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-11-28 20:22:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:22:50,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-28 20:22:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:50,331 INFO L225 Difference]: With dead ends: 57 [2023-11-28 20:22:50,331 INFO L226 Difference]: Without dead ends: 57 [2023-11-28 20:22:50,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:22:50,332 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:50,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 134 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-28 20:22:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-28 20:22:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-11-28 20:22:50,335 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2023-11-28 20:22:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:50,335 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-11-28 20:22:50,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-11-28 20:22:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-28 20:22:50,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:50,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:50,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:22:50,337 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:50,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1455174979, now seen corresponding path program 1 times [2023-11-28 20:22:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:50,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102233682] [2023-11-28 20:22:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:22:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:50,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102233682] [2023-11-28 20:22:50,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102233682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:50,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:50,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:50,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533984623] [2023-11-28 20:22:50,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:50,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:50,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:50,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:50,551 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:50,672 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2023-11-28 20:22:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:22:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-28 20:22:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:50,673 INFO L225 Difference]: With dead ends: 57 [2023-11-28 20:22:50,674 INFO L226 Difference]: Without dead ends: 57 [2023-11-28 20:22:50,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:22:50,674 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:50,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 154 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-28 20:22:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-28 20:22:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2023-11-28 20:22:50,677 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 30 [2023-11-28 20:22:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:50,678 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2023-11-28 20:22:50,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2023-11-28 20:22:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-28 20:22:50,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:50,679 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:22:50,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:22:50,679 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:50,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 327265849, now seen corresponding path program 1 times [2023-11-28 20:22:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648615735] [2023-11-28 20:22:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:22:50,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:50,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648615735] [2023-11-28 20:22:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648615735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139106207] [2023-11-28 20:22:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:50,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:22:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:50,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:22:50,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:50,957 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:51,126 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-11-28 20:22:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:51,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-28 20:22:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:51,127 INFO L225 Difference]: With dead ends: 87 [2023-11-28 20:22:51,127 INFO L226 Difference]: Without dead ends: 87 [2023-11-28 20:22:51,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:22:51,128 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 69 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:51,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 121 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:22:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-28 20:22:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 58. [2023-11-28 20:22:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2023-11-28 20:22:51,131 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 32 [2023-11-28 20:22:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:51,132 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2023-11-28 20:22:51,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2023-11-28 20:22:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-28 20:22:51,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:51,133 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:22:51,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:22:51,133 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:51,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 327265850, now seen corresponding path program 1 times [2023-11-28 20:22:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:51,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205762451] [2023-11-28 20:22:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:22:51,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:51,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205762451] [2023-11-28 20:22:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205762451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024777824] [2023-11-28 20:22:51,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:51,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:51,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:51,574 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:51,733 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-11-28 20:22:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:22:51,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-28 20:22:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:51,735 INFO L225 Difference]: With dead ends: 79 [2023-11-28 20:22:51,735 INFO L226 Difference]: Without dead ends: 79 [2023-11-28 20:22:51,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:51,736 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:51,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 105 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-28 20:22:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2023-11-28 20:22:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-11-28 20:22:51,739 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 32 [2023-11-28 20:22:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:51,739 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-11-28 20:22:51,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-11-28 20:22:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-28 20:22:51,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:51,740 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:22:51,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:22:51,741 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:51,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 16174, now seen corresponding path program 1 times [2023-11-28 20:22:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623885200] [2023-11-28 20:22:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:22:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623885200] [2023-11-28 20:22:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623885200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:51,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:51,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575773405] [2023-11-28 20:22:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:51,977 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:52,065 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-11-28 20:22:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:52,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-28 20:22:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:52,066 INFO L225 Difference]: With dead ends: 64 [2023-11-28 20:22:52,066 INFO L226 Difference]: Without dead ends: 64 [2023-11-28 20:22:52,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:52,067 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:52,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 138 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:22:52,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-28 20:22:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2023-11-28 20:22:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2023-11-28 20:22:52,071 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 35 [2023-11-28 20:22:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:52,071 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2023-11-28 20:22:52,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2023-11-28 20:22:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-28 20:22:52,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:52,073 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:22:52,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:22:52,073 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:22:52,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 104569961, now seen corresponding path program 1 times [2023-11-28 20:22:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272138556] [2023-11-28 20:22:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-28 20:22:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272138556] [2023-11-28 20:22:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272138556] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:22:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853452301] [2023-11-28 20:22:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:53,000 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:53,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-28 20:22:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:53,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-28 20:22:53,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:53,266 INFO L378 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 [2023-11-28 20:22:53,365 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-28 20:22:53,366 INFO L378 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 [2023-11-28 20:22:53,564 INFO L378 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 17 treesize of output 13 [2023-11-28 20:22:53,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:22:53,726 INFO L378 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 17 [2023-11-28 20:22:53,806 INFO L378 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 0 case distinctions, treesize of input 58 treesize of output 31 [2023-11-28 20:22:53,816 INFO L378 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 15 treesize of output 1 [2023-11-28 20:22:53,860 INFO L378 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 49 treesize of output 33 [2023-11-28 20:22:53,863 INFO L378 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 37 treesize of output 25 [2023-11-28 20:22:53,902 INFO L378 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 13 [2023-11-28 20:22:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:22:53,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:53,997 INFO L378 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 68 treesize of output 64 [2023-11-28 20:23:14,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:14,906 INFO L378 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 76 treesize of output 136 [2023-11-28 20:23:15,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse5 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (forall ((v_ArrVal_1569 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1569) .cse3))) (let ((.cse0 (select .cse1 .cse2))) (or (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse0) (= (select .cse1 (+ 4 v_arrayElimCell_20)) .cse0))))) (not .cse4) (not .cse5)) (forall ((v_ArrVal_1569 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1569) .cse3))) (or (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (select .cse6 .cse2)) (= (select .cse6 (+ 4 v_arrayElimCell_20)) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|)))) (or (forall ((v_ArrVal_1569 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse8 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1569) .cse3))) (let ((.cse7 (select .cse8 (+ 4 v_arrayElimCell_20)))) (or (= .cse7 (select .cse8 .cse2)) (= .cse7 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|))))) (and .cse4 .cse5)) (forall ((v_ArrVal_1569 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse11 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1569) .cse3))) (let ((.cse9 (select .cse11 .cse2)) (.cse10 (select .cse11 (+ 4 v_arrayElimCell_20)))) (or (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse9) (= .cse10 .cse9) (= .cse10 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|))))))) is different from false [2023-11-28 20:23:15,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:15,612 INFO L378 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 116 treesize of output 96 [2023-11-28 20:23:15,636 INFO L349 Elim1Store]: treesize reduction 44, result has 15.4 percent of original size [2023-11-28 20:23:15,637 INFO L378 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 126 [2023-11-28 20:23:15,643 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:23:15,643 INFO L378 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 63 treesize of output 51 [2023-11-28 20:23:15,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:15,671 INFO L378 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 116 treesize of output 96 [2023-11-28 20:23:15,706 INFO L349 Elim1Store]: treesize reduction 28, result has 46.2 percent of original size [2023-11-28 20:23:15,707 INFO L378 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 142 [2023-11-28 20:23:15,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:23:15,737 INFO L378 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 63 treesize of output 51 [2023-11-28 20:23:15,760 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-28 20:23:15,760 INFO L378 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 158 treesize of output 1 [2023-11-28 20:23:15,769 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-28 20:23:15,770 INFO L378 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 85 treesize of output 1 [2023-11-28 20:23:15,966 INFO L378 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 [2023-11-28 20:23:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:23:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853452301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:23:16,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:23:16,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2023-11-28 20:23:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225289447] [2023-11-28 20:23:16,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:23:16,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-28 20:23:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:23:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-28 20:23:16,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1048, Unknown=29, NotChecked=66, Total=1260 [2023-11-28 20:23:16,046 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:17,222 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-11-28 20:23:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:23:17,223 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-28 20:23:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:17,223 INFO L225 Difference]: With dead ends: 95 [2023-11-28 20:23:17,224 INFO L226 Difference]: Without dead ends: 95 [2023-11-28 20:23:17,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=218, Invalid=1733, Unknown=33, NotChecked=86, Total=2070 [2023-11-28 20:23:17,226 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 192 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:17,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 281 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 693 Invalid, 0 Unknown, 98 Unchecked, 0.6s Time] [2023-11-28 20:23:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-28 20:23:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 62. [2023-11-28 20:23:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2023-11-28 20:23:17,229 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 36 [2023-11-28 20:23:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:17,230 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2023-11-28 20:23:17,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2023-11-28 20:23:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-28 20:23:17,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:17,231 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:23:17,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-28 20:23:17,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:23:17,433 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:23:17,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash 104569962, now seen corresponding path program 1 times [2023-11-28 20:23:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:23:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145998857] [2023-11-28 20:23:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:23:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:23:19,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:23:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145998857] [2023-11-28 20:23:19,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145998857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:23:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392666719] [2023-11-28 20:23:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:19,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:23:19,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:23:19,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:23:19,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-28 20:23:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:19,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-28 20:23:19,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:19,297 INFO L378 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 [2023-11-28 20:23:19,413 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-28 20:23:19,413 INFO L378 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 [2023-11-28 20:23:19,661 INFO L378 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 15 treesize of output 11 [2023-11-28 20:23:19,668 INFO L378 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 15 treesize of output 11 [2023-11-28 20:23:19,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:23:19,913 INFO L378 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 28 treesize of output 15 [2023-11-28 20:23:19,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:23:19,931 INFO L378 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 28 treesize of output 15 [2023-11-28 20:23:20,027 INFO L378 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 0 case distinctions, treesize of input 52 treesize of output 25 [2023-11-28 20:23:20,036 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 20:23:20,097 INFO L378 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 48 treesize of output 28 [2023-11-28 20:23:20,155 INFO L378 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 [2023-11-28 20:23:20,160 INFO L378 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 [2023-11-28 20:23:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:23:20,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:23:20,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:20,608 INFO L378 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 120 treesize of output 124 [2023-11-28 20:23:20,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:20,963 INFO L378 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 56 treesize of output 57 [2023-11-28 20:23:20,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:20,978 INFO L378 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 116 treesize of output 115 [2023-11-28 20:23:20,987 INFO L378 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 25 treesize of output 9 [2023-11-28 20:23:21,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:21,012 INFO L378 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 54 treesize of output 55 [2023-11-28 20:23:21,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:23:21,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:23:21,021 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 12 [2023-11-28 20:23:21,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:21,034 INFO L378 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 52 treesize of output 53 [2023-11-28 20:23:21,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:23:21,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:23:21,043 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 10 [2023-11-28 20:23:21,400 INFO L378 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 27 treesize of output 19 [2023-11-28 20:23:21,404 INFO L378 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 [2023-11-28 20:23:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:23:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392666719] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:23:21,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:23:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 42 [2023-11-28 20:23:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591122837] [2023-11-28 20:23:21,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:23:21,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-28 20:23:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:23:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-28 20:23:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1658, Unknown=5, NotChecked=0, Total=1806 [2023-11-28 20:23:21,595 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 43 states, 42 states have (on average 2.380952380952381) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:23,332 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2023-11-28 20:23:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-28 20:23:23,333 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.380952380952381) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-28 20:23:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:23,334 INFO L225 Difference]: With dead ends: 91 [2023-11-28 20:23:23,334 INFO L226 Difference]: Without dead ends: 91 [2023-11-28 20:23:23,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=286, Invalid=2901, Unknown=5, NotChecked=0, Total=3192 [2023-11-28 20:23:23,335 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 308 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:23,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 485 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 20:23:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-28 20:23:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2023-11-28 20:23:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2023-11-28 20:23:23,338 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 36 [2023-11-28 20:23:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:23,338 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2023-11-28 20:23:23,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.380952380952381) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2023-11-28 20:23:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-28 20:23:23,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:23,338 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:23:23,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-28 20:23:23,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-28 20:23:23,539 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:23:23,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1053309223, now seen corresponding path program 1 times [2023-11-28 20:23:23,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:23:23,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366503080] [2023-11-28 20:23:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:23:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-28 20:23:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:23:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366503080] [2023-11-28 20:23:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366503080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:23:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247064162] [2023-11-28 20:23:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:24,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:23:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:23:24,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:23:24,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:23:24,237 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:24,502 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2023-11-28 20:23:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:23:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-28 20:23:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:24,503 INFO L225 Difference]: With dead ends: 63 [2023-11-28 20:23:24,503 INFO L226 Difference]: Without dead ends: 63 [2023-11-28 20:23:24,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:23:24,504 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:24,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 177 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:23:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-28 20:23:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-28 20:23:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-11-28 20:23:24,506 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 37 [2023-11-28 20:23:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:24,507 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-11-28 20:23:24,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-11-28 20:23:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-28 20:23:24,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:24,508 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:23:24,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 20:23:24,508 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:23:24,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:24,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1391289086, now seen corresponding path program 1 times [2023-11-28 20:23:24,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:23:24,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934858785] [2023-11-28 20:23:24,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:24,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:23:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:23:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:23:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934858785] [2023-11-28 20:23:24,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934858785] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:23:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332888874] [2023-11-28 20:23:24,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:24,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:23:24,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:23:24,603 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:23:24,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-28 20:23:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:24,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:24,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:23:24,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:23:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 20:23:24,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332888874] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:23:24,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:23:24,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-11-28 20:23:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259240579] [2023-11-28 20:23:24,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:23:24,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:23:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:23:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:23:24,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:23:24,919 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:24,973 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-11-28 20:23:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:23:24,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-28 20:23:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:24,975 INFO L225 Difference]: With dead ends: 81 [2023-11-28 20:23:24,975 INFO L226 Difference]: Without dead ends: 81 [2023-11-28 20:23:24,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:23:24,976 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 116 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:24,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 131 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:23:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-28 20:23:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2023-11-28 20:23:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2023-11-28 20:23:24,978 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 39 [2023-11-28 20:23:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:24,978 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2023-11-28 20:23:24,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2023-11-28 20:23:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-28 20:23:24,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:24,979 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:23:24,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-28 20:23:25,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-28 20:23:25,180 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:23:25,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1391204227, now seen corresponding path program 1 times [2023-11-28 20:23:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:23:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303486247] [2023-11-28 20:23:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:23:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:23:26,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:23:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303486247] [2023-11-28 20:23:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303486247] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:23:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858179764] [2023-11-28 20:23:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:26,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:23:26,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:23:26,047 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:23:26,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-28 20:23:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:26,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-28 20:23:26,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:26,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 20:23:26,424 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-28 20:23:26,425 INFO L378 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 [2023-11-28 20:23:26,587 INFO L378 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 15 treesize of output 11 [2023-11-28 20:23:26,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:23:26,767 INFO L378 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 28 treesize of output 15 [2023-11-28 20:23:26,793 INFO L378 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 11 treesize of output 7 [2023-11-28 20:23:26,799 INFO L378 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 0 case distinctions, treesize of input 51 treesize of output 24 [2023-11-28 20:23:26,862 INFO L378 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 36 treesize of output 20 [2023-11-28 20:23:26,906 INFO L378 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 24 treesize of output 12 [2023-11-28 20:23:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:23:26,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:23:27,027 INFO L378 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 94 treesize of output 86 [2023-11-28 20:23:27,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:27,486 INFO L378 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 39 treesize of output 40 [2023-11-28 20:23:27,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:27,502 INFO L378 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 83 treesize of output 82 [2023-11-28 20:23:27,509 INFO L378 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 54 treesize of output 50 [2023-11-28 20:23:27,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:27,552 INFO L378 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 39 treesize of output 40 [2023-11-28 20:23:27,561 INFO L349 Elim1Store]: treesize reduction 16, result has 20.0 percent of original size [2023-11-28 20:23:27,561 INFO L378 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 83 treesize of output 63 [2023-11-28 20:23:27,570 INFO L378 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 8 treesize of output 4 [2023-11-28 20:23:27,833 INFO L378 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 [2023-11-28 20:23:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:23:27,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858179764] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:23:27,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:23:27,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 37 [2023-11-28 20:23:27,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445733880] [2023-11-28 20:23:27,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:23:27,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-28 20:23:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:23:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-28 20:23:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2023-11-28 20:23:27,964 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:28,565 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-11-28 20:23:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:23:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-28 20:23:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:28,566 INFO L225 Difference]: With dead ends: 70 [2023-11-28 20:23:28,566 INFO L226 Difference]: Without dead ends: 70 [2023-11-28 20:23:28,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2023-11-28 20:23:28,567 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 143 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:28,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 489 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:23:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-28 20:23:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2023-11-28 20:23:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2023-11-28 20:23:28,570 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 39 [2023-11-28 20:23:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:28,570 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2023-11-28 20:23:28,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2023-11-28 20:23:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-28 20:23:28,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:28,571 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:28,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-28 20:23:28,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-28 20:23:28,771 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:23:28,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:28,772 INFO L85 PathProgramCache]: Analyzing trace with hash 284357273, now seen corresponding path program 2 times [2023-11-28 20:23:28,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:23:28,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935576062] [2023-11-28 20:23:28,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:28,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:23:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:23:30,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935576062] [2023-11-28 20:23:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935576062] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:23:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112801714] [2023-11-28 20:23:30,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:23:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:23:30,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:23:30,656 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:23:30,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-28 20:23:30,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:23:30,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:23:30,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-28 20:23:30,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:30,980 INFO L378 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 [2023-11-28 20:23:31,067 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-28 20:23:31,067 INFO L378 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 [2023-11-28 20:23:31,140 INFO L378 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 [2023-11-28 20:23:31,213 INFO L378 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 23 treesize of output 11 [2023-11-28 20:23:31,245 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:23:31,245 INFO L378 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 34 treesize of output 33 [2023-11-28 20:23:31,392 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-11-28 20:23:31,392 INFO L378 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 [2023-11-28 20:23:31,508 INFO L378 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 50 treesize of output 33 [2023-11-28 20:23:31,555 INFO L378 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 50 treesize of output 33 [2023-11-28 20:23:31,588 INFO L378 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 50 treesize of output 33 [2023-11-28 20:23:31,832 INFO L378 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 40 [2023-11-28 20:23:31,848 INFO L378 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 15 treesize of output 11 [2023-11-28 20:23:32,200 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-28 20:23:32,200 INFO L378 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 28 treesize of output 23 [2023-11-28 20:23:32,205 INFO L378 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 9 treesize of output 7 [2023-11-28 20:23:32,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:23:32,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:23:32,227 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-28 20:23:32,227 INFO L378 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 1 case distinctions, treesize of input 92 treesize of output 43 [2023-11-28 20:23:32,303 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 20:23:32,309 INFO L378 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 0 case distinctions, treesize of input 85 treesize of output 46 [2023-11-28 20:23:32,394 INFO L378 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 93 treesize of output 61 [2023-11-28 20:23:32,488 INFO L378 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 [2023-11-28 20:23:32,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:23:32,788 INFO L378 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 62 treesize of output 29 [2023-11-28 20:23:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:32,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:23:33,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:33,538 INFO L378 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 172 treesize of output 173 [2023-11-28 20:23:33,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:33,559 INFO L378 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 348 treesize of output 347 [2023-11-28 20:23:33,568 INFO L378 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 161 treesize of output 145 [2023-11-28 20:23:51,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:51,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 114 [2023-11-28 20:23:51,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:51,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 110 [2023-11-28 20:23:51,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:51,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 110 [2023-11-28 20:23:51,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:51,864 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 207 [2023-11-28 20:23:51,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:51,896 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 207 [2023-11-28 20:23:51,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:51,929 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 110 [2023-11-28 20:23:51,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:51,953 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 211 [2023-11-28 20:23:53,486 INFO L378 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 362 treesize of output 274 [2023-11-28 20:23:53,492 INFO L378 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 278 treesize of output 234 [2023-11-28 20:23:53,577 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-11-28 20:23:53,577 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 73 [2023-11-28 20:23:53,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:53,624 INFO L378 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 19 treesize of output 21 [2023-11-28 20:23:54,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:54,213 INFO L378 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 19 treesize of output 21 [2023-11-28 20:23:56,835 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:23:56,971 INFO L349 Elim1Store]: treesize reduction 163, result has 38.5 percent of original size [2023-11-28 20:23:56,971 INFO L378 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 1911 treesize of output 1403 [2023-11-28 20:23:57,118 INFO L349 Elim1Store]: treesize reduction 27, result has 72.2 percent of original size [2023-11-28 20:23:57,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 case distinctions, treesize of input 7426 treesize of output 7188 [2023-11-28 20:23:57,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:57,370 INFO L378 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 2569 treesize of output 2541 [2023-11-28 20:23:57,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:57,497 INFO L378 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 3453 treesize of output 3225 [2023-11-28 20:23:58,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:58,538 INFO L378 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 91 treesize of output 91 [2023-11-28 20:23:59,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:59,201 INFO L378 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 27 treesize of output 27 [2023-11-28 20:23:59,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:59,314 INFO L378 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 19 [2023-11-28 20:23:59,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:23:59,780 INFO L378 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 1763 treesize of output 1743 [2023-11-28 20:27:40,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:27:40,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:27:40,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:27:40,026 INFO L378 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 290 treesize of output 244 [2023-11-28 20:27:40,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:27:40,035 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 166 [2023-11-28 20:27:40,043 INFO L378 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 162 treesize of output 146 [2023-11-28 20:27:40,048 INFO L378 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 152 treesize of output 138 [2023-11-28 20:27:58,745 WARN L293 SmtUtils]: Spent 15.54s on a formula simplification. DAG size of input: 685 DAG size of output: 564 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:28:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:28:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112801714] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:28:39,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:28:39,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 22] total 60 [2023-11-28 20:28:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608947591] [2023-11-28 20:28:39,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:28:39,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-28 20:28:39,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-28 20:28:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3373, Unknown=15, NotChecked=0, Total=3660 [2023-11-28 20:28:39,943 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 61 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 61 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:28:53,343 WARN L293 SmtUtils]: Spent 11.49s on a formula simplification. DAG size of input: 689 DAG size of output: 654 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:29:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:29:02,481 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2023-11-28 20:29:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 20:29:02,482 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 61 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-11-28 20:29:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:29:02,483 INFO L225 Difference]: With dead ends: 94 [2023-11-28 20:29:02,483 INFO L226 Difference]: Without dead ends: 94 [2023-11-28 20:29:02,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=393, Invalid=4284, Unknown=15, NotChecked=0, Total=4692 [2023-11-28 20:29:02,485 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 149 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:29:02,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 404 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-28 20:29:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-28 20:29:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2023-11-28 20:29:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.280701754385965) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-11-28 20:29:02,487 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 40 [2023-11-28 20:29:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:29:02,488 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-11-28 20:29:02,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 61 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-11-28 20:29:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-28 20:29:02,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:29:02,488 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:02,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-28 20:29:02,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-28 20:29:02,689 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:29:02,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash 284357274, now seen corresponding path program 2 times [2023-11-28 20:29:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507508509] [2023-11-28 20:29:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:05,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507508509] [2023-11-28 20:29:05,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507508509] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:29:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133894521] [2023-11-28 20:29:05,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:29:05,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:29:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:29:05,262 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:29:05,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-28 20:29:05,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:29:05,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:29:05,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-28 20:29:05,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:05,590 INFO L378 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 [2023-11-28 20:29:05,701 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-28 20:29:05,701 INFO L378 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 [2023-11-28 20:29:05,784 INFO L378 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 [2023-11-28 20:29:05,792 INFO L378 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 [2023-11-28 20:29:05,862 INFO L378 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 19 treesize of output 18 [2023-11-28 20:29:05,872 INFO L378 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 23 treesize of output 11 [2023-11-28 20:29:05,991 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:29:05,991 INFO L378 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 59 treesize of output 52 [2023-11-28 20:29:05,996 INFO L378 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 31 treesize of output 16 [2023-11-28 20:29:06,199 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-28 20:29:06,200 INFO L378 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 [2023-11-28 20:29:06,219 INFO L378 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 [2023-11-28 20:29:06,335 INFO L378 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 31 treesize of output 20 [2023-11-28 20:29:06,355 INFO L378 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 50 treesize of output 33 [2023-11-28 20:29:06,378 INFO L378 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 31 treesize of output 20 [2023-11-28 20:29:06,388 INFO L378 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 50 treesize of output 33 [2023-11-28 20:29:06,422 INFO L378 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 31 treesize of output 20 [2023-11-28 20:29:06,431 INFO L378 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 50 treesize of output 33 [2023-11-28 20:29:06,662 INFO L378 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 0 case distinctions, treesize of input 38 treesize of output 40 [2023-11-28 20:29:06,674 INFO L378 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 40 [2023-11-28 20:29:07,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:07,065 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-28 20:29:07,066 INFO L378 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 1 case distinctions, treesize of input 92 treesize of output 43 [2023-11-28 20:29:07,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:07,083 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:07,084 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:07,085 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-11-28 20:29:07,212 INFO L378 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 0 case distinctions, treesize of input 98 treesize of output 55 [2023-11-28 20:29:07,236 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 20:29:07,337 INFO L378 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 119 treesize of output 79 [2023-11-28 20:29:07,941 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:29:07,942 INFO L378 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 [2023-11-28 20:29:07,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-28 20:29:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:08,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:29:10,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:10,463 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 625 treesize of output 566 [2023-11-28 20:29:10,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:10,479 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 537 [2023-11-28 20:29:11,515 INFO L378 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 431 treesize of output 331 [2023-11-28 20:29:11,523 INFO L378 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 335 treesize of output 279 [2023-11-28 20:29:12,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:12,723 INFO L378 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 614 treesize of output 618 [2023-11-28 20:29:22,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:22,979 INFO L378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 435 treesize of output 425 [2023-11-28 20:29:22,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:23,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:23,137 INFO L349 Elim1Store]: treesize reduction 186, result has 42.2 percent of original size [2023-11-28 20:29:23,137 INFO L378 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 5 case distinctions, treesize of input 5282 treesize of output 4137 [2023-11-28 20:29:23,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:23,230 INFO L378 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 5148 treesize of output 4898 [2023-11-28 20:29:23,377 INFO L378 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 5858 treesize of output 5732 [2023-11-28 20:29:23,509 INFO L378 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 518 treesize of output 512 [2023-11-28 20:29:23,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:23,584 INFO L378 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 558 treesize of output 556 [2023-11-28 20:29:23,669 INFO L378 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 2878 treesize of output 2752 [2023-11-28 20:29:23,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:23,973 INFO L349 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2023-11-28 20:29:23,974 INFO L378 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 2070 treesize of output 2038 [2023-11-28 20:29:24,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:24,083 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 3135 treesize of output 2853 [2023-11-28 20:29:24,962 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-28 20:29:24,963 INFO L378 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 17 treesize of output 9 [2023-11-28 20:29:25,011 INFO L378 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 [2023-11-28 20:29:25,076 INFO L378 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 42 treesize of output 30 [2023-11-28 20:29:26,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:26,233 INFO L378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 225 [2023-11-28 20:29:26,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:26,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:26,360 INFO L349 Elim1Store]: treesize reduction 186, result has 42.2 percent of original size [2023-11-28 20:29:26,361 INFO L378 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 5 case distinctions, treesize of input 2699 treesize of output 2197 [2023-11-28 20:29:26,389 INFO L378 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 3386 treesize of output 3312 [2023-11-28 20:29:26,521 INFO L349 Elim1Store]: treesize reduction 48, result has 57.1 percent of original size [2023-11-28 20:29:26,522 INFO L378 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 4311 treesize of output 3966 [2023-11-28 20:29:26,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:26,623 INFO L378 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 481 treesize of output 473 [2023-11-28 20:29:26,653 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:26,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:26,676 INFO L378 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 475 treesize of output 471 [2023-11-28 20:29:26,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:26,731 INFO L378 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 1083 treesize of output 1015 [2023-11-28 20:29:26,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:26,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:26,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:26,802 INFO L378 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 374 treesize of output 370 [2023-11-28 20:29:26,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:26,834 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 701 treesize of output 655 [2023-11-28 20:29:27,186 INFO L378 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 46 treesize of output 34 [2023-11-28 20:29:27,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:27,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:27,308 INFO L349 Elim1Store]: treesize reduction 55, result has 58.3 percent of original size [2023-11-28 20:29:27,309 INFO L378 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1329 treesize of output 1047 [2023-11-28 20:29:27,464 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-11-28 20:29:27,465 INFO L378 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 6457 treesize of output 6348 [2023-11-28 20:29:27,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:27,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:27,644 INFO L349 Elim1Store]: treesize reduction 156, result has 31.0 percent of original size [2023-11-28 20:29:27,644 INFO L378 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 5 case distinctions, treesize of input 3792 treesize of output 3001 [2023-11-28 20:29:27,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:27,738 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 4363 treesize of output 4234 [2023-11-28 20:29:27,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:27,852 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 2766 treesize of output 2574 [2023-11-28 20:29:28,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:28,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:28,065 INFO L378 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 1342 treesize of output 1176 [2023-11-28 20:29:28,142 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:28,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:28,159 INFO L378 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 174 treesize of output 172 [2023-11-28 20:29:28,180 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:28,184 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:28,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:28,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 337 treesize of output 396 [2023-11-28 20:29:28,330 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:28,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:28,351 INFO L378 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 321 treesize of output 311 [2023-11-28 20:29:28,767 INFO L378 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 22 treesize of output 14 [2023-11-28 20:29:28,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:28,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:28,854 INFO L349 Elim1Store]: treesize reduction 55, result has 58.3 percent of original size [2023-11-28 20:29:28,855 INFO L378 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1319 treesize of output 1037 [2023-11-28 20:29:28,943 INFO L349 Elim1Store]: treesize reduction 41, result has 54.9 percent of original size [2023-11-28 20:29:28,944 INFO L378 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 3188 treesize of output 3166 [2023-11-28 20:29:29,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:29,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:29,131 INFO L349 Elim1Store]: treesize reduction 165, result has 27.0 percent of original size [2023-11-28 20:29:29,131 INFO L378 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 5 case distinctions, treesize of input 3764 treesize of output 2964 [2023-11-28 20:29:29,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:29,249 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7849 treesize of output 7609 [2023-11-28 20:29:29,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:29,385 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 2724 treesize of output 2534 [2023-11-28 20:29:29,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:29,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:29,599 INFO L378 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 1095 treesize of output 1081 [2023-11-28 20:29:29,641 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:29,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:29,661 INFO L378 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 1272 treesize of output 1104 [2023-11-28 20:29:29,752 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:29,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:29,767 INFO L378 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 321 treesize of output 317 [2023-11-28 20:29:29,791 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:29,796 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:29,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:29,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 305 treesize of output 343 [2023-11-28 20:29:30,264 INFO L378 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 8 treesize of output 4 [2023-11-28 20:29:30,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:30,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:30,327 INFO L349 Elim1Store]: treesize reduction 55, result has 58.3 percent of original size [2023-11-28 20:29:30,327 INFO L378 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1323 treesize of output 1041 [2023-11-28 20:29:30,418 INFO L349 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2023-11-28 20:29:30,419 INFO L378 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 3196 treesize of output 3181 [2023-11-28 20:29:30,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:30,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:30,596 INFO L349 Elim1Store]: treesize reduction 156, result has 31.0 percent of original size [2023-11-28 20:29:30,597 INFO L378 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 5 case distinctions, treesize of input 3832 treesize of output 3041 [2023-11-28 20:29:30,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:30,703 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 4396 treesize of output 4267 [2023-11-28 20:29:30,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:30,832 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 2894 treesize of output 2702 [2023-11-28 20:29:31,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:31,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:31,069 INFO L378 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 1107 treesize of output 1093 [2023-11-28 20:29:31,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:31,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:31,141 INFO L378 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 1481 treesize of output 1311 [2023-11-28 20:29:31,255 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:31,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:31,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:31,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 308 treesize of output 371 [2023-11-28 20:29:31,411 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:31,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:31,432 INFO L378 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 315 treesize of output 305 [2023-11-28 20:29:31,769 INFO L378 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 34 treesize of output 26 [2023-11-28 20:29:31,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:31,917 INFO L349 Elim1Store]: treesize reduction 57, result has 69.8 percent of original size [2023-11-28 20:29:31,918 INFO L378 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 5 case distinctions, treesize of input 5359 treesize of output 3865 [2023-11-28 20:29:32,089 INFO L349 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2023-11-28 20:29:32,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 case distinctions, treesize of input 9658 treesize of output 9530 [2023-11-28 20:29:32,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:32,388 INFO L378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 8109 treesize of output 6899 [2023-11-28 20:29:32,591 INFO L378 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 8256 treesize of output 8156 [2023-11-28 20:29:32,790 INFO L378 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 17 treesize of output 9 [2023-11-28 20:29:32,854 INFO L378 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 5560 treesize of output 5362 [2023-11-28 20:29:33,107 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:33,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:33,128 INFO L378 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 4791 treesize of output 4679 [2023-11-28 20:29:33,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:33,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:33,228 INFO L378 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 4060 treesize of output 3558 [2023-11-28 20:29:33,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:29:33,465 INFO L378 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 46 treesize of output 45 [2023-11-28 20:29:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133894521] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:29:35,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:29:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 22] total 66 [2023-11-28 20:29:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239876128] [2023-11-28 20:29:35,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:29:35,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-28 20:29:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:35,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-28 20:29:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=4162, Unknown=13, NotChecked=0, Total=4422 [2023-11-28 20:29:35,417 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 67 states, 66 states have (on average 1.803030303030303) internal successors, (119), 67 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:29:48,813 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2023-11-28 20:29:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-28 20:29:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.803030303030303) internal successors, (119), 67 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-11-28 20:29:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:29:48,815 INFO L225 Difference]: With dead ends: 88 [2023-11-28 20:29:48,815 INFO L226 Difference]: Without dead ends: 88 [2023-11-28 20:29:48,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=624, Invalid=7553, Unknown=13, NotChecked=0, Total=8190 [2023-11-28 20:29:48,818 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 188 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:29:48,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 772 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-11-28 20:29:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-28 20:29:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2023-11-28 20:29:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2023-11-28 20:29:48,821 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 40 [2023-11-28 20:29:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:29:48,821 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2023-11-28 20:29:48,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.803030303030303) internal successors, (119), 67 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2023-11-28 20:29:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-28 20:29:48,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:29:48,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:48,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-28 20:29:49,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-28 20:29:49,023 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:29:49,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:49,023 INFO L85 PathProgramCache]: Analyzing trace with hash 225130153, now seen corresponding path program 1 times [2023-11-28 20:29:49,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138924021] [2023-11-28 20:29:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138924021] [2023-11-28 20:29:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138924021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:29:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496518559] [2023-11-28 20:29:50,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:50,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:29:50,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:29:50,672 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:29:50,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-28 20:29:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:50,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-28 20:29:50,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:50,927 INFO L378 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 [2023-11-28 20:29:51,057 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-28 20:29:51,057 INFO L378 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 [2023-11-28 20:29:51,139 INFO L378 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 [2023-11-28 20:29:51,204 INFO L378 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 23 treesize of output 11 [2023-11-28 20:29:51,217 INFO L378 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 23 treesize of output 11 [2023-11-28 20:29:51,257 INFO L378 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 [2023-11-28 20:29:51,452 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-28 20:29:51,453 INFO L378 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 [2023-11-28 20:29:51,548 INFO L378 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 [2023-11-28 20:29:51,560 INFO L378 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 [2023-11-28 20:29:51,575 INFO L378 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 [2023-11-28 20:29:51,673 INFO L378 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 19 treesize of output 18 [2023-11-28 20:29:51,691 INFO L378 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 [2023-11-28 20:29:51,701 INFO L378 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 19 treesize of output 18 [2023-11-28 20:29:51,801 INFO L378 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 30 treesize of output 21 [2023-11-28 20:29:51,811 INFO L378 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 30 treesize of output 21 [2023-11-28 20:29:51,823 INFO L378 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 [2023-11-28 20:29:52,061 INFO L378 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 0 case distinctions, treesize of input 30 treesize of output 25 [2023-11-28 20:29:52,074 INFO L378 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 [2023-11-28 20:29:52,081 INFO L378 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 0 case distinctions, treesize of input 30 treesize of output 25 [2023-11-28 20:29:52,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:52,427 INFO L378 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 35 treesize of output 20 [2023-11-28 20:29:52,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:52,441 INFO L378 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 35 treesize of output 20 [2023-11-28 20:29:52,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:29:52,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:52,455 INFO L378 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 51 treesize of output 15 [2023-11-28 20:29:52,496 INFO L378 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 0 case distinctions, treesize of input 54 treesize of output 27 [2023-11-28 20:29:52,506 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 20:29:52,597 INFO L378 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 72 treesize of output 44 [2023-11-28 20:29:52,715 INFO L378 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 34 treesize of output 18 [2023-11-28 20:29:52,722 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-28 20:29:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:52,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:30:00,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:00,937 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 164 [2023-11-28 20:30:01,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:01,041 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 300 treesize of output 330 [2023-11-28 20:30:01,056 INFO L378 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 130 treesize of output 114 [2023-11-28 20:30:01,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:01,075 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 354 treesize of output 298 [2023-11-28 20:30:01,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:01,119 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 568 treesize of output 508 [2023-11-28 20:30:01,139 INFO L378 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 152 treesize of output 104 [2023-11-28 20:30:04,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:04,595 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 204 [2023-11-28 20:30:04,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:04,664 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 393 treesize of output 393 [2023-11-28 20:30:04,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:04,688 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 308 treesize of output 274 [2023-11-28 20:30:04,700 INFO L378 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 148 treesize of output 116 [2023-11-28 20:30:04,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:04,751 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 475 treesize of output 445 [2023-11-28 20:30:04,765 INFO L378 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 113 treesize of output 81 [2023-11-28 20:30:13,103 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse212 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse210 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse212 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse211 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse52 (select .cse212 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse207 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse211 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select .cse211 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse146 (= .cse8 0)) (.cse24 (= .cse8 .cse207)) (.cse9 (+ .cse52 8))) (let ((.cse2 (= .cse210 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse107 (= .cse52 0)) (.cse21 (= .cse210 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse18 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse207)) (.cse84 (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_314 Int)) (or (= v_arrayElimCell_318 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse209 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse209 .cse8 (store (select .cse209 .cse8) .cse9 v_prenex_53))) v_arrayElimCell_314) v_arrayElimCell_318)) (< v_arrayElimCell_318 0)))) (.cse3 (not .cse24)) (.cse178 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse208 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse208 .cse8 (store (select .cse208 .cse8) .cse9 v_ArrVal_2772))) v_arrayElimCell_321) v_arrayElimCell_325))))) (< v_arrayElimCell_325 0)))) (.cse34 (and (not (= .cse207 0)) .cse146)) (.cse13 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse206 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse206 .cse8 (store (select .cse206 .cse8) .cse9 v_ArrVal_2772))) v_arrayElimCell_322) v_arrayElimCell_326)) (= v_arrayElimCell_322 0))))) (let ((.cse4 (and (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse204 (let ((.cse205 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse205 .cse8 (store (select .cse205 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse204 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse204 0) v_arrayElimCell_325))))) (= v_arrayElimCell_322 0))))) (< v_arrayElimCell_325 0))) .cse13)) (.cse0 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse202 (let ((.cse203 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse203 .cse8 (store (select .cse203 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse202 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse202 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))))) (< v_arrayElimCell_325 0)))) (.cse1 (or .cse34 (let ((.cse197 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767) .cse8) .cse9 v_ArrVal_2772) v_arrayElimCell_325))) (< v_arrayElimCell_325 0))))) (and (or .cse24 (and (forall ((v_arrayElimCell_325 Int)) (or (< v_arrayElimCell_325 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse194 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse193 (store (select .cse194 .cse8) .cse9 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse193 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse194 .cse8 .cse193) v_arrayElimCell_322) v_arrayElimCell_326)))))))) (forall ((v_arrayElimCell_325 Int)) (or (< v_arrayElimCell_325 0) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse196 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse195 (store (select .cse196 .cse8) .cse9 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse195 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse196 .cse8 .cse195) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))))) .cse197)) (or .cse24 (and (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse199 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse198 (store (select .cse199 .cse8) .cse9 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse198 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse199 .cse8 .cse198) v_arrayElimCell_322) v_arrayElimCell_326)))))) (< v_arrayElimCell_326 0))) (< v_arrayElimCell_325 0))) .cse197)) (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse201 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse200 (store (select .cse201 .cse8) .cse9 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse200 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse201 .cse8 .cse200) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))))) (< v_arrayElimCell_325 0))) (or .cse24 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_325 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767) .cse8) .cse9 v_ArrVal_2772) v_arrayElimCell_325)) (< v_arrayElimCell_325 0)))))))) (.cse5 (or (and (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse189 (let ((.cse190 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse190 .cse8 (store (select .cse190 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse189 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse189 v_arrayElimCell_322) v_arrayElimCell_326))))))) (< v_arrayElimCell_325 0))) .cse178 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse191 (let ((.cse192 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse192 .cse8 (store (select .cse192 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse191 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse191 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))) (< v_arrayElimCell_325 0)))) .cse24)) (.cse10 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (let ((.cse188 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse187 (store (select .cse188 .cse8) .cse9 v_ArrVal_2772))) (or (< v_arrayElimCell_326 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse187 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse188 .cse8 .cse187) v_arrayElimCell_322) v_arrayElimCell_326)) (= v_arrayElimCell_322 0)))))) (.cse11 (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_325 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse185 (let ((.cse186 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse186 .cse8 (store (select .cse186 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse185 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse185 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0)))))))) (.cse12 (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse183 (let ((.cse184 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse184 .cse8 (store (select .cse184 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse183 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse183 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0)))))) (.cse14 (or .cse3 (and .cse13 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse181 (let ((.cse182 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse182 .cse8 (store (select .cse182 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse181 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse181 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))) (< v_arrayElimCell_325 0)))))) (.cse15 (or .cse24 (and .cse178 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse179 (let ((.cse180 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse180 .cse8 (store (select .cse180 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse179 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse179 v_arrayElimCell_322) v_arrayElimCell_326))))))))) (< v_arrayElimCell_325 0)))))) (.cse16 (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_325 Int)) (or (= v_arrayElimCell_321 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse177 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse177 .cse8 (store (select .cse177 .cse8) .cse9 v_ArrVal_2772))) v_arrayElimCell_321) v_arrayElimCell_325)) (< v_arrayElimCell_325 0))) .cse24)) (.cse17 (or .cse3 .cse13)) (.cse49 (and .cse3 (<= (+ .cse52 1) 0))) (.cse105 (or .cse24 (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_317 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse176 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse176 .cse8 (store (select .cse176 .cse8) .cse9 v_prenex_53))) 0) v_arrayElimCell_317)) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0))))) (.cse82 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse175 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse174 (store (select .cse175 .cse8) .cse9 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse174 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse175 .cse8 .cse174) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0)))))) (.cse89 (forall ((v_arrayElimCell_317 Int)) (or (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse172 (let ((.cse173 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse173 .cse8 (store (select .cse173 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse172 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse172 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))))) (.cse92 (forall ((v_arrayElimCell_317 Int)) (or (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse171 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse170 (store (select .cse171 .cse8) .cse9 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse170 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse171 .cse8 .cse170) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0)))))) (.cse83 (or (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int) (v_arrayElimCell_317 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse169 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse169 .cse8 (store (select .cse169 .cse8) .cse9 v_prenex_53))) v_arrayElimCell_313) v_arrayElimCell_317)) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0))) .cse24)) (.cse85 (forall ((v_arrayElimCell_318 Int) (v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse168 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse167 (store (select .cse168 .cse8) .cse9 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse167 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse168 .cse8 .cse167) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0)))) (.cse86 (forall ((v_arrayElimCell_318 Int) (v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse165 (let ((.cse166 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse166 .cse8 (store (select .cse166 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse165 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse165 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))) (.cse94 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse163 (let ((.cse164 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse164 .cse8 (store (select .cse164 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse163 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse163 v_arrayElimCell_314) v_arrayElimCell_318))))))))) (.cse97 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse162 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse161 (store (select .cse162 .cse8) .cse9 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse161 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse162 .cse8 .cse161) v_arrayElimCell_314) v_arrayElimCell_318)))))))))) (.cse96 (forall ((v_arrayElimCell_317 Int)) (or (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse159 (let ((.cse160 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse160 .cse8 (store (select .cse160 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse159 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse159 v_arrayElimCell_314) v_arrayElimCell_318)))))) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0)))) (.cse106 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse157 (let ((.cse158 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse158 .cse8 (store (select .cse158 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse157 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse157 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))))) (.cse102 (or .cse3 .cse84)) (.cse103 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse155 (let ((.cse156 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse156 .cse8 (store (select .cse156 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse155 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse155 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))))) (.cse99 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse153 (let ((.cse154 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse154 .cse8 (store (select .cse154 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse153 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse153 v_arrayElimCell_314) v_arrayElimCell_318))))))))))) (.cse93 (forall ((v_arrayElimCell_317 Int)) (or (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52) .cse8) .cse9 v_prenex_53) v_arrayElimCell_317))) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0)))) (.cse101 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse151 (let ((.cse152 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse152 .cse8 (store (select .cse152 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse151 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse151 v_arrayElimCell_314) v_arrayElimCell_318))))))))))) (.cse100 (forall ((v_arrayElimCell_317 Int)) (or (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse150 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse149 (store (select .cse150 .cse8) .cse9 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse149 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse150 .cse8 .cse149) v_arrayElimCell_314) v_arrayElimCell_318))))))))) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0)))) (.cse95 (forall ((v_arrayElimCell_317 Int)) (or (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse148 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse148 .cse8 (store (select .cse148 .cse8) .cse9 v_prenex_53))) 0) v_arrayElimCell_317))) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0)))) (.cse98 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse147 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse147 .cse8 (store (select .cse147 .cse8) .cse9 v_prenex_53))) v_arrayElimCell_313) v_arrayElimCell_317)))))) (.cse104 (or (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52) .cse8) .cse9 v_prenex_53) v_arrayElimCell_317)) (< v_arrayElimCell_317 0))) .cse24)) (.cse33 (and .cse21 .cse18 (not .cse146))) (.cse48 (and .cse2 (not .cse107) .cse18))) (and (or (and .cse0 .cse1 (or .cse2 .cse3 .cse4) .cse5 (or .cse3 (and (or .cse2 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (let ((.cse6 (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_ArrVal_2772))))) (or (< v_arrayElimCell_326 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 v_arrayElimCell_322) v_arrayElimCell_326)) (= v_arrayElimCell_322 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 0) v_arrayElimCell_325)))))) .cse10 .cse11 .cse12 .cse13)) .cse14 .cse15 .cse16 .cse17) .cse18) (or (let ((.cse22 (let ((.cse36 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse47 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse47 .cse8 (store (select .cse47 .cse8) .cse9 v_ArrVal_2772))) v_arrayElimCell_321) 0))))))) (and (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse35 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse35 .cse8 (store (select .cse35 .cse8) .cse9 v_ArrVal_2772))) v_arrayElimCell_321) 0)))) .cse24) (or (and .cse36 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse37 (let ((.cse38 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse38 .cse8 (store (select .cse38 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_arrayElimCell_322) v_arrayElimCell_326)))))))))) .cse24) (or (and .cse36 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse39 (let ((.cse40 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse40 .cse8 (store (select .cse40 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 v_arrayElimCell_322) v_arrayElimCell_326))))))) (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (= v_arrayElimCell_322 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse41 (let ((.cse42 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse42 .cse8 (store (select .cse42 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_arrayElimCell_322) v_arrayElimCell_326)))))))))) .cse24) (or .cse3 (and (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (= v_arrayElimCell_322 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse43 (let ((.cse44 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse44 .cse8 (store (select .cse44 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 v_arrayElimCell_322) v_arrayElimCell_326))))))))) .cse13)) (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (= v_arrayElimCell_322 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse45 (let ((.cse46 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse46 .cse8 (store (select .cse46 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 v_arrayElimCell_322) v_arrayElimCell_326))))))))))) .cse17)))) (and (or .cse2 (and (or .cse3 (and (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse19 (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse20 .cse8 (store (select .cse20 .cse8) .cse9 v_ArrVal_2772))))) (or (= (select (select .cse19 0) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))) .cse13)) (or .cse21 .cse22))) (or .cse18 .cse22) (or (let ((.cse23 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767) .cse8) .cse9 v_ArrVal_2772) 0))))) (and (or .cse23 .cse24) (or (and .cse23 (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse25 (store (select .cse26 .cse8) .cse9 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse26 .cse8 .cse25) v_arrayElimCell_322) v_arrayElimCell_326))))))))) .cse24) (or .cse24 (and .cse23 (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse27 (store (select .cse28 .cse8) .cse9 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse28 .cse8 .cse27) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse30 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse29 (store (select .cse30 .cse8) .cse9 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse30 .cse8 .cse29) v_arrayElimCell_322) v_arrayElimCell_326)))))))) (forall ((v_arrayElimCell_326 Int)) (or (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse31 (store (select .cse32 .cse8) .cse9 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse32 .cse8 .cse31) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))) (< v_arrayElimCell_326 0))) .cse17)) .cse33 .cse34))) .cse48) (or (and (or .cse49 (let ((.cse69 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse79 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse79 .cse8 (store (select .cse79 .cse8) .cse9 v_ArrVal_2772))) v_arrayElimCell_321) .cse52))))))) (let ((.cse60 (or (and .cse69 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse75 (let ((.cse76 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse76 .cse8 (store (select .cse76 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse75 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse75 v_arrayElimCell_321) .cse52))))) (= v_arrayElimCell_322 0))))) (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse77 (let ((.cse78 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse78 .cse8 (store (select .cse78 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse77 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse77 v_arrayElimCell_321) .cse52)))))))) .cse24)) (.cse61 (or .cse24 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse74 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse74 .cse8 (store (select .cse74 .cse8) .cse9 v_ArrVal_2772))) v_arrayElimCell_321) .cse52)))))) (.cse62 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse72 (let ((.cse73 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse73 .cse8 (store (select .cse73 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse72 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse72 v_arrayElimCell_321) .cse52))))) (= v_arrayElimCell_322 0)))))))) (.cse63 (or (and .cse69 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse70 (let ((.cse71 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse71 .cse8 (store (select .cse71 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse70 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse70 v_arrayElimCell_321) .cse52)))))))))) .cse24)) (.cse64 (or .cse3 (and (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse67 (let ((.cse68 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse68 .cse8 (store (select .cse68 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_321) .cse52))))) (= v_arrayElimCell_322 0))))) .cse13)))) (and (or (let ((.cse50 (forall ((v_ArrVal_2767 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767) .cse8) .cse52))))) (and (or .cse50 .cse24) (or .cse24 (and .cse50 (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse53 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse51 (select .cse53 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse53 .cse8 (store .cse51 .cse9 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse55 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse54 (select .cse55 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse54 .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse55 .cse8 (store .cse54 .cse9 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))))) (or .cse24 (and .cse50 (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse57 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse56 (select .cse57 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse57 .cse8 (store .cse56 .cse9 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))))))) (forall ((v_arrayElimCell_326 Int)) (or (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse59 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse58 (select .cse59 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse59 .cse8 (store .cse58 .cse9 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))) (< v_arrayElimCell_326 0))) .cse17)) .cse34) (or (and .cse60 .cse61 .cse62 .cse63 .cse64 .cse17) .cse18) (or .cse2 (and .cse60 .cse61 (or .cse3 (and .cse13 (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse65 (let ((.cse66 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse66 .cse8 (store (select .cse66 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 0) .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))))) .cse62 .cse63 .cse64 .cse17)))))) (or .cse2 (and (or .cse3 .cse4) .cse0 .cse1 .cse5 (or .cse3 (and .cse10 .cse11 .cse12 .cse13 (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse80 (let ((.cse81 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse81 .cse8 (store (select .cse81 .cse8) .cse9 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 0) v_arrayElimCell_325))))) (= v_arrayElimCell_322 0))))))) .cse14 .cse15 .cse16 .cse17))) .cse21) (or (and .cse82 .cse83 (or .cse3 (and .cse84 .cse85 .cse86 (or .cse2 (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_314 Int) (v_arrayElimCell_317 Int)) (let ((.cse87 (let ((.cse88 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse88 .cse8 (store (select .cse88 .cse8) .cse9 v_prenex_53))))) (or (= v_arrayElimCell_318 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse87 0) v_arrayElimCell_317)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse87 v_arrayElimCell_314) v_arrayElimCell_318)) (< v_arrayElimCell_318 0))))))) (or .cse3 (and .cse89 .cse84 (or .cse2 (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_314 Int) (v_arrayElimCell_317 Int)) (let ((.cse90 (let ((.cse91 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse91 .cse8 (store (select .cse91 .cse8) .cse9 v_prenex_53))))) (or (= v_arrayElimCell_318 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse90 0) v_arrayElimCell_317)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse90 v_arrayElimCell_314) v_arrayElimCell_318)) (< v_arrayElimCell_317 0) (< v_arrayElimCell_318 0))))) .cse92)) (or (and .cse93 .cse94 (or .cse2 (and .cse95 .cse96)) .cse97 .cse98) .cse24) (or .cse24 (and .cse99 .cse93 .cse100 (or .cse2 (and .cse101 .cse95)) .cse98)) .cse102 .cse103 .cse104 (or .cse2 (and .cse105 .cse106))) .cse18) (or (and (or .cse49 (and .cse3 .cse107) (let ((.cse110 (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse134 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse134 .cse8 (store (select .cse134 .cse8) .cse9 v_prenex_53))) v_arrayElimCell_313) .cse52))))) (let ((.cse117 (forall ((v_prenex_52 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52) .cse8) .cse52)))) (.cse127 (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse132 (let ((.cse133 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse133 .cse8 (store (select .cse133 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse132 v_arrayElimCell_313) .cse52)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse132 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))) (.cse128 (or .cse110 .cse24)) (.cse111 (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse131 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse131 .cse8 (store (select .cse131 .cse8) .cse9 v_prenex_53))) 0) .cse52))))) (and (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse109 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse108 (select .cse109 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse108 .cse52)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse109 .cse8 (store .cse108 .cse9 v_prenex_53)) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0))) (or .cse24 (let ((.cse114 (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse118 (let ((.cse119 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse119 .cse8 (store (select .cse119 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse118 v_arrayElimCell_313) .cse52)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse118 v_arrayElimCell_314) v_arrayElimCell_318)))))))))) (and (or .cse2 (and .cse110 .cse111 (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse112 (let ((.cse113 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse113 .cse8 (store (select .cse113 .cse8) .cse9 v_prenex_53))))) (or (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse112 v_arrayElimCell_314) v_arrayElimCell_318))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse112 0) .cse52))))))) .cse114)) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse116 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse115 (select .cse116 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse115 .cse52)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse116 .cse8 (store .cse115 .cse9 v_prenex_53)) v_arrayElimCell_314) v_arrayElimCell_318))))))))) .cse117 (or .cse18 (and .cse110 .cse114))))) (or .cse117 .cse24) (or (let ((.cse120 (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse125 (let ((.cse126 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse126 .cse8 (store (select .cse126 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse125 v_arrayElimCell_313) .cse52)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse125 v_arrayElimCell_314) v_arrayElimCell_318)))))))) (and (or (and .cse110 .cse120) .cse18) .cse117 (or .cse2 (and (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse121 (let ((.cse122 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse122 .cse8 (store (select .cse122 .cse8) .cse9 v_prenex_53))))) (or (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse121 v_arrayElimCell_314) v_arrayElimCell_318))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse121 0) .cse52))))) .cse110 .cse111 .cse120)) (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse124 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse123 (select .cse124 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse123 .cse52)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse124 .cse8 (store .cse123 .cse9 v_prenex_53)) v_arrayElimCell_314) v_arrayElimCell_318))))))))) .cse24) .cse102 (or .cse18 (and .cse127 .cse128)) (or .cse2 (and (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse129 (let ((.cse130 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse130 .cse8 (store (select .cse130 .cse8) .cse9 v_prenex_53))))) (or (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse129 v_arrayElimCell_314) v_arrayElimCell_318))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse129 0) .cse52))))) (< v_arrayElimCell_318 0))) .cse127 .cse128 (or .cse24 .cse111))))))) (or (and .cse105 .cse82 (or .cse3 (and .cse89 .cse84 (forall ((v_arrayElimCell_317 Int)) (or (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse135 (let ((.cse136 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse136 .cse8 (store (select .cse136 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse135 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse135 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0))))) .cse92)) .cse83 (or .cse3 (and .cse84 (forall ((v_arrayElimCell_318 Int) (v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse137 (let ((.cse138 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse138 .cse8 (store (select .cse138 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse137 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse137 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0))) .cse85 .cse86)) (or .cse24 (and .cse93 .cse94 .cse95 .cse97 .cse96 .cse98)) .cse106 .cse102 .cse103 (or .cse24 (and .cse99 .cse93 .cse101 .cse100 .cse95 .cse98)) .cse104) .cse2)) .cse21) (or .cse3 (let ((.cse139 (forall ((v_arrayElimCell_318 Int)) (or (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse144 (let ((.cse145 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse145 .cse8 (store (select .cse145 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse144 v_arrayElimCell_313) 0)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse144 v_arrayElimCell_314) v_arrayElimCell_318)))))) (= v_arrayElimCell_318 0) (< v_arrayElimCell_318 0))))) (and (or (and .cse84 .cse139) .cse18) (or .cse2 (and (or .cse18 .cse139) (or .cse21 .cse139) .cse84 (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse140 (let ((.cse141 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse141 .cse8 (store (select .cse141 .cse8) .cse9 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse140 0) 0)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse140 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0))))) (or .cse33 (and (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse143 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse142 (store (select .cse143 .cse8) .cse9 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse142 0)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse143 .cse8 .cse142) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0))) .cse84)))) .cse48))))))) (< .cse210 0)))) is different from true [2023-11-28 20:30:21,293 INFO L378 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 1163 treesize of output 875 [2023-11-28 20:30:21,332 INFO L378 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 879 treesize of output 767 [2023-11-28 20:30:21,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:21,683 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-11-28 20:30:21,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:21,704 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2023-11-28 20:30:21,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:21,737 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-11-28 20:30:21,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:21,757 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2023-11-28 20:30:21,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:21,792 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-11-28 20:30:21,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:21,947 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-11-28 20:30:22,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:22,055 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-11-28 20:30:22,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:22,134 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-11-28 20:30:22,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:22,213 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2023-11-28 20:30:22,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:22,502 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-11-28 20:30:22,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:22,524 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2023-11-28 20:30:30,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0))) (let ((.cse9 (not .cse18)) (.cse8 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse0 (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (not (= (select |c_#valid| 0) 0)))) (and (or .cse0 (and (or .cse1 (forall ((v_ArrVal_2767 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| 0 v_ArrVal_2767) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) .cse2) (or .cse1 (forall ((v_ArrVal_2767 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_ArrVal_2767) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (or .cse0 (and (or .cse1 (forall ((v_prenex_69 Int) (v_prenex_68 Int) (v_prenex_67 (Array Int Int)) (v_prenex_70 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (let ((.cse3 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_67))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= v_prenex_69 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_prenex_68)) v_prenex_69) v_prenex_70)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< v_prenex_70 0)))))) (or (forall ((v_prenex_69 Int) (v_prenex_68 Int) (v_prenex_67 (Array Int Int)) (v_prenex_70 Int)) (let ((.cse7 (store |c_#memory_int#2| 0 v_prenex_67))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= v_prenex_69 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse6 .cse5 v_prenex_68)) v_prenex_69) v_prenex_70)) (< v_prenex_70 0))))) .cse2))) (or (forall ((v_arrayElimArr_47 (Array Int Int)) (v_prenex_69 Int) (v_prenex_70 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_47) v_prenex_69) v_prenex_70)) (= v_prenex_69 0) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_47 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< v_prenex_70 0))) .cse8) (or (and (forall ((v_prenex_103 Int) (v_prenex_100 Int) (v_arrayElimArr_40 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_40) v_prenex_103) v_prenex_100)) (< v_prenex_100 0) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_40 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= v_prenex_100 0))) (forall ((v_prenex_105 Int) (v_arrayElimArr_39 (Array Int Int)) (v_prenex_108 Int)) (or (= v_prenex_105 0) (< v_prenex_105 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_39) v_prenex_108) v_prenex_105))))) .cse8) (or .cse8 (and (forall ((v_arrayElimCell_318 Int) (v_arrayElimArr_48 (Array Int Int)) (v_arrayElimCell_314 Int)) (or (= v_arrayElimCell_318 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_48) v_arrayElimCell_314) v_arrayElimCell_318)) (< v_arrayElimCell_318 0))) (forall ((v_prenex_59 Int) (v_prenex_56 Int) (v_arrayElimArr_49 (Array Int Int))) (or (= v_prenex_56 0) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_49 0)) (< v_prenex_56 0) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_49) v_prenex_59) v_prenex_56) |c_ULTIMATE.start_main_~data~0#1|)))) .cse9) (or .cse0 (and (or .cse1 (and (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse11 (store |c_#memory_int#2| 0 v_prenex_60))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse5 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)) (= v_arrayElimCell_322 0))))) (forall ((v_prenex_66 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| 0 v_prenex_66) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (let ((.cse13 (store |c_#memory_int#2| 0 v_prenex_61))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse12 .cse5 v_prenex_62)) v_prenex_63) v_prenex_64))))))) .cse2) (or .cse1 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse15 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_60))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= v_arrayElimCell_322 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse14 .cse5 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_66 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_66) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (let ((.cse17 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_61))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse16 .cse5 v_prenex_62)) v_prenex_63) v_prenex_64)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))))))) (or (forall ((v_arrayElimArr_46 (Array Int Int)) (v_prenex_74 Int) (v_prenex_73 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_46) v_prenex_73) v_prenex_74)) (< v_prenex_74 0) (= v_prenex_73 0))) .cse8) (or .cse18 (and (or .cse0 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_110 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_110) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_104 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_104) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (or .cse8 (forall ((v_prenex_105 Int) (v_arrayElimArr_43 (Array Int Int)) (v_prenex_108 Int)) (or (= v_prenex_105 0) (< v_prenex_105 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_43) v_prenex_108) v_prenex_105))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_112 Int) (v_prenex_111 Int) (v_prenex_99 (Array Int Int)) (v_prenex_109 Int)) (let ((.cse20 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_99))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= v_prenex_109 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse19 .cse5 v_prenex_111)) v_prenex_112) v_prenex_109)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (forall ((v_prenex_117 Int) (v_prenex_98 (Array Int Int)) (v_prenex_118 Int) (v_prenex_119 Int)) (let ((.cse22 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_98))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse21 .cse5 v_prenex_118)) v_prenex_119) v_prenex_117)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_103 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_101 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_101))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< v_prenex_100 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse23 .cse5 v_prenex_102)) v_prenex_103) v_prenex_100)) (= v_prenex_100 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_120 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_120) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (or (and (forall ((v_prenex_105 Int) (v_arrayElimArr_41 (Array Int Int)) (v_prenex_108 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_41) v_prenex_108) v_prenex_105)) (= v_prenex_105 0) (< v_prenex_105 0))) (forall ((v_prenex_103 Int) (v_prenex_100 Int) (v_arrayElimArr_42 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_42) v_prenex_103) v_prenex_100)) (< v_prenex_100 0) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_42 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= v_prenex_100 0)))) .cse8))) (or .cse9 (and (or .cse1 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int) (v_prenex_93 Int)) (let ((.cse26 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_90))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse25 8 v_prenex_91)) v_prenex_92) v_prenex_93)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_84 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_84) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_79 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_79) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_94 (Array Int Int)) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_97 Int)) (let ((.cse27 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_94))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< v_prenex_97 0) (= v_prenex_96 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse28 8 v_prenex_95)) v_prenex_96) v_prenex_97)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 0)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_80 (Array Int Int)) (v_prenex_81 Int) (v_prenex_83 Int) (v_prenex_82 Int)) (let ((.cse29 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_80))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= v_prenex_82 0) (= (select (select (store .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse30 8 v_prenex_81)) v_prenex_82) v_prenex_83) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 0)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (forall ((v_prenex_89 Int) (v_prenex_86 (Array Int Int)) (v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse31 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_86))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< v_prenex_89 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse32 8 v_prenex_87)) v_prenex_88) v_prenex_89)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_85 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_85) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) (or .cse8 (forall ((v_prenex_114 Int) (v_arrayElimArr_45 (Array Int Int)) (v_prenex_115 Int)) (or (= v_prenex_114 0) (< v_prenex_115 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_45) v_prenex_114) v_prenex_115))))))) (or (and (forall ((v_prenex_94 (Array Int Int)) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_97 Int)) (let ((.cse33 (store |c_#memory_int#2| 0 v_prenex_94))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< v_prenex_97 0) (= v_prenex_96 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse34 8 v_prenex_95)) v_prenex_96) v_prenex_97)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 0)))))) (or .cse1 (and (forall ((v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int) (v_prenex_93 Int)) (let ((.cse35 (store |c_#memory_int#2| 0 v_prenex_90))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse36 8 v_prenex_91)) v_prenex_92) v_prenex_93)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 0)))))) (forall ((v_prenex_80 (Array Int Int)) (v_prenex_81 Int) (v_prenex_83 Int) (v_prenex_82 Int)) (let ((.cse38 (store |c_#memory_int#2| 0 v_prenex_80))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= v_prenex_82 0) (= (select .cse37 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse37 8 v_prenex_81)) v_prenex_82) v_prenex_83)))))) (forall ((v_prenex_84 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| 0 v_prenex_84) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) (or .cse1 (forall ((v_prenex_85 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| 0 v_prenex_85) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (or (forall ((v_arrayElimArr_44 (Array Int Int)) (v_prenex_114 Int) (v_prenex_115 Int)) (or (= v_prenex_114 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| 0 v_arrayElimArr_44) v_prenex_114) v_prenex_115)) (< v_prenex_115 0))) (not .cse1)) (or .cse1 (and (forall ((v_prenex_79 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| 0 v_prenex_79) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (forall ((v_prenex_89 Int) (v_prenex_86 (Array Int Int)) (v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse39 (store |c_#memory_int#2| 0 v_prenex_86))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< v_prenex_89 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse40 8 v_prenex_87)) v_prenex_88) v_prenex_89)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 0))))))))) .cse2))) (or .cse0 (and (or .cse1 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_78 Int) (v_prenex_75 (Array Int Int)) (v_prenex_77 Int) (v_prenex_76 Int)) (let ((.cse41 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_75))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse42 .cse5 v_prenex_76)) v_prenex_77) v_prenex_78)) (< v_prenex_78 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_65 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_65) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))))) (or .cse1 (and (forall ((v_prenex_65 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| 0 v_prenex_65) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (forall ((v_prenex_78 Int) (v_prenex_75 (Array Int Int)) (v_prenex_77 Int) (v_prenex_76 Int)) (let ((.cse44 (store |c_#memory_int#2| 0 v_prenex_75))) (let ((.cse43 (select .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< v_prenex_78 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse43 .cse5 v_prenex_76)) v_prenex_77) v_prenex_78))))))) .cse2)))))) is different from false [2023-11-28 20:30:39,354 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0))) (let ((.cse12 (not .cse23)) (.cse6 (not (= (select |c_#valid| 0) 0))) (.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse13 (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse9 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse14 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (or (and (or (and (forall ((v_prenex_94 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_prenex_96 Int) (v_ArrVal_2752 Int) (v_prenex_95 Int) (v_prenex_97 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_94) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< v_prenex_97 0) (= v_prenex_96 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_94) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 8 v_prenex_95)) v_prenex_96) v_prenex_97))))) (or (not .cse2) (forall ((v_arrayElimArr_44 (Array Int Int)) (v_prenex_114 Int) (v_prenex_115 Int) (v_ArrVal_2753 (Array Int Int))) (or (= v_prenex_114 0) (< v_prenex_115 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_arrayElimArr_44) v_prenex_114) v_prenex_115))))) (or .cse2 (and (forall ((v_prenex_80 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (v_prenex_81 Int) (v_prenex_83 Int) (v_prenex_82 Int)) (let ((.cse3 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_80) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= v_prenex_82 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_80) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 8 v_prenex_81)) v_prenex_82) v_prenex_83)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 0))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_prenex_84 (Array Int Int)) (v_ArrVal_2752 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_84) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int) (v_prenex_93 Int)) (let ((.cse4 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_90) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_90) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 8 v_prenex_91)) v_prenex_92) v_prenex_93))))))) (or .cse2 (forall ((v_ArrVal_2753 (Array Int Int)) (v_prenex_85 (Array Int Int)) (v_ArrVal_2752 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_85) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (or (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (v_prenex_79 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_79) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (forall ((v_prenex_89 Int) (v_prenex_86 (Array Int Int)) (v_prenex_88 Int) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (v_prenex_87 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_86) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< v_prenex_89 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_86) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 8 v_prenex_87)) v_prenex_88) v_prenex_89)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 0)))))) .cse2)) .cse6) (or .cse2 (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_80 (Array Int Int)) (v_prenex_81 Int) (v_prenex_83 Int) (v_prenex_82 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_80) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_80) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 8 v_prenex_81)) v_prenex_82) v_prenex_83)) (= v_prenex_82 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 0))))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_84 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_84) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_79 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_79) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_94 (Array Int Int)) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_97 Int)) (let ((.cse8 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_94) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< v_prenex_97 0) (= v_prenex_96 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_94) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 8 v_prenex_95)) v_prenex_96) v_prenex_97)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 0))))))) (or .cse9 (forall ((v_prenex_114 Int) (v_prenex_115 Int) (v_arrayElimArr_45 (Array Int Int)) (v_ArrVal_2753 (Array Int Int))) (or (= v_prenex_114 0) (< v_prenex_115 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_45) v_prenex_114) v_prenex_115))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_85 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_85) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_89 Int) (v_prenex_86 (Array Int Int)) (v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse10 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_86) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< v_prenex_89 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_86) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 8 v_prenex_87)) v_prenex_88) v_prenex_89))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int) (v_prenex_93 Int)) (let ((.cse11 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 8 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_90) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_90) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse11 8 v_prenex_91)) v_prenex_92) v_prenex_93)))))))))) .cse12) (or .cse9 .cse12 (and (forall ((v_arrayElimCell_318 Int) (v_arrayElimArr_48 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_314 Int)) (or (= v_arrayElimCell_318 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_48) v_arrayElimCell_314) v_arrayElimCell_318)) (< v_arrayElimCell_318 0))) (forall ((v_prenex_59 Int) (v_prenex_56 Int) (v_ArrVal_2753 (Array Int Int)) (v_arrayElimArr_49 (Array Int Int))) (or (= v_prenex_56 0) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_49 0)) (< v_prenex_56 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_49) v_prenex_59) v_prenex_56)))))) (or (and (forall ((v_prenex_103 Int) (v_ArrVal_2753 (Array Int Int)) (v_prenex_100 Int) (v_arrayElimArr_40 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_40) v_prenex_103) v_prenex_100)) (< v_prenex_100 0) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_40 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= v_prenex_100 0))) (forall ((v_prenex_105 Int) (v_ArrVal_2753 (Array Int Int)) (v_arrayElimArr_39 (Array Int Int)) (v_prenex_108 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_39) v_prenex_108) v_prenex_105)) (= v_prenex_105 0) (< v_prenex_105 0)))) .cse9) (or .cse9 (forall ((v_arrayElimArr_47 (Array Int Int)) (v_prenex_69 Int) (v_ArrVal_2753 (Array Int Int)) (v_prenex_70 Int)) (or (= v_prenex_69 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_47) v_prenex_69) v_prenex_70)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_47 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< v_prenex_70 0)))) (or .cse13 (and (or .cse2 (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_65 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_65) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_78 Int) (v_prenex_75 (Array Int Int)) (v_prenex_77 Int) (v_prenex_76 Int)) (let ((.cse15 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_75) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_75) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse15 .cse14 v_prenex_76)) v_prenex_77) v_prenex_78)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< v_prenex_78 0)))))))) (or (and (forall ((v_prenex_78 Int) (v_prenex_75 (Array Int Int)) (v_prenex_77 Int) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (v_prenex_76 Int)) (let ((.cse16 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_75) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_75) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse16 .cse14 v_prenex_76)) v_prenex_77) v_prenex_78)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< v_prenex_78 0)))) (forall ((v_prenex_65 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_65) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) .cse2 .cse6))) (or .cse13 (and (or .cse2 (forall ((v_ArrVal_2753 (Array Int Int)) (v_prenex_69 Int) (v_prenex_68 Int) (v_ArrVal_2752 Int) (v_prenex_67 (Array Int Int)) (v_prenex_70 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (let ((.cse17 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_67) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_67) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse17 .cse14 v_prenex_68)) v_prenex_69) v_prenex_70)) (= v_prenex_69 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< v_prenex_70 0))))) (or (forall ((v_ArrVal_2753 (Array Int Int)) (v_prenex_69 Int) (v_prenex_68 Int) (v_ArrVal_2752 Int) (v_prenex_67 (Array Int Int)) (v_prenex_70 Int)) (let ((.cse18 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_67) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= v_prenex_69 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_67) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse18 .cse14 v_prenex_68)) v_prenex_69) v_prenex_70) |c_ULTIMATE.start_main_~data~0#1|) (< v_prenex_70 0)))) .cse6))) (or (and (or .cse2 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_ArrVal_2767) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) .cse6) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_ArrVal_2767) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) .cse2)) .cse13) (or .cse13 (and (or .cse2 (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (v_prenex_66 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_66) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_prenex_63 Int) (v_ArrVal_2752 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (let ((.cse19 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_61) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_61) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse19 .cse14 v_prenex_62)) v_prenex_63) v_prenex_64)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_ArrVal_2752 Int) (v_arrayElimCell_326 Int)) (let ((.cse20 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_60) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) 0 v_prenex_60) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse20 .cse14 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)) (= v_arrayElimCell_322 0))))) .cse6) (or .cse2 (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse21 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_60) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= v_arrayElimCell_322 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_60) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse21 .cse14 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (let ((.cse22 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_61) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_61) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse22 .cse14 v_prenex_62)) v_prenex_63) v_prenex_64))))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_66 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_66) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (or (forall ((v_arrayElimArr_46 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_prenex_74 Int) (v_prenex_73 Int)) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_46) v_prenex_73) v_prenex_74) |c_ULTIMATE.start_main_~data~0#1|) (< v_prenex_74 0) (= v_prenex_73 0))) .cse9) (or .cse23 (and (or .cse9 (and (forall ((v_prenex_103 Int) (v_ArrVal_2753 (Array Int Int)) (v_prenex_100 Int) (v_arrayElimArr_42 (Array Int Int))) (or (< v_prenex_100 0) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_42 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_42) v_prenex_103) v_prenex_100)) (= v_prenex_100 0))) (forall ((v_prenex_105 Int) (v_ArrVal_2753 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int)) (v_prenex_108 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_41) v_prenex_108) v_prenex_105)) (= v_prenex_105 0) (< v_prenex_105 0))))) (or .cse13 (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_112 Int) (v_prenex_111 Int) (v_prenex_99 (Array Int Int)) (v_prenex_109 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_99) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= v_prenex_109 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_99) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse24 .cse14 v_prenex_111)) v_prenex_112) v_prenex_109))))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_110 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_110) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (or .cse9 (forall ((v_prenex_105 Int) (v_arrayElimArr_43 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_prenex_108 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_43) v_prenex_108) v_prenex_105)) (= v_prenex_105 0) (< v_prenex_105 0)))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (forall ((v_prenex_103 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_101 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_101) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_101) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse25 .cse14 v_prenex_102)) v_prenex_103) v_prenex_100)) (< v_prenex_100 0) (= v_prenex_100 0)))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (forall ((v_prenex_117 Int) (v_prenex_98 (Array Int Int)) (v_prenex_118 Int) (v_prenex_119 Int)) (let ((.cse26 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_98) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_98) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse26 .cse14 v_prenex_118)) v_prenex_119) v_prenex_117))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_120 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_120) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_39|) (forall ((v_prenex_104 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse14 v_ArrVal_2752)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2753) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| v_prenex_104) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))))) is different from false [2023-11-28 20:30:52,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:52,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-11-28 20:30:52,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:52,386 INFO L378 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 30 treesize of output 22 [2023-11-28 20:30:52,391 INFO L378 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 [2023-11-28 20:30:52,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:52,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-11-28 20:30:52,424 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:52,427 INFO L378 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 30 treesize of output 22 [2023-11-28 20:30:52,443 INFO L378 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 [2023-11-28 20:30:52,470 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-28 20:30:52,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 1 [2023-11-28 20:30:52,517 INFO L349 Elim1Store]: treesize reduction 150, result has 0.7 percent of original size [2023-11-28 20:30:52,518 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 513 treesize of output 1 [2023-11-28 20:30:52,524 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:52,567 INFO L349 Elim1Store]: treesize reduction 150, result has 0.7 percent of original size [2023-11-28 20:30:52,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 269 treesize of output 1 [2023-11-28 20:30:52,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:52,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-11-28 20:30:52,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:52,601 INFO L378 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 30 treesize of output 22 [2023-11-28 20:30:52,628 INFO L378 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 [2023-11-28 20:30:52,772 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2023-11-28 20:30:52,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 513 treesize of output 411 [2023-11-28 20:30:52,789 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:52,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:52,805 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 279 [2023-11-28 20:30:52,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:52,841 INFO L378 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 265 treesize of output 261 [2023-11-28 20:30:52,863 INFO L378 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 124 treesize of output 120 [2023-11-28 20:30:52,940 INFO L378 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 6 treesize of output 4 [2023-11-28 20:30:53,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:53,487 INFO L378 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 199 treesize of output 197 [2023-11-28 20:30:53,703 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2023-11-28 20:30:53,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 513 treesize of output 411 [2023-11-28 20:30:53,727 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:53,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:53,747 INFO L378 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 1 case distinctions, treesize of input 285 treesize of output 279 [2023-11-28 20:30:53,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:53,779 INFO L378 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 265 treesize of output 261 [2023-11-28 20:30:53,799 INFO L378 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 124 treesize of output 120 [2023-11-28 20:30:54,069 INFO L378 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 [2023-11-28 20:30:54,288 INFO L378 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 17 treesize of output 13 [2023-11-28 20:30:54,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:54,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 38 [2023-11-28 20:30:54,345 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:54,348 INFO L378 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 30 treesize of output 22 [2023-11-28 20:30:54,364 INFO L378 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 [2023-11-28 20:30:54,496 INFO L349 Elim1Store]: treesize reduction 72, result has 45.9 percent of original size [2023-11-28 20:30:54,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 461 treesize of output 387 [2023-11-28 20:30:54,515 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:54,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:54,531 INFO L378 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 1 case distinctions, treesize of input 265 treesize of output 259 [2023-11-28 20:30:54,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:54,560 INFO L378 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 241 treesize of output 237 [2023-11-28 20:30:54,576 INFO L378 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 222 treesize of output 218 [2023-11-28 20:30:54,966 INFO L378 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 [2023-11-28 20:30:55,259 INFO L378 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 17 treesize of output 13 [2023-11-28 20:30:55,388 INFO L349 Elim1Store]: treesize reduction 72, result has 45.9 percent of original size [2023-11-28 20:30:55,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 225 [2023-11-28 20:30:55,402 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:55,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:55,416 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 259 [2023-11-28 20:30:55,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:55,448 INFO L378 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 241 treesize of output 237 [2023-11-28 20:30:55,469 INFO L378 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 222 treesize of output 218 [2023-11-28 20:30:55,815 INFO L378 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 [2023-11-28 20:30:55,975 INFO L378 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 17 treesize of output 13 [2023-11-28 20:30:56,017 INFO L378 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 52 treesize of output 48 [2023-11-28 20:30:56,024 INFO L378 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 24 treesize of output 22 [2023-11-28 20:30:56,030 INFO L378 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 46 treesize of output 42 [2023-11-28 20:30:56,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:56,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 38 [2023-11-28 20:30:56,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:56,089 INFO L378 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 30 treesize of output 22 [2023-11-28 20:30:56,106 INFO L378 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 [2023-11-28 20:30:56,262 INFO L349 Elim1Store]: treesize reduction 72, result has 45.9 percent of original size [2023-11-28 20:30:56,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1793 treesize of output 1359 [2023-11-28 20:30:56,287 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:56,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:56,303 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 259 [2023-11-28 20:30:56,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:56,331 INFO L378 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 241 treesize of output 237 [2023-11-28 20:30:56,350 INFO L378 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 112 treesize of output 108 [2023-11-28 20:30:56,607 INFO L378 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 [2023-11-28 20:30:56,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:56,750 INFO L378 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 79 treesize of output 81 [2023-11-28 20:30:56,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:56,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 38 [2023-11-28 20:30:56,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:56,947 INFO L378 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 30 treesize of output 22 [2023-11-28 20:30:56,966 INFO L378 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 [2023-11-28 20:30:57,113 INFO L349 Elim1Store]: treesize reduction 72, result has 45.9 percent of original size [2023-11-28 20:30:57,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 905 treesize of output 711 [2023-11-28 20:30:57,138 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:57,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:57,157 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 206 [2023-11-28 20:30:57,173 INFO L378 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 53 treesize of output 49 [2023-11-28 20:30:57,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:57,206 INFO L378 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 237 treesize of output 233 [2023-11-28 20:30:57,438 INFO L378 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 [2023-11-28 20:30:57,903 INFO L378 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 17 treesize of output 13 [2023-11-28 20:30:57,928 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:57,931 INFO L378 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 22 treesize of output 18 [2023-11-28 20:30:57,939 INFO L378 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 9 treesize of output 7 [2023-11-28 20:30:57,975 INFO L349 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2023-11-28 20:30:57,975 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 1793 treesize of output 1 [2023-11-28 20:30:57,984 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-28 20:30:57,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 1 [2023-11-28 20:30:57,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:58,038 INFO L349 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2023-11-28 20:30:58,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 1 [2023-11-28 20:30:58,049 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-28 20:30:58,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 1 [2023-11-28 20:30:58,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:58,099 INFO L349 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2023-11-28 20:30:58,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 1 [2023-11-28 20:30:58,154 INFO L349 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2023-11-28 20:30:58,154 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 1 [2023-11-28 20:30:58,164 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-28 20:30:58,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 1 [2023-11-28 20:30:58,176 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-28 20:30:58,181 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-28 20:30:58,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:58,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-11-28 20:30:58,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:58,232 INFO L378 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 30 treesize of output 22 [2023-11-28 20:30:58,247 INFO L378 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 [2023-11-28 20:30:58,417 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2023-11-28 20:30:58,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1989 treesize of output 1431 [2023-11-28 20:30:58,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:58,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:58,462 INFO L378 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 1 case distinctions, treesize of input 232 treesize of output 226 [2023-11-28 20:30:58,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:58,495 INFO L378 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 1 case distinctions, treesize of input 265 treesize of output 261 [2023-11-28 20:30:58,514 INFO L378 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 51 treesize of output 47 [2023-11-28 20:30:58,700 INFO L378 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 [2023-11-28 20:30:59,308 INFO L378 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 17 treesize of output 13 [2023-11-28 20:30:59,469 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2023-11-28 20:30:59,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1989 treesize of output 1431 [2023-11-28 20:30:59,493 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:30:59,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:59,514 INFO L378 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 1 case distinctions, treesize of input 232 treesize of output 226 [2023-11-28 20:30:59,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:30:59,545 INFO L378 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 265 treesize of output 261 [2023-11-28 20:30:59,564 INFO L378 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 51 treesize of output 47 [2023-11-28 20:30:59,653 INFO L378 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 6 treesize of output 4 [2023-11-28 20:31:00,362 INFO L378 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 17 treesize of output 13 [2023-11-28 20:31:00,540 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2023-11-28 20:31:00,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 513 treesize of output 411 [2023-11-28 20:31:00,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:00,581 INFO L378 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 475 treesize of output 469 [2023-11-28 20:31:00,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:00,620 INFO L378 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 1 case distinctions, treesize of input 513 treesize of output 497 [2023-11-28 20:31:00,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:00,675 INFO L378 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 1 case distinctions, treesize of input 514 treesize of output 510 [2023-11-28 20:31:00,713 INFO L378 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 6 treesize of output 4 [2023-11-28 20:31:02,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:02,295 INFO L378 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 1 case distinctions, treesize of input 265 treesize of output 263 [2023-11-28 20:31:02,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:02,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-11-28 20:31:02,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:02,711 INFO L378 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 30 treesize of output 22 [2023-11-28 20:31:02,734 INFO L378 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 [2023-11-28 20:31:02,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:02,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-11-28 20:31:02,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:02,768 INFO L378 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 30 treesize of output 22 [2023-11-28 20:31:02,788 INFO L378 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 [2023-11-28 20:31:02,798 INFO L378 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 52 treesize of output 48 [2023-11-28 20:31:02,806 INFO L378 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 24 treesize of output 22 [2023-11-28 20:31:02,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:02,814 INFO L378 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 51 treesize of output 45 [2023-11-28 20:31:02,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:02,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:02,856 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-28 20:31:02,860 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-28 20:31:02,865 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-28 20:31:03,034 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2023-11-28 20:31:03,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 267 treesize of output 241 [2023-11-28 20:31:03,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:03,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:03,069 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 279 [2023-11-28 20:31:03,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:03,102 INFO L378 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 265 treesize of output 261 [2023-11-28 20:31:03,120 INFO L378 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 246 treesize of output 242 [2023-11-28 20:31:03,148 INFO L378 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 6 treesize of output 4 [2023-11-28 20:31:03,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:03,909 INFO L378 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 145 treesize of output 145 [2023-11-28 20:31:04,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:04,216 INFO L349 Elim1Store]: treesize reduction 150, result has 0.7 percent of original size [2023-11-28 20:31:04,216 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 269 treesize of output 1 [2023-11-28 20:31:04,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:04,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-11-28 20:31:04,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:04,253 INFO L378 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 30 treesize of output 22 [2023-11-28 20:31:04,260 INFO L378 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 [2023-11-28 20:31:04,428 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2023-11-28 20:31:04,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 513 treesize of output 411 [2023-11-28 20:31:04,447 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:31:04,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:04,463 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 279 [2023-11-28 20:31:04,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:04,496 INFO L378 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 265 treesize of output 261 [2023-11-28 20:31:04,516 INFO L378 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 124 treesize of output 120 [2023-11-28 20:31:04,587 INFO L378 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 6 treesize of output 4 [2023-11-28 20:31:04,935 INFO L378 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 17 treesize of output 13 [2023-11-28 20:31:04,990 INFO L349 Elim1Store]: treesize reduction 150, result has 0.7 percent of original size [2023-11-28 20:31:04,991 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 513 treesize of output 1 [2023-11-28 20:31:04,999 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-28 20:31:05,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 1 [2023-11-28 20:31:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-28 20:31:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496518559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:31:25,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:31:25,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 25] total 63 [2023-11-28 20:31:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149320491] [2023-11-28 20:31:25,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:31:25,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-28 20:31:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:31:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-28 20:31:25,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3379, Unknown=48, NotChecked=360, Total=4032 [2023-11-28 20:31:25,621 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 64 states, 64 states have (on average 1.796875) internal successors, (115), 63 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:31:34,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:44,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:49,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:52,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:57,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:32:28,626 WARN L293 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 1970 DAG size of output: 1589 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:32:30,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:32:35,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:07,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:09,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:11,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:24,697 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) (let ((.cse213 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse211 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse213 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse212 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse53 (select .cse213 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse208 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse212 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select .cse212 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse147 (= .cse9 0)) (.cse25 (= .cse9 .cse208)) (.cse10 (+ .cse53 8))) (let ((.cse3 (= .cse211 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse108 (= .cse53 0)) (.cse22 (= .cse211 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse19 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse208)) (.cse85 (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_314 Int)) (or (= v_arrayElimCell_318 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse210 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse210 .cse9 (store (select .cse210 .cse9) .cse10 v_prenex_53))) v_arrayElimCell_314) v_arrayElimCell_318)) (< v_arrayElimCell_318 0)))) (.cse4 (not .cse25)) (.cse179 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse209 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse209 .cse9 (store (select .cse209 .cse9) .cse10 v_ArrVal_2772))) v_arrayElimCell_321) v_arrayElimCell_325))))) (< v_arrayElimCell_325 0)))) (.cse35 (and (not (= .cse208 0)) .cse147)) (.cse14 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse207 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse207 .cse9 (store (select .cse207 .cse9) .cse10 v_ArrVal_2772))) v_arrayElimCell_322) v_arrayElimCell_326)) (= v_arrayElimCell_322 0))))) (let ((.cse5 (and (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse205 (let ((.cse206 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse206 .cse9 (store (select .cse206 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse205 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse205 0) v_arrayElimCell_325))))) (= v_arrayElimCell_322 0))))) (< v_arrayElimCell_325 0))) .cse14)) (.cse1 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse203 (let ((.cse204 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse204 .cse9 (store (select .cse204 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse203 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse203 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))))) (< v_arrayElimCell_325 0)))) (.cse2 (or .cse35 (let ((.cse198 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767) .cse9) .cse10 v_ArrVal_2772) v_arrayElimCell_325))) (< v_arrayElimCell_325 0))))) (and (or .cse25 (and (forall ((v_arrayElimCell_325 Int)) (or (< v_arrayElimCell_325 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse195 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse194 (store (select .cse195 .cse9) .cse10 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse194 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse195 .cse9 .cse194) v_arrayElimCell_322) v_arrayElimCell_326)))))))) (forall ((v_arrayElimCell_325 Int)) (or (< v_arrayElimCell_325 0) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse197 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse196 (store (select .cse197 .cse9) .cse10 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse196 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse197 .cse9 .cse196) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))))) .cse198)) (or .cse25 (and (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse200 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse199 (store (select .cse200 .cse9) .cse10 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse199 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse200 .cse9 .cse199) v_arrayElimCell_322) v_arrayElimCell_326)))))) (< v_arrayElimCell_326 0))) (< v_arrayElimCell_325 0))) .cse198)) (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse202 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse201 (store (select .cse202 .cse9) .cse10 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse201 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse202 .cse9 .cse201) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))))) (< v_arrayElimCell_325 0))) (or .cse25 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_325 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767) .cse9) .cse10 v_ArrVal_2772) v_arrayElimCell_325)) (< v_arrayElimCell_325 0)))))))) (.cse6 (or (and (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse190 (let ((.cse191 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse191 .cse9 (store (select .cse191 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse190 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse190 v_arrayElimCell_322) v_arrayElimCell_326))))))) (< v_arrayElimCell_325 0))) .cse179 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse192 (let ((.cse193 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse193 .cse9 (store (select .cse193 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse192 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse192 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))) (< v_arrayElimCell_325 0)))) .cse25)) (.cse11 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (let ((.cse189 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse188 (store (select .cse189 .cse9) .cse10 v_ArrVal_2772))) (or (< v_arrayElimCell_326 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse188 v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse189 .cse9 .cse188) v_arrayElimCell_322) v_arrayElimCell_326)) (= v_arrayElimCell_322 0)))))) (.cse12 (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_325 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse186 (let ((.cse187 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse187 .cse9 (store (select .cse187 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse186 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse186 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0)))))))) (.cse13 (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse184 (let ((.cse185 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse185 .cse9 (store (select .cse185 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse184 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse184 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0)))))) (.cse15 (or .cse4 (and .cse14 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse182 (let ((.cse183 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse183 .cse9 (store (select .cse183 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse182 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse182 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))) (< v_arrayElimCell_325 0)))))) (.cse16 (or .cse25 (and .cse179 (forall ((v_arrayElimCell_325 Int)) (or (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse180 (let ((.cse181 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse181 .cse9 (store (select .cse181 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse180 v_arrayElimCell_321) v_arrayElimCell_325)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse180 v_arrayElimCell_322) v_arrayElimCell_326))))))))) (< v_arrayElimCell_325 0)))))) (.cse17 (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_325 Int)) (or (= v_arrayElimCell_321 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse178 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse178 .cse9 (store (select .cse178 .cse9) .cse10 v_ArrVal_2772))) v_arrayElimCell_321) v_arrayElimCell_325)) (< v_arrayElimCell_325 0))) .cse25)) (.cse18 (or .cse4 .cse14)) (.cse50 (and .cse4 (<= (+ .cse53 1) 0))) (.cse106 (or .cse25 (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_317 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse177 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse177 .cse9 (store (select .cse177 .cse9) .cse10 v_prenex_53))) 0) v_arrayElimCell_317)) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0))))) (.cse83 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse176 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse175 (store (select .cse176 .cse9) .cse10 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse175 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse176 .cse9 .cse175) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0)))))) (.cse90 (forall ((v_arrayElimCell_317 Int)) (or (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse173 (let ((.cse174 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse174 .cse9 (store (select .cse174 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse173 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse173 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))))) (.cse93 (forall ((v_arrayElimCell_317 Int)) (or (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse172 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse171 (store (select .cse172 .cse9) .cse10 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse171 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse172 .cse9 .cse171) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0)))))) (.cse84 (or (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int) (v_arrayElimCell_317 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse170 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse170 .cse9 (store (select .cse170 .cse9) .cse10 v_prenex_53))) v_arrayElimCell_313) v_arrayElimCell_317)) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0))) .cse25)) (.cse86 (forall ((v_arrayElimCell_318 Int) (v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse169 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse168 (store (select .cse169 .cse9) .cse10 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse168 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse169 .cse9 .cse168) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0)))) (.cse87 (forall ((v_arrayElimCell_318 Int) (v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse166 (let ((.cse167 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse167 .cse9 (store (select .cse167 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse166 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse166 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))) (.cse95 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse164 (let ((.cse165 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse165 .cse9 (store (select .cse165 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse164 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse164 v_arrayElimCell_314) v_arrayElimCell_318))))))))) (.cse98 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse163 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse162 (store (select .cse163 .cse9) .cse10 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse162 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse163 .cse9 .cse162) v_arrayElimCell_314) v_arrayElimCell_318)))))))))) (.cse97 (forall ((v_arrayElimCell_317 Int)) (or (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse160 (let ((.cse161 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse161 .cse9 (store (select .cse161 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse160 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse160 v_arrayElimCell_314) v_arrayElimCell_318)))))) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0)))) (.cse107 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse158 (let ((.cse159 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse159 .cse9 (store (select .cse159 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse158 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse158 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))))) (.cse103 (or .cse4 .cse85)) (.cse104 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse156 (let ((.cse157 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse157 .cse9 (store (select .cse157 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse156 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse156 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))))) (.cse100 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse154 (let ((.cse155 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse155 .cse9 (store (select .cse155 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse154 v_arrayElimCell_313) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse154 v_arrayElimCell_314) v_arrayElimCell_318))))))))))) (.cse94 (forall ((v_arrayElimCell_317 Int)) (or (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52) .cse9) .cse10 v_prenex_53) v_arrayElimCell_317))) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0)))) (.cse102 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse152 (let ((.cse153 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse153 .cse9 (store (select .cse153 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse152 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse152 v_arrayElimCell_314) v_arrayElimCell_318))))))))))) (.cse101 (forall ((v_arrayElimCell_317 Int)) (or (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse151 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse150 (store (select .cse151 .cse9) .cse10 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse150 v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse151 .cse9 .cse150) v_arrayElimCell_314) v_arrayElimCell_318))))))))) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0)))) (.cse96 (forall ((v_arrayElimCell_317 Int)) (or (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse149 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse149 .cse9 (store (select .cse149 .cse9) .cse10 v_prenex_53))) 0) v_arrayElimCell_317))) (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0)))) (.cse99 (forall ((v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (< v_arrayElimCell_317 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse148 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse148 .cse9 (store (select .cse148 .cse9) .cse10 v_prenex_53))) v_arrayElimCell_313) v_arrayElimCell_317)))))) (.cse105 (or (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_317 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52) .cse9) .cse10 v_prenex_53) v_arrayElimCell_317)) (< v_arrayElimCell_317 0))) .cse25)) (.cse34 (and .cse22 .cse19 (not .cse147))) (.cse49 (and .cse3 (not .cse108) .cse19))) (and (or (and .cse1 .cse2 (or .cse3 .cse4 .cse5) .cse6 (or .cse4 (and (or .cse3 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (let ((.cse7 (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 v_ArrVal_2772))))) (or (< v_arrayElimCell_326 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_arrayElimCell_322) v_arrayElimCell_326)) (= v_arrayElimCell_322 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 0) v_arrayElimCell_325)))))) .cse11 .cse12 .cse13 .cse14)) .cse15 .cse16 .cse17 .cse18) .cse19) (or (let ((.cse23 (let ((.cse37 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse48 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse48 .cse9 (store (select .cse48 .cse9) .cse10 v_ArrVal_2772))) v_arrayElimCell_321) 0))))))) (and (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse36 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse36 .cse9 (store (select .cse36 .cse9) .cse10 v_ArrVal_2772))) v_arrayElimCell_321) 0)))) .cse25) (or (and .cse37 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse38 (let ((.cse39 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse39 .cse9 (store (select .cse39 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse38 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse38 v_arrayElimCell_322) v_arrayElimCell_326)))))))))) .cse25) (or (and .cse37 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse40 (let ((.cse41 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse41 .cse9 (store (select .cse41 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_322) v_arrayElimCell_326))))))) (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (= v_arrayElimCell_322 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse42 (let ((.cse43 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse43 .cse9 (store (select .cse43 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_arrayElimCell_322) v_arrayElimCell_326)))))))))) .cse25) (or .cse4 (and (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (= v_arrayElimCell_322 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse44 (let ((.cse45 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse45 .cse9 (store (select .cse45 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_322) v_arrayElimCell_326))))))))) .cse14)) (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (= v_arrayElimCell_322 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse46 (let ((.cse47 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse47 .cse9 (store (select .cse47 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_arrayElimCell_321) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_arrayElimCell_322) v_arrayElimCell_326))))))))))) .cse18)))) (and (or .cse3 (and (or .cse4 (and (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse20 (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse21 .cse9 (store (select .cse21 .cse9) .cse10 v_ArrVal_2772))))) (or (= (select (select .cse20 0) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))) .cse14)) (or .cse22 .cse23))) (or .cse19 .cse23) (or (let ((.cse24 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767) .cse9) .cse10 v_ArrVal_2772) 0))))) (and (or .cse24 .cse25) (or (and .cse24 (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse26 (store (select .cse27 .cse9) .cse10 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse27 .cse9 .cse26) v_arrayElimCell_322) v_arrayElimCell_326))))))))) .cse25) (or .cse25 (and .cse24 (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse28 (store (select .cse29 .cse9) .cse10 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse29 .cse9 .cse28) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse31 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse30 (store (select .cse31 .cse9) .cse10 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse31 .cse9 .cse30) v_arrayElimCell_322) v_arrayElimCell_326)))))))) (forall ((v_arrayElimCell_326 Int)) (or (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse32 (store (select .cse33 .cse9) .cse10 v_ArrVal_2772))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse33 .cse9 .cse32) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))) (< v_arrayElimCell_326 0))) .cse18)) .cse34 .cse35))) .cse49) (or (and (or .cse50 (let ((.cse70 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse80 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse80 .cse9 (store (select .cse80 .cse9) .cse10 v_ArrVal_2772))) v_arrayElimCell_321) .cse53))))))) (let ((.cse61 (or (and .cse70 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse76 (let ((.cse77 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse77 .cse9 (store (select .cse77 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse76 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse76 v_arrayElimCell_321) .cse53))))) (= v_arrayElimCell_322 0))))) (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse78 (let ((.cse79 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse79 .cse9 (store (select .cse79 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse78 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse78 v_arrayElimCell_321) .cse53)))))))) .cse25)) (.cse62 (or .cse25 (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse75 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse75 .cse9 (store (select .cse75 .cse9) .cse10 v_ArrVal_2772))) v_arrayElimCell_321) .cse53)))))) (.cse63 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse73 (let ((.cse74 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse74 .cse9 (store (select .cse74 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse73 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse73 v_arrayElimCell_321) .cse53))))) (= v_arrayElimCell_322 0)))))))) (.cse64 (or (and .cse70 (forall ((v_arrayElimCell_321 Int)) (or (= v_arrayElimCell_321 0) (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse71 (let ((.cse72 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse72 .cse9 (store (select .cse72 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_321) .cse53)))))))))) .cse25)) (.cse65 (or .cse4 (and (forall ((v_arrayElimCell_321 Int) (v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse68 (let ((.cse69 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse69 .cse9 (store (select .cse69 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_321) .cse53))))) (= v_arrayElimCell_322 0))))) .cse14)))) (and (or (let ((.cse51 (forall ((v_ArrVal_2767 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767) .cse9) .cse53))))) (and (or .cse51 .cse25) (or .cse25 (and .cse51 (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse54 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse52 (select .cse54 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse53)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse54 .cse9 (store .cse52 .cse10 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_326 Int)) (let ((.cse56 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse55 (select .cse56 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse53)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse56 .cse9 (store .cse55 .cse10 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))))) (or .cse25 (and .cse51 (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int) (v_arrayElimCell_322 Int)) (let ((.cse58 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse57 (select .cse58 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse53)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse58 .cse9 (store .cse57 .cse10 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))))))) (forall ((v_arrayElimCell_326 Int)) (or (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse60 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (let ((.cse59 (select .cse60 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 .cse53)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse60 .cse9 (store .cse59 .cse10 v_ArrVal_2772)) v_arrayElimCell_322) v_arrayElimCell_326)))))) (= v_arrayElimCell_322 0))) (< v_arrayElimCell_326 0))) .cse18)) .cse35) (or (and .cse61 .cse62 .cse63 .cse64 .cse65 .cse18) .cse19) (or .cse3 (and .cse61 .cse62 (or .cse4 (and .cse14 (forall ((v_arrayElimCell_326 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse66 (let ((.cse67 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse67 .cse9 (store (select .cse67 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse66 0) .cse53)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse66 v_arrayElimCell_322) v_arrayElimCell_326))))) (= v_arrayElimCell_322 0))))))) .cse63 .cse64 .cse65 .cse18)))))) (or .cse3 (and (or .cse4 .cse5) .cse1 .cse2 .cse6 (or .cse4 (and .cse11 .cse12 .cse13 .cse14 (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (< v_arrayElimCell_326 0) (forall ((v_arrayElimCell_322 Int)) (or (forall ((v_ArrVal_2767 (Array Int Int)) (v_ArrVal_2772 Int)) (let ((.cse81 (let ((.cse82 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2767))) (store .cse82 .cse9 (store (select .cse82 .cse9) .cse10 v_ArrVal_2772))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse81 v_arrayElimCell_322) v_arrayElimCell_326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse81 0) v_arrayElimCell_325))))) (= v_arrayElimCell_322 0))))))) .cse15 .cse16 .cse17 .cse18))) .cse22) (or (and .cse83 .cse84 (or .cse4 (and .cse85 .cse86 .cse87 (or .cse3 (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_314 Int) (v_arrayElimCell_317 Int)) (let ((.cse88 (let ((.cse89 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse89 .cse9 (store (select .cse89 .cse9) .cse10 v_prenex_53))))) (or (= v_arrayElimCell_318 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse88 0) v_arrayElimCell_317)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse88 v_arrayElimCell_314) v_arrayElimCell_318)) (< v_arrayElimCell_318 0))))))) (or .cse4 (and .cse90 .cse85 (or .cse3 (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int) (v_arrayElimCell_314 Int) (v_arrayElimCell_317 Int)) (let ((.cse91 (let ((.cse92 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse92 .cse9 (store (select .cse92 .cse9) .cse10 v_prenex_53))))) (or (= v_arrayElimCell_318 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse91 0) v_arrayElimCell_317)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse91 v_arrayElimCell_314) v_arrayElimCell_318)) (< v_arrayElimCell_317 0) (< v_arrayElimCell_318 0))))) .cse93)) (or (and .cse94 .cse95 (or .cse3 (and .cse96 .cse97)) .cse98 .cse99) .cse25) (or .cse25 (and .cse100 .cse94 .cse101 (or .cse3 (and .cse102 .cse96)) .cse99)) .cse103 .cse104 .cse105 (or .cse3 (and .cse106 .cse107))) .cse19) (or (and (or .cse50 (and .cse4 .cse108) (let ((.cse111 (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse135 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse135 .cse9 (store (select .cse135 .cse9) .cse10 v_prenex_53))) v_arrayElimCell_313) .cse53))))) (let ((.cse118 (forall ((v_prenex_52 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52) .cse9) .cse53)))) (.cse128 (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse133 (let ((.cse134 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse134 .cse9 (store (select .cse134 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse133 v_arrayElimCell_313) .cse53)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse133 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0)))) (.cse129 (or .cse111 .cse25)) (.cse112 (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse132 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse132 .cse9 (store (select .cse132 .cse9) .cse10 v_prenex_53))) 0) .cse53))))) (and (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse110 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse109 (select .cse110 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse109 .cse53)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse110 .cse9 (store .cse109 .cse10 v_prenex_53)) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0))) (or .cse25 (let ((.cse115 (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse119 (let ((.cse120 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse120 .cse9 (store (select .cse120 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse119 v_arrayElimCell_313) .cse53)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse119 v_arrayElimCell_314) v_arrayElimCell_318)))))))))) (and (or .cse3 (and .cse111 .cse112 (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse113 (let ((.cse114 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse114 .cse9 (store (select .cse114 .cse9) .cse10 v_prenex_53))))) (or (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse113 v_arrayElimCell_314) v_arrayElimCell_318))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse113 0) .cse53))))))) .cse115)) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse117 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse116 (select .cse117 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse116 .cse53)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse117 .cse9 (store .cse116 .cse10 v_prenex_53)) v_arrayElimCell_314) v_arrayElimCell_318))))))))) .cse118 (or .cse19 (and .cse111 .cse115))))) (or .cse118 .cse25) (or (let ((.cse121 (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse126 (let ((.cse127 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse127 .cse9 (store (select .cse127 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse126 v_arrayElimCell_313) .cse53)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse126 v_arrayElimCell_314) v_arrayElimCell_318)))))))) (and (or (and .cse111 .cse121) .cse19) .cse118 (or .cse3 (and (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse122 (let ((.cse123 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse123 .cse9 (store (select .cse123 .cse9) .cse10 v_prenex_53))))) (or (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse122 v_arrayElimCell_314) v_arrayElimCell_318))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse122 0) .cse53))))) .cse111 .cse112 .cse121)) (forall ((v_arrayElimCell_318 Int) (v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse125 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse124 (select .cse125 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse124 .cse53)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse125 .cse9 (store .cse124 .cse10 v_prenex_53)) v_arrayElimCell_314) v_arrayElimCell_318))))))))) .cse25) .cse103 (or .cse19 (and .cse128 .cse129)) (or .cse3 (and (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse130 (let ((.cse131 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse131 .cse9 (store (select .cse131 .cse9) .cse10 v_prenex_53))))) (or (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse130 v_arrayElimCell_314) v_arrayElimCell_318))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse130 0) .cse53))))) (< v_arrayElimCell_318 0))) .cse128 .cse129 (or .cse25 .cse112))))))) (or (and .cse106 .cse83 (or .cse4 (and .cse90 .cse85 (forall ((v_arrayElimCell_317 Int)) (or (< v_arrayElimCell_317 0) (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse136 (let ((.cse137 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse137 .cse9 (store (select .cse137 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse136 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse136 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0))))) .cse93)) .cse84 (or .cse4 (and .cse85 (forall ((v_arrayElimCell_318 Int) (v_arrayElimCell_317 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse138 (let ((.cse139 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse139 .cse9 (store (select .cse139 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse138 0) v_arrayElimCell_317)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse138 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0))) .cse86 .cse87)) (or .cse25 (and .cse94 .cse95 .cse96 .cse98 .cse97 .cse99)) .cse107 .cse103 .cse104 (or .cse25 (and .cse100 .cse94 .cse102 .cse101 .cse96 .cse99)) .cse105) .cse3)) .cse22) (or .cse4 (let ((.cse140 (forall ((v_arrayElimCell_318 Int)) (or (forall ((v_prenex_52 (Array Int Int)) (v_arrayElimCell_313 Int) (v_prenex_53 Int)) (let ((.cse145 (let ((.cse146 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse146 .cse9 (store (select .cse146 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse145 v_arrayElimCell_313) 0)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse145 v_arrayElimCell_314) v_arrayElimCell_318)))))) (= v_arrayElimCell_318 0) (< v_arrayElimCell_318 0))))) (and (or (and .cse85 .cse140) .cse19) (or .cse3 (and (or .cse19 .cse140) (or .cse22 .cse140) .cse85 (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse141 (let ((.cse142 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (store .cse142 .cse9 (store (select .cse142 .cse9) .cse10 v_prenex_53))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse141 0) 0)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse141 v_arrayElimCell_314) v_arrayElimCell_318)))))) (< v_arrayElimCell_318 0))))) (or .cse34 (and (forall ((v_arrayElimCell_318 Int)) (or (= v_arrayElimCell_318 0) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse144 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_52))) (let ((.cse143 (store (select .cse144 .cse9) .cse10 v_prenex_53))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse143 0)) (forall ((v_arrayElimCell_314 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse144 .cse9 .cse143) v_arrayElimCell_314) v_arrayElimCell_318))))))) (< v_arrayElimCell_318 0))) .cse85)))) .cse49))))))) (< .cse211 0)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2023-11-28 20:33:36,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:38,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:45,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:33:57,903 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-11-28 20:33:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-28 20:33:57,904 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.796875) internal successors, (115), 63 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-28 20:33:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:33:57,904 INFO L225 Difference]: With dead ends: 79 [2023-11-28 20:33:57,904 INFO L226 Difference]: Without dead ends: 79 [2023-11-28 20:33:57,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 137.7s TimeCoverageRelationStatistics Valid=485, Invalid=5321, Unknown=62, NotChecked=612, Total=6480 [2023-11-28 20:33:57,907 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 148 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 23 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 67.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:33:57,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 581 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1285 Invalid, 8 Unknown, 339 Unchecked, 67.7s Time] [2023-11-28 20:33:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-28 20:33:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2023-11-28 20:33:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:33:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-11-28 20:33:57,909 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 41 [2023-11-28 20:33:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:33:57,909 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-11-28 20:33:57,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.796875) internal successors, (115), 63 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:33:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-11-28 20:33:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-28 20:33:57,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:33:57,910 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:33:57,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-28 20:33:58,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-28 20:33:58,111 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:33:58,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:33:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1610797907, now seen corresponding path program 2 times [2023-11-28 20:33:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:33:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030847739] [2023-11-28 20:33:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:33:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:33:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:34:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:34:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:34:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030847739] [2023-11-28 20:34:01,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030847739] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:34:01,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287489369] [2023-11-28 20:34:01,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:34:01,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:34:01,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:34:01,033 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:34:01,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-28 20:34:01,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:34:01,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:34:01,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-28 20:34:01,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:34:01,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 20:34:01,746 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-28 20:34:01,746 INFO L378 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 17 treesize of output 21 [2023-11-28 20:34:01,961 INFO L378 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 [2023-11-28 20:34:02,123 INFO L378 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 23 treesize of output 11 [2023-11-28 20:34:02,197 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:34:02,197 INFO L378 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 42 treesize of output 39 [2023-11-28 20:34:02,566 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-28 20:34:02,566 INFO L378 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 [2023-11-28 20:34:02,829 INFO L378 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 49 treesize of output 32 [2023-11-28 20:34:02,893 INFO L378 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 49 treesize of output 32 [2023-11-28 20:34:02,951 INFO L378 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 49 treesize of output 32 [2023-11-28 20:34:03,437 INFO L378 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 56 treesize of output 39 [2023-11-28 20:34:03,468 INFO L378 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 15 treesize of output 11 [2023-11-28 20:34:04,120 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-28 20:34:04,120 INFO L378 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 28 treesize of output 23 [2023-11-28 20:34:04,133 INFO L378 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 9 treesize of output 7 [2023-11-28 20:34:04,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:04,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:34:04,157 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-28 20:34:04,158 INFO L378 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 1 case distinctions, treesize of input 91 treesize of output 42 [2023-11-28 20:34:04,335 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 20:34:04,346 INFO L378 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 0 case distinctions, treesize of input 75 treesize of output 40 [2023-11-28 20:34:04,534 INFO L378 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 79 treesize of output 51 [2023-11-28 20:34:04,732 INFO L378 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 [2023-11-28 20:34:05,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:34:05,291 INFO L378 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 52 treesize of output 23 [2023-11-28 20:34:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:34:05,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:34:06,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:06,775 INFO L378 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 222 treesize of output 212 [2023-11-28 20:34:06,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:06,815 INFO L378 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 440 treesize of output 409 [2023-11-28 20:34:06,826 INFO L378 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 348 treesize of output 316 [2023-11-28 20:34:08,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:08,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2023-11-28 20:34:08,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:08,494 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2023-11-28 20:34:08,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:08,544 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2023-11-28 20:34:08,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:08,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 113 [2023-11-28 20:34:08,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:08,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2023-11-28 20:34:08,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:08,711 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2023-11-28 20:34:10,722 INFO L378 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 212 treesize of output 156 [2023-11-28 20:34:10,730 INFO L378 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 160 treesize of output 132 [2023-11-28 20:34:10,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:10,815 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:10,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:10,829 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2023-11-28 20:34:10,901 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-11-28 20:34:10,901 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 66 [2023-11-28 20:34:10,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:10,923 INFO L378 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 17 [2023-11-28 20:34:12,791 INFO L378 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 170 treesize of output 154 [2023-11-28 20:34:12,799 INFO L378 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 70 treesize of output 66 [2023-11-28 20:34:12,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:12,833 INFO L378 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 66 treesize of output 55 [2023-11-28 20:34:12,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:12,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:12,879 INFO L378 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 3 case distinctions, treesize of input 530 treesize of output 415 [2023-11-28 20:34:12,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:12,891 INFO L378 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 165 treesize of output 135 [2023-11-28 20:34:12,902 INFO L378 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 130 treesize of output 114 [2023-11-28 20:34:12,909 INFO L378 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 121 treesize of output 107 [2023-11-28 20:34:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:34:14,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287489369] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:34:14,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:34:14,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 23] total 59 [2023-11-28 20:34:14,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59359279] [2023-11-28 20:34:14,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:34:14,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-28 20:34:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:34:14,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-28 20:34:14,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3188, Unknown=6, NotChecked=0, Total=3422 [2023-11-28 20:34:14,053 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 59 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:34:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:34:21,653 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-11-28 20:34:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 20:34:21,654 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-28 20:34:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:34:21,655 INFO L225 Difference]: With dead ends: 79 [2023-11-28 20:34:21,655 INFO L226 Difference]: Without dead ends: 79 [2023-11-28 20:34:21,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=412, Invalid=4694, Unknown=6, NotChecked=0, Total=5112 [2023-11-28 20:34:21,657 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 165 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:34:21,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 719 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-28 20:34:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-28 20:34:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2023-11-28 20:34:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:34:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-11-28 20:34:21,660 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 43 [2023-11-28 20:34:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:34:21,660 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-11-28 20:34:21,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:34:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-11-28 20:34:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-28 20:34:21,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:34:21,661 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:34:21,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-28 20:34:21,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-28 20:34:21,862 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-28 20:34:21,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:34:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1498173239, now seen corresponding path program 3 times [2023-11-28 20:34:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:34:21,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321634571] [2023-11-28 20:34:21,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:34:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:34:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:34:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:34:27,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:34:27,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321634571] [2023-11-28 20:34:27,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321634571] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:34:27,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897143737] [2023-11-28 20:34:27,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:34:27,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:34:27,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:34:27,584 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:34:27,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ad7b9af-bbf8-4870-be1c-0b242a085ab9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-28 20:34:29,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-28 20:34:29,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:34:29,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 140 conjunts are in the unsatisfiable core [2023-11-28 20:34:29,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:34:29,188 INFO L378 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 [2023-11-28 20:34:29,415 INFO L378 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 11 treesize of output 7 [2023-11-28 20:34:29,426 INFO L378 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 11 treesize of output 7 [2023-11-28 20:34:29,602 INFO L378 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 23 treesize of output 11 [2023-11-28 20:34:29,613 INFO L378 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 19 treesize of output 18 [2023-11-28 20:34:30,011 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:34:30,012 INFO L378 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 [2023-11-28 20:34:30,254 INFO L378 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 [2023-11-28 20:34:30,270 INFO L378 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 23 treesize of output 16 [2023-11-28 20:34:30,470 INFO L378 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 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-28 20:34:30,494 INFO L378 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 19 treesize of output 18 [2023-11-28 20:34:30,718 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-28 20:34:30,747 INFO L378 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 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-28 20:34:31,073 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-28 20:34:31,073 INFO L378 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 1 case distinctions, treesize of input 105 treesize of output 70 [2023-11-28 20:34:31,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 38 [2023-11-28 20:34:31,673 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-28 20:34:31,673 INFO L378 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 [2023-11-28 20:34:32,050 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-28 20:34:32,051 INFO L378 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 50 [2023-11-28 20:34:32,069 INFO L378 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 46 treesize of output 38 [2023-11-28 20:34:32,166 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-28 20:34:32,167 INFO L378 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 50 [2023-11-28 20:34:32,180 INFO L378 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 46 treesize of output 38 [2023-11-28 20:34:32,291 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-28 20:34:32,291 INFO L378 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 50 [2023-11-28 20:34:32,310 INFO L378 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 46 treesize of output 38 [2023-11-28 20:34:32,967 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-28 20:34:32,968 INFO L378 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 74 treesize of output 55 [2023-11-28 20:34:33,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2023-11-28 20:34:33,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:33,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:34:33,987 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-28 20:34:33,988 INFO L378 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 58 [2023-11-28 20:34:34,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:34,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:34,018 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-28 20:34:34,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2023-11-28 20:34:34,293 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 20:34:34,304 INFO L378 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 0 case distinctions, treesize of input 115 treesize of output 68 [2023-11-28 20:34:34,570 INFO L378 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 131 treesize of output 91 [2023-11-28 20:34:37,697 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:34:37,762 INFO L349 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2023-11-28 20:34:37,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 73 [2023-11-28 20:34:37,808 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-11-28 20:34:37,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 28 [2023-11-28 20:34:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:34:37,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:35:32,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:35:32,541 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 391 treesize of output 313 [2023-11-28 20:35:32,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:35:32,559 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 338 [2023-11-28 20:35:32,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:35:32,701 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 383 treesize of output 323 [2023-11-28 20:35:32,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:35:32,725 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 370 treesize of output 338 [2023-11-28 20:35:32,871 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse22 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse10 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse22 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select .cse22 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse12 (+ .cse0 8))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int) (v_arrayElimArr_95 (Array Int Int)) (v_arrayElimArr_94 (Array Int Int)) (v_ArrVal_3165 Int)) (let ((.cse2 (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_94))) (store .cse13 .cse6 (store (select .cse13 .cse6) .cse12 v_ArrVal_3165)))) (.cse9 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (let ((.cse7 (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_95))) (store .cse11 .cse6 (store (select .cse11 .cse6) .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse3 (select (select .cse2 .cse8) .cse9)) (.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 4))) (let ((.cse5 (select (select .cse7 .cse3) .cse4))) (or (< .cse0 (select v_arrayElimArr_95 .cse1)) (= (select (select .cse2 (select (select .cse2 .cse3) .cse4)) (+ .cse5 4)) 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (not (= .cse6 (select v_arrayElimArr_94 .cse1))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< .cse5 0) (< (select (select .cse7 .cse8) .cse9) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (< .cse10 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|)))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int) (v_ArrVal_3165 Int) (v_arrayElimArr_97 (Array Int Int)) (v_arrayElimArr_96 (Array Int Int))) (let ((.cse16 (let ((.cse21 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_96))) (store .cse21 .cse6 (store (select .cse21 .cse6) .cse12 v_ArrVal_3165)))) (.cse19 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (let ((.cse15 (let ((.cse20 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_97))) (store .cse20 .cse6 (store (select .cse20 .cse6) .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse17 (select (select .cse16 .cse8) .cse19)) (.cse18 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 4))) (let ((.cse14 (select (select .cse15 .cse17) .cse18))) (or (< .cse14 0) (not (= .cse6 (select v_arrayElimArr_96 .cse1))) (= (select (select .cse15 (select (select .cse16 .cse17) .cse18)) (+ .cse14 4)) 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (< .cse0 (select v_arrayElimArr_97 .cse1)) (< (select (select .cse15 .cse8) .cse19) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< .cse10 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|)))))))))) is different from false [2023-11-28 20:35:33,723 INFO L378 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 602 treesize of output 462 [2023-11-28 20:35:33,731 INFO L378 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 466 treesize of output 390 [2023-11-28 20:35:54,517 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-11-28 20:35:54,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1354 treesize of output 1386 [2023-11-28 20:35:54,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:35:54,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1337 treesize of output 1204 [2023-11-28 20:35:54,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:35:54,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1187 treesize of output 1084 [2023-11-28 20:35:54,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:35:54,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1067 treesize of output 994 [2023-11-28 20:35:54,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:35:54,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 977 treesize of output 874 [2023-11-28 20:35:56,963 INFO L378 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 8 treesize of output 4 [2023-11-28 20:35:57,215 INFO L378 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 8 treesize of output 4 [2023-11-28 20:35:57,462 INFO L378 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 8 treesize of output 4 [2023-11-28 20:35:57,849 INFO L378 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 17 treesize of output 9 [2023-11-28 20:35:57,860 INFO L378 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 17 treesize of output 9 [2023-11-28 20:36:05,234 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| Int)) (or (forall ((v_arrayElimArr_99 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_43| Int) (v_ArrVal_3155 Int) (v_arrayElimArr_101 (Array Int Int)) (v_ArrVal_3165 Int) (v_arrayElimArr_97 (Array Int Int)) (v_arrayElimArr_96 (Array Int Int)) (v_ArrVal_3152 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| 8)) (.cse0 (select v_arrayElimArr_96 4))) (let ((.cse4 (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_arrayElimArr_99))) (let ((.cse11 (store (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_ArrVal_3155))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11) |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_96) .cse0 (store (select (store (store .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11) |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_96) .cse0) .cse2 v_ArrVal_3165)))))) (let ((.cse1 (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| .cse0 v_arrayElimArr_101))) (let ((.cse8 (store (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_ArrVal_3152))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_97) .cse0 (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_97) .cse0) .cse2 0))))) (.cse5 (select (select .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) 4)) (.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 4))) (let ((.cse3 (select (select .cse1 .cse5) .cse6)) (.cse7 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (not (= (select |c_#valid| .cse0) 0)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (< (select (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) 4) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (not (= (select v_arrayElimArr_101 .cse2) 0)) (< |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| (select v_arrayElimArr_97 4)) (< .cse3 0) (= .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (= (select (select .cse1 (select (select .cse4 .cse5) .cse6)) (+ .cse3 4)) 0) (not (= (select v_arrayElimArr_101 .cse7) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_99 .cse7))))))))) (< 0 |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62|))) (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| Int)) (or (forall ((v_arrayElimArr_98 (Array Int Int)) (v_prenex_269 Int) (v_prenex_275 Int) (v_prenex_276 Int) (v_prenex_274 Int) (v_arrayElimArr_100 (Array Int Int)) (v_arrayElimArr_95 (Array Int Int)) (v_arrayElimArr_94 (Array Int Int)) (v_prenex_270 Int)) (let ((.cse16 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| 8)) (.cse13 (select v_arrayElimArr_94 4))) (let ((.cse17 (let ((.cse24 (store |c_#memory_$Pointer$#2.base| .cse13 v_arrayElimArr_98))) (let ((.cse23 (store (select .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_275))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse23) v_prenex_274 v_arrayElimArr_94) .cse13 (store (select (store (store .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse23) v_prenex_274 v_arrayElimArr_94) .cse13) .cse16 v_prenex_270)))))) (let ((.cse14 (let ((.cse22 (store |c_#memory_$Pointer$#2.offset| .cse13 v_arrayElimArr_100))) (let ((.cse21 (store (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_276))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse21) v_prenex_274 v_arrayElimArr_95) .cse13 (store (select (store (store .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse21) v_prenex_274 v_arrayElimArr_95) .cse13) .cse16 0))))) (.cse18 (select (select .cse17 v_prenex_274) 4)) (.cse19 (+ v_prenex_269 4))) (let ((.cse15 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| 4)) (.cse20 (select (select .cse14 .cse18) .cse19))) (or (< v_prenex_269 0) (= .cse13 v_prenex_274) (< (select (select .cse14 v_prenex_274) 4) v_prenex_269) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_98 .cse15))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_100 .cse15))) (not (= (select v_arrayElimArr_100 .cse16) 0)) (< |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| (select v_arrayElimArr_95 4)) (= (select (select .cse17 (select (select .cse17 .cse18) .cse19)) (+ .cse20 4)) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_274) (< .cse20 0) (not (= (select |c_#valid| .cse13) 0)))))))) (< 0 |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62|))))) is different from false [2023-11-28 20:36:06,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 0))) (.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_3142 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| Int)) (or (forall ((v_arrayElimArr_98 (Array Int Int)) (v_prenex_269 Int) (v_prenex_275 Int) (v_prenex_276 Int) (v_prenex_274 Int) (v_arrayElimArr_100 (Array Int Int)) (v_arrayElimArr_95 (Array Int Int)) (v_arrayElimArr_94 (Array Int Int)) (v_prenex_270 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| 8)) (.cse1 (select v_arrayElimArr_94 4))) (let ((.cse5 (let ((.cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse12 .cse10 v_ArrVal_3142)) .cse1 v_arrayElimArr_98) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_275))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11) v_prenex_274 v_arrayElimArr_94) .cse1 (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_arrayElimArr_98) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11) v_prenex_274 v_arrayElimArr_94) .cse1) .cse4 v_prenex_270))))) (let ((.cse0 (let ((.cse8 (store (select (store .cse9 .cse1 v_arrayElimArr_100) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_276))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) v_prenex_274 v_arrayElimArr_95) .cse1 (store (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_arrayElimArr_100) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) v_prenex_274 v_arrayElimArr_95) .cse1) .cse4 0)))) (.cse6 (select (select .cse5 v_prenex_274) 4)) (.cse7 (+ v_prenex_269 4))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| 4)) (.cse3 (select (select .cse0 .cse6) .cse7))) (or (< v_prenex_269 0) (< (select (select .cse0 v_prenex_274) 4) v_prenex_269) (= .cse1 v_prenex_274) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_98 .cse2))) (< .cse3 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_100 .cse2))) (not (= (select v_arrayElimArr_100 .cse4) 0)) (= (select (select .cse5 (select (select .cse5 .cse6) .cse7)) (+ .cse3 4)) 0) (< |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| (select v_arrayElimArr_95 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_274) (not (= (select |c_#valid| .cse1) 0)))))))) (< 0 |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62|))) (forall ((v_ArrVal_3142 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| Int)) (or (forall ((v_arrayElimArr_99 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_43| Int) (v_ArrVal_3155 Int) (v_arrayElimArr_101 (Array Int Int)) (v_ArrVal_3165 Int) (v_arrayElimArr_97 (Array Int Int)) (v_arrayElimArr_96 (Array Int Int)) (v_ArrVal_3152 Int)) (let ((.cse19 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| 8)) (.cse13 (select v_arrayElimArr_96 4))) (let ((.cse15 (let ((.cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse12 .cse10 v_ArrVal_3142)) .cse13 v_arrayElimArr_99) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_ArrVal_3155))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse22) |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_96) .cse13 (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse13 v_arrayElimArr_99) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse22) |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_96) .cse13) .cse19 v_ArrVal_3165))))) (let ((.cse14 (let ((.cse21 (store (select (store .cse9 .cse13 v_arrayElimArr_101) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_ArrVal_3152))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse21) |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_97) .cse13 (store (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_arrayElimArr_101) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse21) |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_97) .cse13) .cse19 0)))) (.cse16 (select (select .cse15 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) 4)) (.cse17 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 4))) (let ((.cse18 (select (select .cse14 .cse16) .cse17)) (.cse20 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (not (= (select |c_#valid| .cse13) 0)) (= (select (select .cse14 (select (select .cse15 .cse16) .cse17)) (+ .cse18 4)) 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (not (= (select v_arrayElimArr_101 .cse19) 0)) (< |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62| (select v_arrayElimArr_97 4)) (< (select (select .cse14 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) 4) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (= .cse13 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (not (= (select v_arrayElimArr_101 .cse20) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse18 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_99 .cse20))))))))) (< 0 |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_62|)))))) is different from false [2023-11-28 20:36:06,271 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:06,272 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:06,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:36:06,319 INFO L378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 403 treesize of output 408 [2023-11-28 20:36:06,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:06,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:07,214 INFO L349 Elim1Store]: treesize reduction 886, result has 24.3 percent of original size [2023-11-28 20:36:07,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 13417 treesize of output 11253 [2023-11-28 20:36:07,301 INFO L378 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 1476 treesize of output 1434 [2023-11-28 20:36:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:07,493 INFO L349 Elim1Store]: treesize reduction 31, result has 68.7 percent of original size [2023-11-28 20:36:07,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1909 treesize of output 1805 [2023-11-28 20:36:07,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:07,571 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:07,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:07,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:36:07,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 2420 treesize of output 2030 [2023-11-28 20:36:07,902 INFO L378 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 1452 treesize of output 1384 [2023-11-28 20:36:07,957 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:08,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:36:08,007 INFO L378 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 426 treesize of output 410 [2023-11-28 20:36:08,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:08,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:08,105 INFO L378 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 1272 treesize of output 1112 [2023-11-28 20:36:08,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:36:08,305 INFO L378 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 299 treesize of output 293 [2023-11-28 20:36:09,292 INFO L378 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 22 treesize of output 4 [2023-11-28 20:36:09,440 INFO L378 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 22 treesize of output 4 [2023-11-28 20:36:10,200 INFO L378 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 29 treesize of output 17 [2023-11-28 20:36:10,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:10,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:10,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:10,790 INFO L349 Elim1Store]: treesize reduction 172, result has 48.8 percent of original size [2023-11-28 20:36:10,790 INFO L378 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 4224 treesize of output 3494 [2023-11-28 20:36:10,892 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:10,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:10,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:36:10,932 INFO L378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 4007 treesize of output 3652 [2023-11-28 20:36:11,171 INFO L349 Elim1Store]: treesize reduction 92, result has 22.0 percent of original size [2023-11-28 20:36:11,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 4297 treesize of output 4166 [2023-11-28 20:36:11,349 INFO L378 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 3136 treesize of output 3098 [2023-11-28 20:36:11,459 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:11,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:11,476 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 2626 treesize of output 2482 [2023-11-28 20:36:11,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:11,586 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:11,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:11,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:36:11,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 2507 treesize of output 2179 [2023-11-28 20:36:11,795 INFO L378 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 299 treesize of output 277 [2023-11-28 20:36:11,818 INFO L378 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 29 treesize of output 23 [2023-11-28 20:36:12,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:36:12,078 INFO L378 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 61 treesize of output 53 [2023-11-28 20:36:12,294 INFO L378 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 17 treesize of output 9 [2023-11-28 20:36:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-28 20:36:13,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897143737] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:13,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:36:13,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 79 [2023-11-28 20:36:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087469944] [2023-11-28 20:36:13,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:13,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-28 20:36:13,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:13,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-28 20:36:13,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=5563, Unknown=23, NotChecked=456, Total=6320 [2023-11-28 20:36:13,554 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 80 states, 80 states have (on average 1.55) internal successors, (124), 79 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:19,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:36:23,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:36:27,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]