./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0214_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/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_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0214_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/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_b093d25e-3375-4978-ab55-83ddf1c5b391/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 8cac36e956b24d42ea840a07609fb159882a2e76b1195da25a4d4343e0b31026 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:39:57,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:39:57,324 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:39:57,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:39:57,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:39:57,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:39:57,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:39:57,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:39:57,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:39:57,358 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:39:57,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:39:57,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:39:57,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:39:57,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:39:57,361 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:39:57,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:39:57,362 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:39:57,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:39:57,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:39:57,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:39:57,364 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:39:57,364 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:39:57,365 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:39:57,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:39:57,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:39:57,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:39:57,367 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:39:57,367 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:39:57,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:39:57,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:39:57,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:39:57,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:39:57,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:39:57,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:39:57,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:39:57,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:39:57,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:39:57,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:39:57,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:39:57,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:39:57,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:39:57,371 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_b093d25e-3375-4978-ab55-83ddf1c5b391/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_b093d25e-3375-4978-ab55-83ddf1c5b391/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 -> 8cac36e956b24d42ea840a07609fb159882a2e76b1195da25a4d4343e0b31026 [2023-11-29 02:39:57,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:39:57,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:39:57,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:39:57,627 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:39:57,628 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:39:57,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-ext-properties/test-0214_1.i [2023-11-29 02:40:00,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:40:00,672 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:40:00,673 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/sv-benchmarks/c/list-ext-properties/test-0214_1.i [2023-11-29 02:40:00,689 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/data/3fa5d2191/6c766f4a19664d99bac39f6d41f9f4df/FLAGd8bdfb476 [2023-11-29 02:40:00,926 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/data/3fa5d2191/6c766f4a19664d99bac39f6d41f9f4df [2023-11-29 02:40:00,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:40:00,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:40:00,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:40:00,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:40:00,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:40:00,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:40:00" (1/1) ... [2023-11-29 02:40:00,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e372aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:00, skipping insertion in model container [2023-11-29 02:40:00,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:40:00" (1/1) ... [2023-11-29 02:40:00,995 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:40:01,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:40:01,322 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:40:01,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:40:01,406 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:40:01,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01 WrapperNode [2023-11-29 02:40:01,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:40:01,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:40:01,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:40:01,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:40:01,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,461 INFO L138 Inliner]: procedures = 181, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2023-11-29 02:40:01,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:40:01,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:40:01,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:40:01,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:40:01,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,506 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 7, 18]. 67 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 11 writes are split as follows [0, 5, 6]. [2023-11-29 02:40:01,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:40:01,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:40:01,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:40:01,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:40:01,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (1/1) ... [2023-11-29 02:40:01,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:40:01,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:01,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:40:01,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:40:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2023-11-29 02:40:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2023-11-29 02:40:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:40:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:40:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:40:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:40:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:40:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:40:01,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:40:01,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:40:01,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:40:01,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:40:01,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:40:01,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:40:01,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 02:40:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 02:40:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 02:40:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:40:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:40:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:40:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:40:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:40:01,754 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:40:01,756 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:40:02,168 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:40:02,212 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:40:02,213 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 02:40:02,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:40:02 BoogieIcfgContainer [2023-11-29 02:40:02,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:40:02,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:40:02,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:40:02,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:40:02,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:40:00" (1/3) ... [2023-11-29 02:40:02,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b99091e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:40:02, skipping insertion in model container [2023-11-29 02:40:02,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:40:01" (2/3) ... [2023-11-29 02:40:02,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b99091e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:40:02, skipping insertion in model container [2023-11-29 02:40:02,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:40:02" (3/3) ... [2023-11-29 02:40:02,222 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0214_1.i [2023-11-29 02:40:02,237 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:40:02,237 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2023-11-29 02:40:02,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:40:02,286 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;@514d2ed5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:40:02,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2023-11-29 02:40:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 72 states have (on average 2.125) internal successors, (153), 129 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:40:02,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:02,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:40:02,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:02,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 296113697, now seen corresponding path program 1 times [2023-11-29 02:40:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190049598] [2023-11-29 02:40:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:02,432 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-29 02:40:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:02,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190049598] [2023-11-29 02:40:02,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190049598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:02,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:02,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:40:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667626527] [2023-11-29 02:40:02,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:02,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:40:02,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:02,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:40:02,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:40:02,472 INFO L87 Difference]: Start difference. First operand has 133 states, 72 states have (on average 2.125) internal successors, (153), 129 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) 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-29 02:40:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:02,529 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2023-11-29 02:40:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:40:02,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) 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-29 02:40:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:02,539 INFO L225 Difference]: With dead ends: 133 [2023-11-29 02:40:02,539 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 02:40:02,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:40:02,544 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:02,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:40:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 02:40:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-11-29 02:40:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 2.0422535211267605) internal successors, (145), 127 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2023-11-29 02:40:02,588 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 5 [2023-11-29 02:40:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:02,588 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2023-11-29 02:40:02,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) 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-29 02:40:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2023-11-29 02:40:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:40:02,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:02,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:02,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:40:02,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:02,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1024117322, now seen corresponding path program 1 times [2023-11-29 02:40:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:02,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144616966] [2023-11-29 02:40:02,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:02,694 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-29 02:40:02,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:02,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144616966] [2023-11-29 02:40:02,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144616966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:02,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:02,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:40:02,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102201261] [2023-11-29 02:40:02,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:02,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:02,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:02,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:02,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:02,698 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-29 02:40:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:02,805 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2023-11-29 02:40:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:02,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-11-29 02:40:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:02,809 INFO L225 Difference]: With dead ends: 261 [2023-11-29 02:40:02,809 INFO L226 Difference]: Without dead ends: 261 [2023-11-29 02:40:02,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-29 02:40:02,811 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 146 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 388 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-29 02:40:02,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 388 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-29 02:40:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 133. [2023-11-29 02:40:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 129 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2023-11-29 02:40:02,826 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 7 [2023-11-29 02:40:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:02,827 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2023-11-29 02:40:02,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-29 02:40:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2023-11-29 02:40:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:40:02,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:02,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:02,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:40:02,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:02,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1025964364, now seen corresponding path program 1 times [2023-11-29 02:40:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922521407] [2023-11-29 02:40:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:02,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:02,971 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-29 02:40:02,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:02,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922521407] [2023-11-29 02:40:02,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922521407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:02,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:02,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:40:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87245805] [2023-11-29 02:40:02,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:02,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:02,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:02,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:02,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:02,974 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-29 02:40:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:03,153 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2023-11-29 02:40:03,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-11-29 02:40:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:03,158 INFO L225 Difference]: With dead ends: 242 [2023-11-29 02:40:03,158 INFO L226 Difference]: Without dead ends: 242 [2023-11-29 02:40:03,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:03,160 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 131 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:03,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 280 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-29 02:40:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 179. [2023-11-29 02:40:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 116 states have (on average 2.0) internal successors, (232), 173 states have internal predecessors, (232), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:40:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 240 transitions. [2023-11-29 02:40:03,179 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 240 transitions. Word has length 7 [2023-11-29 02:40:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:03,179 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 240 transitions. [2023-11-29 02:40:03,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-29 02:40:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 240 transitions. [2023-11-29 02:40:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:40:03,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:03,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:03,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:40:03,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:03,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1025964365, now seen corresponding path program 1 times [2023-11-29 02:40:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548092582] [2023-11-29 02:40:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:03,246 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-29 02:40:03,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:03,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548092582] [2023-11-29 02:40:03,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548092582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:03,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:03,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:40:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996896961] [2023-11-29 02:40:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:03,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:40:03,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:03,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:40:03,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:40:03,249 INFO L87 Difference]: Start difference. First operand 179 states and 240 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-29 02:40:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:03,426 INFO L93 Difference]: Finished difference Result 346 states and 463 transitions. [2023-11-29 02:40:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:40:03,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-11-29 02:40:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:03,431 INFO L225 Difference]: With dead ends: 346 [2023-11-29 02:40:03,431 INFO L226 Difference]: Without dead ends: 346 [2023-11-29 02:40:03,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-29 02:40:03,433 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 131 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:03,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-29 02:40:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 251. [2023-11-29 02:40:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 182 states have (on average 1.934065934065934) internal successors, (352), 240 states have internal predecessors, (352), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 368 transitions. [2023-11-29 02:40:03,453 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 368 transitions. Word has length 7 [2023-11-29 02:40:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:03,453 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 368 transitions. [2023-11-29 02:40:03,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-29 02:40:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 368 transitions. [2023-11-29 02:40:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:40:03,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:03,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:03,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:40:03,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:03,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1025964302, now seen corresponding path program 1 times [2023-11-29 02:40:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209980632] [2023-11-29 02:40:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:03,549 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-29 02:40:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209980632] [2023-11-29 02:40:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209980632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:03,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:03,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:40:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351007665] [2023-11-29 02:40:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:03,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:03,552 INFO L87 Difference]: Start difference. First operand 251 states and 368 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-29 02:40:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:03,713 INFO L93 Difference]: Finished difference Result 316 states and 405 transitions. [2023-11-29 02:40:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:03,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-11-29 02:40:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:03,716 INFO L225 Difference]: With dead ends: 316 [2023-11-29 02:40:03,716 INFO L226 Difference]: Without dead ends: 316 [2023-11-29 02:40:03,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:03,717 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 115 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:03,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 292 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-29 02:40:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 251. [2023-11-29 02:40:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 182 states have (on average 1.934065934065934) internal successors, (352), 240 states have internal predecessors, (352), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 368 transitions. [2023-11-29 02:40:03,732 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 368 transitions. Word has length 7 [2023-11-29 02:40:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:03,733 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 368 transitions. [2023-11-29 02:40:03,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-29 02:40:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 368 transitions. [2023-11-29 02:40:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 02:40:03,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:03,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:03,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:40:03,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:03,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:03,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1890770718, now seen corresponding path program 1 times [2023-11-29 02:40:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217812735] [2023-11-29 02:40:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:03,768 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-29 02:40:03,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:03,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217812735] [2023-11-29 02:40:03,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217812735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:03,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:03,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:40:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838003320] [2023-11-29 02:40:03,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:03,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:40:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:40:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:40:03,770 INFO L87 Difference]: Start difference. First operand 251 states and 368 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-29 02:40:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:03,821 INFO L93 Difference]: Finished difference Result 345 states and 459 transitions. [2023-11-29 02:40:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:40:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2023-11-29 02:40:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:03,826 INFO L225 Difference]: With dead ends: 345 [2023-11-29 02:40:03,826 INFO L226 Difference]: Without dead ends: 345 [2023-11-29 02:40:03,826 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-29 02:40:03,827 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 123 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:03,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 263 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:40:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-11-29 02:40:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 252. [2023-11-29 02:40:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 183 states have (on average 1.9180327868852458) internal successors, (351), 241 states have internal predecessors, (351), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 367 transitions. [2023-11-29 02:40:03,839 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 367 transitions. Word has length 9 [2023-11-29 02:40:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:03,840 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 367 transitions. [2023-11-29 02:40:03,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-29 02:40:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 367 transitions. [2023-11-29 02:40:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 02:40:03,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:03,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:03,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:40:03,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:03,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1515651170, now seen corresponding path program 1 times [2023-11-29 02:40:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970480693] [2023-11-29 02:40:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:03,866 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-29 02:40:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:03,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970480693] [2023-11-29 02:40:03,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970480693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:40:03,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443186661] [2023-11-29 02:40:03,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:03,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:40:03,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:03,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:40:03,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:40:03,868 INFO L87 Difference]: Start difference. First operand 252 states and 367 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-29 02:40:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:03,976 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2023-11-29 02:40:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:40:03,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2023-11-29 02:40:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:03,978 INFO L225 Difference]: With dead ends: 303 [2023-11-29 02:40:03,978 INFO L226 Difference]: Without dead ends: 297 [2023-11-29 02:40:03,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-29 02:40:03,979 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:03,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 203 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-29 02:40:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 249. [2023-11-29 02:40:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 180 states have (on average 1.9222222222222223) internal successors, (346), 238 states have internal predecessors, (346), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 362 transitions. [2023-11-29 02:40:03,990 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 362 transitions. Word has length 10 [2023-11-29 02:40:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:03,990 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 362 transitions. [2023-11-29 02:40:03,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-29 02:40:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 362 transitions. [2023-11-29 02:40:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 02:40:03,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:03,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:03,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:40:03,991 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:03,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:03,992 INFO L85 PathProgramCache]: Analyzing trace with hash 502972840, now seen corresponding path program 1 times [2023-11-29 02:40:03,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:03,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335958545] [2023-11-29 02:40:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:03,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:04,034 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-29 02:40:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335958545] [2023-11-29 02:40:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335958545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:04,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:04,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:40:04,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763113450] [2023-11-29 02:40:04,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:04,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:04,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:04,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:04,036 INFO L87 Difference]: Start difference. First operand 249 states and 362 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:04,107 INFO L93 Difference]: Finished difference Result 392 states and 555 transitions. [2023-11-29 02:40:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:04,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-29 02:40:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:04,111 INFO L225 Difference]: With dead ends: 392 [2023-11-29 02:40:04,111 INFO L226 Difference]: Without dead ends: 392 [2023-11-29 02:40:04,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-29 02:40:04,112 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 136 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:04,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 374 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-29 02:40:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 253. [2023-11-29 02:40:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 184 states have (on average 1.891304347826087) internal successors, (348), 242 states have internal predecessors, (348), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 364 transitions. [2023-11-29 02:40:04,124 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 364 transitions. Word has length 13 [2023-11-29 02:40:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:04,125 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 364 transitions. [2023-11-29 02:40:04,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 364 transitions. [2023-11-29 02:40:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 02:40:04,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:04,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:04,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:40:04,126 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:04,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1312319466, now seen corresponding path program 1 times [2023-11-29 02:40:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752434651] [2023-11-29 02:40:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:04,197 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-29 02:40:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:04,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752434651] [2023-11-29 02:40:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752434651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:04,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:04,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:40:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622676780] [2023-11-29 02:40:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:04,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:04,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:04,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:04,199 INFO L87 Difference]: Start difference. First operand 253 states and 364 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:04,413 INFO L93 Difference]: Finished difference Result 342 states and 453 transitions. [2023-11-29 02:40:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-29 02:40:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:04,416 INFO L225 Difference]: With dead ends: 342 [2023-11-29 02:40:04,416 INFO L226 Difference]: Without dead ends: 342 [2023-11-29 02:40:04,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:40:04,417 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 159 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:04,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 254 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-29 02:40:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 253. [2023-11-29 02:40:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 184 states have (on average 1.858695652173913) internal successors, (342), 242 states have internal predecessors, (342), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 358 transitions. [2023-11-29 02:40:04,428 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 358 transitions. Word has length 13 [2023-11-29 02:40:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:04,428 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 358 transitions. [2023-11-29 02:40:04,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 358 transitions. [2023-11-29 02:40:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 02:40:04,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:04,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:04,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:40:04,430 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:04,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1312319467, now seen corresponding path program 1 times [2023-11-29 02:40:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903303390] [2023-11-29 02:40:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:04,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:04,575 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-29 02:40:04,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:04,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903303390] [2023-11-29 02:40:04,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903303390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:04,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:04,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:40:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588496773] [2023-11-29 02:40:04,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:04,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:40:04,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:40:04,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:40:04,578 INFO L87 Difference]: Start difference. First operand 253 states and 358 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:04,830 INFO L93 Difference]: Finished difference Result 340 states and 432 transitions. [2023-11-29 02:40:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:40:04,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-29 02:40:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:04,833 INFO L225 Difference]: With dead ends: 340 [2023-11-29 02:40:04,833 INFO L226 Difference]: Without dead ends: 340 [2023-11-29 02:40:04,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:40:04,834 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 122 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:04,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 456 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-11-29 02:40:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 291. [2023-11-29 02:40:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 222 states have (on average 1.8558558558558558) internal successors, (412), 278 states have internal predecessors, (412), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 428 transitions. [2023-11-29 02:40:04,845 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 428 transitions. Word has length 13 [2023-11-29 02:40:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:04,846 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 428 transitions. [2023-11-29 02:40:04,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 428 transitions. [2023-11-29 02:40:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 02:40:04,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:04,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:04,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:40:04,847 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:04,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2036887780, now seen corresponding path program 1 times [2023-11-29 02:40:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:04,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608153887] [2023-11-29 02:40:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:40:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:04,914 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-29 02:40:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608153887] [2023-11-29 02:40:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608153887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:40:04,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062500943] [2023-11-29 02:40:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:04,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:04,917 INFO L87 Difference]: Start difference. First operand 291 states and 428 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:05,117 INFO L93 Difference]: Finished difference Result 377 states and 517 transitions. [2023-11-29 02:40:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:05,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-11-29 02:40:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:05,120 INFO L225 Difference]: With dead ends: 377 [2023-11-29 02:40:05,121 INFO L226 Difference]: Without dead ends: 377 [2023-11-29 02:40:05,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:40:05,122 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 127 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:05,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 262 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-11-29 02:40:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 297. [2023-11-29 02:40:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 228 states have (on average 1.8333333333333333) internal successors, (418), 284 states have internal predecessors, (418), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 434 transitions. [2023-11-29 02:40:05,133 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 434 transitions. Word has length 16 [2023-11-29 02:40:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:05,133 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 434 transitions. [2023-11-29 02:40:05,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 434 transitions. [2023-11-29 02:40:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 02:40:05,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:05,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:05,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:40:05,134 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:05,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2036887779, now seen corresponding path program 1 times [2023-11-29 02:40:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105165692] [2023-11-29 02:40:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:40:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:05,247 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-29 02:40:05,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:05,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105165692] [2023-11-29 02:40:05,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105165692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:05,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:05,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:40:05,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346390407] [2023-11-29 02:40:05,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:05,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:05,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:05,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:05,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:05,249 INFO L87 Difference]: Start difference. First operand 297 states and 434 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:05,420 INFO L93 Difference]: Finished difference Result 328 states and 430 transitions. [2023-11-29 02:40:05,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:05,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-11-29 02:40:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:05,424 INFO L225 Difference]: With dead ends: 328 [2023-11-29 02:40:05,424 INFO L226 Difference]: Without dead ends: 328 [2023-11-29 02:40:05,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:40:05,425 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 90 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:05,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 308 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-11-29 02:40:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 297. [2023-11-29 02:40:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 228 states have (on average 1.8070175438596492) internal successors, (412), 284 states have internal predecessors, (412), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 428 transitions. [2023-11-29 02:40:05,436 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 428 transitions. Word has length 16 [2023-11-29 02:40:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:05,436 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 428 transitions. [2023-11-29 02:40:05,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 428 transitions. [2023-11-29 02:40:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 02:40:05,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:05,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:05,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:40:05,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:05,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 947621635, now seen corresponding path program 1 times [2023-11-29 02:40:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:05,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70723673] [2023-11-29 02:40:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:05,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:05,486 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-29 02:40:05,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70723673] [2023-11-29 02:40:05,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70723673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:05,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:05,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:40:05,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16064473] [2023-11-29 02:40:05,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:05,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:40:05,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:05,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:40:05,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:40:05,488 INFO L87 Difference]: Start difference. First operand 297 states and 428 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:05,569 INFO L93 Difference]: Finished difference Result 294 states and 416 transitions. [2023-11-29 02:40:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:40:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-29 02:40:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:05,572 INFO L225 Difference]: With dead ends: 294 [2023-11-29 02:40:05,572 INFO L226 Difference]: Without dead ends: 294 [2023-11-29 02:40:05,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-29 02:40:05,573 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:05,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 205 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-11-29 02:40:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2023-11-29 02:40:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 228 states have (on average 1.7543859649122806) internal successors, (400), 281 states have internal predecessors, (400), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 416 transitions. [2023-11-29 02:40:05,584 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 416 transitions. Word has length 17 [2023-11-29 02:40:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:05,584 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 416 transitions. [2023-11-29 02:40:05,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 416 transitions. [2023-11-29 02:40:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 02:40:05,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:05,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:05,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:40:05,585 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:05,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash 947621636, now seen corresponding path program 1 times [2023-11-29 02:40:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928369788] [2023-11-29 02:40:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:05,670 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-29 02:40:05,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928369788] [2023-11-29 02:40:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928369788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:05,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:40:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91570328] [2023-11-29 02:40:05,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:05,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:05,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:05,672 INFO L87 Difference]: Start difference. First operand 294 states and 416 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:05,778 INFO L93 Difference]: Finished difference Result 324 states and 456 transitions. [2023-11-29 02:40:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:05,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-29 02:40:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:05,781 INFO L225 Difference]: With dead ends: 324 [2023-11-29 02:40:05,781 INFO L226 Difference]: Without dead ends: 324 [2023-11-29 02:40:05,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:05,782 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 23 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:05,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 310 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-11-29 02:40:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 301. [2023-11-29 02:40:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 236 states have (on average 1.7118644067796611) internal successors, (404), 288 states have internal predecessors, (404), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 420 transitions. [2023-11-29 02:40:05,792 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 420 transitions. Word has length 17 [2023-11-29 02:40:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:05,792 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 420 transitions. [2023-11-29 02:40:05,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 420 transitions. [2023-11-29 02:40:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 02:40:05,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:05,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:05,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:40:05,793 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:05,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:05,794 INFO L85 PathProgramCache]: Analyzing trace with hash -688500347, now seen corresponding path program 1 times [2023-11-29 02:40:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:05,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067567395] [2023-11-29 02:40:05,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:05,880 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-29 02:40:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067567395] [2023-11-29 02:40:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067567395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:05,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:40:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201749973] [2023-11-29 02:40:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:05,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:40:05,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:40:05,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:40:05,882 INFO L87 Difference]: Start difference. First operand 301 states and 420 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:05,956 INFO L93 Difference]: Finished difference Result 323 states and 452 transitions. [2023-11-29 02:40:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:40:05,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-29 02:40:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:05,959 INFO L225 Difference]: With dead ends: 323 [2023-11-29 02:40:05,959 INFO L226 Difference]: Without dead ends: 323 [2023-11-29 02:40:05,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:40:05,960 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 36 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:05,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 256 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-29 02:40:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 305. [2023-11-29 02:40:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 240 states have (on average 1.7) internal successors, (408), 292 states have internal predecessors, (408), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 424 transitions. [2023-11-29 02:40:05,970 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 424 transitions. Word has length 18 [2023-11-29 02:40:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:05,970 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 424 transitions. [2023-11-29 02:40:05,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 424 transitions. [2023-11-29 02:40:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 02:40:05,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:05,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:40:05,972 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:05,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash -688444643, now seen corresponding path program 1 times [2023-11-29 02:40:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:05,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958046598] [2023-11-29 02:40:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:05,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:06,053 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-29 02:40:06,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:06,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958046598] [2023-11-29 02:40:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958046598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:06,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:06,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:40:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701802358] [2023-11-29 02:40:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:06,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:40:06,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:06,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:40:06,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:40:06,055 INFO L87 Difference]: Start difference. First operand 305 states and 424 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:06,141 INFO L93 Difference]: Finished difference Result 287 states and 392 transitions. [2023-11-29 02:40:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:40:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-29 02:40:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:06,143 INFO L225 Difference]: With dead ends: 287 [2023-11-29 02:40:06,143 INFO L226 Difference]: Without dead ends: 287 [2023-11-29 02:40:06,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:40:06,144 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 81 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:06,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 666 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-11-29 02:40:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2023-11-29 02:40:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 224 states have (on average 1.6785714285714286) internal successors, (376), 274 states have internal predecessors, (376), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:40:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 392 transitions. [2023-11-29 02:40:06,154 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 392 transitions. Word has length 18 [2023-11-29 02:40:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:06,154 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 392 transitions. [2023-11-29 02:40:06,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 392 transitions. [2023-11-29 02:40:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 02:40:06,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:06,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:06,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:40:06,156 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:06,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1281251556, now seen corresponding path program 1 times [2023-11-29 02:40:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502881557] [2023-11-29 02:40:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:06,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:40:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:06,427 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-29 02:40:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502881557] [2023-11-29 02:40:06,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502881557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:06,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:06,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:40:06,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333180378] [2023-11-29 02:40:06,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:06,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:40:06,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:06,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:40:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:40:06,429 INFO L87 Difference]: Start difference. First operand 287 states and 392 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:06,686 INFO L93 Difference]: Finished difference Result 373 states and 489 transitions. [2023-11-29 02:40:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:40:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-29 02:40:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:06,690 INFO L225 Difference]: With dead ends: 373 [2023-11-29 02:40:06,690 INFO L226 Difference]: Without dead ends: 373 [2023-11-29 02:40:06,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:40:06,691 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 74 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:06,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 429 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-11-29 02:40:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 332. [2023-11-29 02:40:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 264 states have (on average 1.6590909090909092) internal successors, (438), 315 states have internal predecessors, (438), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:40:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 460 transitions. [2023-11-29 02:40:06,702 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 460 transitions. Word has length 20 [2023-11-29 02:40:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:06,702 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 460 transitions. [2023-11-29 02:40:06,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 460 transitions. [2023-11-29 02:40:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:40:06,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:06,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:06,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:40:06,704 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:06,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1064459312, now seen corresponding path program 1 times [2023-11-29 02:40:06,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:06,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897117378] [2023-11-29 02:40:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:40:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:06,772 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-29 02:40:06,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:06,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897117378] [2023-11-29 02:40:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897117378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:40:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80654593] [2023-11-29 02:40:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:06,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:40:06,774 INFO L87 Difference]: Start difference. First operand 332 states and 460 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:06,963 INFO L93 Difference]: Finished difference Result 408 states and 547 transitions. [2023-11-29 02:40:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:06,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-29 02:40:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:06,966 INFO L225 Difference]: With dead ends: 408 [2023-11-29 02:40:06,966 INFO L226 Difference]: Without dead ends: 408 [2023-11-29 02:40:06,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:40:06,967 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 139 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:06,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 251 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-11-29 02:40:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 352. [2023-11-29 02:40:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 284 states have (on average 1.6971830985915493) internal successors, (482), 335 states have internal predecessors, (482), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:40:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 504 transitions. [2023-11-29 02:40:06,980 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 504 transitions. Word has length 21 [2023-11-29 02:40:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:06,980 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 504 transitions. [2023-11-29 02:40:06,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 504 transitions. [2023-11-29 02:40:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:40:06,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:06,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:06,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:40:06,981 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:06,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1064459313, now seen corresponding path program 1 times [2023-11-29 02:40:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394291233] [2023-11-29 02:40:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:40:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:07,144 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-29 02:40:07,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394291233] [2023-11-29 02:40:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394291233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:40:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387132731] [2023-11-29 02:40:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:07,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:40:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:40:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:40:07,146 INFO L87 Difference]: Start difference. First operand 352 states and 504 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:07,339 INFO L93 Difference]: Finished difference Result 310 states and 393 transitions. [2023-11-29 02:40:07,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:40:07,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-29 02:40:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:07,342 INFO L225 Difference]: With dead ends: 310 [2023-11-29 02:40:07,342 INFO L226 Difference]: Without dead ends: 310 [2023-11-29 02:40:07,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:40:07,343 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:07,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 687 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-11-29 02:40:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 298. [2023-11-29 02:40:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 232 states have (on average 1.5991379310344827) internal successors, (371), 283 states have internal predecessors, (371), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 02:40:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 391 transitions. [2023-11-29 02:40:07,353 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 391 transitions. Word has length 21 [2023-11-29 02:40:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:07,353 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 391 transitions. [2023-11-29 02:40:07,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 391 transitions. [2023-11-29 02:40:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:40:07,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:07,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:07,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:40:07,355 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:07,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1650176371, now seen corresponding path program 1 times [2023-11-29 02:40:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979646444] [2023-11-29 02:40:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:07,631 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-29 02:40:07,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:07,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979646444] [2023-11-29 02:40:07,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979646444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:07,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:40:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58750960] [2023-11-29 02:40:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:07,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:40:07,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:40:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:40:07,633 INFO L87 Difference]: Start difference. First operand 298 states and 391 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:07,861 INFO L93 Difference]: Finished difference Result 308 states and 387 transitions. [2023-11-29 02:40:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:40:07,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-29 02:40:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:07,864 INFO L225 Difference]: With dead ends: 308 [2023-11-29 02:40:07,864 INFO L226 Difference]: Without dead ends: 308 [2023-11-29 02:40:07,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:40:07,865 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 61 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:07,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 704 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-11-29 02:40:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 296. [2023-11-29 02:40:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.5782608695652174) internal successors, (363), 281 states have internal predecessors, (363), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 02:40:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 383 transitions. [2023-11-29 02:40:07,874 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 383 transitions. Word has length 21 [2023-11-29 02:40:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:07,875 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 383 transitions. [2023-11-29 02:40:07,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 383 transitions. [2023-11-29 02:40:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 02:40:07,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:07,876 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] [2023-11-29 02:40:07,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:40:07,876 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:07,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 697659121, now seen corresponding path program 1 times [2023-11-29 02:40:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:07,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963487068] [2023-11-29 02:40:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:40:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:40:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963487068] [2023-11-29 02:40:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963487068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:07,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:07,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:40:07,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372311825] [2023-11-29 02:40:07,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:07,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:40:07,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:07,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:40:07,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:40:07,905 INFO L87 Difference]: Start difference. First operand 296 states and 383 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:07,935 INFO L93 Difference]: Finished difference Result 300 states and 386 transitions. [2023-11-29 02:40:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:40:07,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-11-29 02:40:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:07,937 INFO L225 Difference]: With dead ends: 300 [2023-11-29 02:40:07,937 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 02:40:07,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-29 02:40:07,938 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:07,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:40:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 02:40:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 02:40:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 284 states have internal predecessors, (365), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 02:40:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 385 transitions. [2023-11-29 02:40:07,949 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 385 transitions. Word has length 30 [2023-11-29 02:40:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:07,949 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 385 transitions. [2023-11-29 02:40:07,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 385 transitions. [2023-11-29 02:40:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 02:40:07,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:07,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:07,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:40:07,950 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:07,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1603163469, now seen corresponding path program 1 times [2023-11-29 02:40:07,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71299958] [2023-11-29 02:40:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:40:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:08,344 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-29 02:40:08,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:08,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71299958] [2023-11-29 02:40:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71299958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:40:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979874081] [2023-11-29 02:40:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:08,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:40:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:40:08,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:40:08,347 INFO L87 Difference]: Start difference. First operand 299 states and 385 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:08,593 INFO L93 Difference]: Finished difference Result 248 states and 311 transitions. [2023-11-29 02:40:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:40:08,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-11-29 02:40:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:08,595 INFO L225 Difference]: With dead ends: 248 [2023-11-29 02:40:08,596 INFO L226 Difference]: Without dead ends: 248 [2023-11-29 02:40:08,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:40:08,597 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 32 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:08,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 552 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-29 02:40:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2023-11-29 02:40:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 166 states have (on average 1.644578313253012) internal successors, (273), 216 states have internal predecessors, (273), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:40:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2023-11-29 02:40:08,604 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 30 [2023-11-29 02:40:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:08,605 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2023-11-29 02:40:08,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2023-11-29 02:40:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 02:40:08,606 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:08,606 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-29 02:40:08,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:40:08,606 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:08,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1548019960, now seen corresponding path program 1 times [2023-11-29 02:40:08,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:08,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428531207] [2023-11-29 02:40:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:40:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:40:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428531207] [2023-11-29 02:40:08,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428531207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:08,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:08,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:40:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894939978] [2023-11-29 02:40:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:08,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:40:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:40:08,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:40:08,657 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:08,686 INFO L93 Difference]: Finished difference Result 228 states and 287 transitions. [2023-11-29 02:40:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:40:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-11-29 02:40:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:08,688 INFO L225 Difference]: With dead ends: 228 [2023-11-29 02:40:08,688 INFO L226 Difference]: Without dead ends: 228 [2023-11-29 02:40:08,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-29 02:40:08,689 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:08,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:40:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-29 02:40:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2023-11-29 02:40:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 168 states have (on average 1.6369047619047619) internal successors, (275), 218 states have internal predecessors, (275), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:40:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 287 transitions. [2023-11-29 02:40:08,696 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 287 transitions. Word has length 36 [2023-11-29 02:40:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:08,696 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 287 transitions. [2023-11-29 02:40:08,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 287 transitions. [2023-11-29 02:40:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 02:40:08,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:08,697 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:40:08,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:40:08,698 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:08,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash -738673334, now seen corresponding path program 1 times [2023-11-29 02:40:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:08,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445656304] [2023-11-29 02:40:08,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:08,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:08,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:40:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:40:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445656304] [2023-11-29 02:40:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445656304] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900005258] [2023-11-29 02:40:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:08,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:08,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:08,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:08,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:40:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:09,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 02:40:09,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:09,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:40:09,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:40:09,724 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 23 [2023-11-29 02:40:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:40:09,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900005258] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:40:09,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:40:09,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-11-29 02:40:09,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890966882] [2023-11-29 02:40:09,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:40:09,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 02:40:09,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:09,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 02:40:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-11-29 02:40:09,935 INFO L87 Difference]: Start difference. First operand 228 states and 287 transitions. Second operand has 23 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 20 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:40:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:10,189 INFO L93 Difference]: Finished difference Result 222 states and 275 transitions. [2023-11-29 02:40:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:40:10,190 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 20 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-11-29 02:40:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:10,191 INFO L225 Difference]: With dead ends: 222 [2023-11-29 02:40:10,192 INFO L226 Difference]: Without dead ends: 222 [2023-11-29 02:40:10,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2023-11-29 02:40:10,193 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 404 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:10,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 590 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-29 02:40:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 214. [2023-11-29 02:40:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 160 states have (on average 1.58125) internal successors, (253), 204 states have internal predecessors, (253), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:40:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 265 transitions. [2023-11-29 02:40:10,200 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 265 transitions. Word has length 36 [2023-11-29 02:40:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:10,200 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 265 transitions. [2023-11-29 02:40:10,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 20 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:40:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 265 transitions. [2023-11-29 02:40:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 02:40:10,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:10,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:10,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:40:10,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:10,402 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:10,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2037362400, now seen corresponding path program 1 times [2023-11-29 02:40:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:10,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603208201] [2023-11-29 02:40:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:10,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:10,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 02:40:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:10,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:10,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603208201] [2023-11-29 02:40:10,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603208201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:10,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097710189] [2023-11-29 02:40:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:10,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:10,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:10,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:10,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:40:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:10,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:40:10,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:10,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:40:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097710189] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:40:10,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:40:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-29 02:40:10,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201464818] [2023-11-29 02:40:10,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:40:10,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:40:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:10,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:40:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:40:10,700 INFO L87 Difference]: Start difference. First operand 214 states and 265 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 02:40:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:10,854 INFO L93 Difference]: Finished difference Result 770 states and 981 transitions. [2023-11-29 02:40:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:40:10,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2023-11-29 02:40:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:10,860 INFO L225 Difference]: With dead ends: 770 [2023-11-29 02:40:10,860 INFO L226 Difference]: Without dead ends: 770 [2023-11-29 02:40:10,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:40:10,861 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 570 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:10,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 856 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2023-11-29 02:40:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 352. [2023-11-29 02:40:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 292 states have (on average 1.5034246575342465) internal successors, (439), 336 states have internal predecessors, (439), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:40:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 463 transitions. [2023-11-29 02:40:10,877 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 463 transitions. Word has length 39 [2023-11-29 02:40:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:10,878 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 463 transitions. [2023-11-29 02:40:10,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 02:40:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 463 transitions. [2023-11-29 02:40:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 02:40:10,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:10,879 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:10,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 02:40:11,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 02:40:11,081 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:11,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1336297822, now seen corresponding path program 1 times [2023-11-29 02:40:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17939090] [2023-11-29 02:40:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:11,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 02:40:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17939090] [2023-11-29 02:40:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17939090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492297351] [2023-11-29 02:40:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:11,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:11,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:11,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:11,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:40:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:11,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 02:40:11,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:11,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:40:11,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492297351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:11,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:40:11,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-11-29 02:40:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072411602] [2023-11-29 02:40:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:11,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:40:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:11,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:40:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:40:11,676 INFO L87 Difference]: Start difference. First operand 352 states and 463 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:11,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:11,836 INFO L93 Difference]: Finished difference Result 349 states and 457 transitions. [2023-11-29 02:40:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:40:11,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-11-29 02:40:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:11,839 INFO L225 Difference]: With dead ends: 349 [2023-11-29 02:40:11,839 INFO L226 Difference]: Without dead ends: 349 [2023-11-29 02:40:11,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:40:11,840 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 153 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:11,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 274 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-11-29 02:40:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2023-11-29 02:40:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 292 states have (on average 1.4828767123287672) internal successors, (433), 333 states have internal predecessors, (433), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:40:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 457 transitions. [2023-11-29 02:40:11,849 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 457 transitions. Word has length 39 [2023-11-29 02:40:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:11,849 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 457 transitions. [2023-11-29 02:40:11,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 457 transitions. [2023-11-29 02:40:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 02:40:11,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:11,850 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:11,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:40:12,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:12,051 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:12,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1707168410, now seen corresponding path program 1 times [2023-11-29 02:40:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896105151] [2023-11-29 02:40:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896105151] [2023-11-29 02:40:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896105151] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482484815] [2023-11-29 02:40:12,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:12,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:12,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:12,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:12,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 02:40:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:12,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:40:12,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:12,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:40:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:12,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482484815] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:40:12,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:40:12,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 7 [2023-11-29 02:40:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499761310] [2023-11-29 02:40:12,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:40:12,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:40:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:12,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:40:12,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:40:12,396 INFO L87 Difference]: Start difference. First operand 349 states and 457 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:40:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:12,551 INFO L93 Difference]: Finished difference Result 1245 states and 1614 transitions. [2023-11-29 02:40:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:40:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2023-11-29 02:40:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:12,559 INFO L225 Difference]: With dead ends: 1245 [2023-11-29 02:40:12,559 INFO L226 Difference]: Without dead ends: 1245 [2023-11-29 02:40:12,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:40:12,560 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 542 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:12,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 655 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2023-11-29 02:40:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 819. [2023-11-29 02:40:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 737 states have (on average 1.4640434192673) internal successors, (1079), 778 states have internal predecessors, (1079), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 02:40:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1141 transitions. [2023-11-29 02:40:12,593 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1141 transitions. Word has length 40 [2023-11-29 02:40:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:12,593 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1141 transitions. [2023-11-29 02:40:12,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:40:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1141 transitions. [2023-11-29 02:40:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 02:40:12,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:12,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:12,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 02:40:12,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 02:40:12,800 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:12,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1709015452, now seen corresponding path program 1 times [2023-11-29 02:40:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811187325] [2023-11-29 02:40:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:12,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:12,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:12,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811187325] [2023-11-29 02:40:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811187325] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:12,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658044528] [2023-11-29 02:40:12,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:12,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:12,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:12,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:12,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 02:40:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:13,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 02:40:13,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:13,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:40:13,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658044528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:13,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:40:13,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2023-11-29 02:40:13,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852977031] [2023-11-29 02:40:13,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:13,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:40:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:13,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:40:13,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:40:13,357 INFO L87 Difference]: Start difference. First operand 819 states and 1141 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:13,485 INFO L93 Difference]: Finished difference Result 835 states and 1157 transitions. [2023-11-29 02:40:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:40:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2023-11-29 02:40:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:13,489 INFO L225 Difference]: With dead ends: 835 [2023-11-29 02:40:13,489 INFO L226 Difference]: Without dead ends: 835 [2023-11-29 02:40:13,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:40:13,490 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 186 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:13,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 231 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2023-11-29 02:40:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 821. [2023-11-29 02:40:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 739 states have (on average 1.4641407307171854) internal successors, (1082), 780 states have internal predecessors, (1082), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 02:40:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1144 transitions. [2023-11-29 02:40:13,507 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1144 transitions. Word has length 40 [2023-11-29 02:40:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:13,507 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1144 transitions. [2023-11-29 02:40:13,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1144 transitions. [2023-11-29 02:40:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 02:40:13,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:13,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:13,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 02:40:13,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:13,709 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:13,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1709015390, now seen corresponding path program 1 times [2023-11-29 02:40:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:13,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299151822] [2023-11-29 02:40:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299151822] [2023-11-29 02:40:13,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299151822] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033479316] [2023-11-29 02:40:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:13,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:13,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:13,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:13,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 02:40:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:13,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 02:40:13,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:14,237 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:40:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033479316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:14,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:40:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2023-11-29 02:40:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788605270] [2023-11-29 02:40:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:14,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:40:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:40:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:40:14,239 INFO L87 Difference]: Start difference. First operand 821 states and 1144 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:14,415 INFO L93 Difference]: Finished difference Result 834 states and 1155 transitions. [2023-11-29 02:40:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:40:14,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2023-11-29 02:40:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:14,419 INFO L225 Difference]: With dead ends: 834 [2023-11-29 02:40:14,420 INFO L226 Difference]: Without dead ends: 834 [2023-11-29 02:40:14,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:40:14,420 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 247 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:14,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 334 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2023-11-29 02:40:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 818. [2023-11-29 02:40:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 737 states have (on average 1.4613297150610582) internal successors, (1077), 777 states have internal predecessors, (1077), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 02:40:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1139 transitions. [2023-11-29 02:40:14,440 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1139 transitions. Word has length 40 [2023-11-29 02:40:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:14,441 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1139 transitions. [2023-11-29 02:40:14,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1139 transitions. [2023-11-29 02:40:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 02:40:14,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:14,442 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:14,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 02:40:14,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:14,647 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:14,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1686295858, now seen corresponding path program 1 times [2023-11-29 02:40:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:14,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516295037] [2023-11-29 02:40:14,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:15,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:15,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:15,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516295037] [2023-11-29 02:40:15,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516295037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:15,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:15,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:40:15,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939038986] [2023-11-29 02:40:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:15,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:40:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:15,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:40:15,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:40:15,594 INFO L87 Difference]: Start difference. First operand 818 states and 1139 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:16,270 INFO L93 Difference]: Finished difference Result 837 states and 1160 transitions. [2023-11-29 02:40:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:40:16,271 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-11-29 02:40:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:16,275 INFO L225 Difference]: With dead ends: 837 [2023-11-29 02:40:16,275 INFO L226 Difference]: Without dead ends: 837 [2023-11-29 02:40:16,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:40:16,276 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 49 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:16,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1021 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:40:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2023-11-29 02:40:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 832. [2023-11-29 02:40:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 751 states have (on average 1.455392809587217) internal successors, (1093), 791 states have internal predecessors, (1093), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 02:40:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1155 transitions. [2023-11-29 02:40:16,294 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1155 transitions. Word has length 42 [2023-11-29 02:40:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:16,294 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1155 transitions. [2023-11-29 02:40:16,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1155 transitions. [2023-11-29 02:40:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:40:16,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:16,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:16,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 02:40:16,296 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:16,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash -987579494, now seen corresponding path program 1 times [2023-11-29 02:40:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:16,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111390967] [2023-11-29 02:40:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:17,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:17,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:17,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111390967] [2023-11-29 02:40:17,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111390967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:17,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:17,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 02:40:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114808035] [2023-11-29 02:40:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:17,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:40:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:17,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:40:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:40:17,022 INFO L87 Difference]: Start difference. First operand 832 states and 1155 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:17,392 INFO L93 Difference]: Finished difference Result 840 states and 1162 transitions. [2023-11-29 02:40:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:40:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2023-11-29 02:40:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:17,396 INFO L225 Difference]: With dead ends: 840 [2023-11-29 02:40:17,397 INFO L226 Difference]: Without dead ends: 840 [2023-11-29 02:40:17,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2023-11-29 02:40:17,397 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 50 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:17,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 538 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:40:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2023-11-29 02:40:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 832. [2023-11-29 02:40:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 751 states have (on average 1.4540612516644473) internal successors, (1092), 791 states have internal predecessors, (1092), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 02:40:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1154 transitions. [2023-11-29 02:40:17,418 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1154 transitions. Word has length 43 [2023-11-29 02:40:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:17,418 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1154 transitions. [2023-11-29 02:40:17,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1154 transitions. [2023-11-29 02:40:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:40:17,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:17,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:17,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 02:40:17,420 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:17,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1317263214, now seen corresponding path program 1 times [2023-11-29 02:40:17,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365304836] [2023-11-29 02:40:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:18,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:18,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:18,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365304836] [2023-11-29 02:40:18,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365304836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:18,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165403237] [2023-11-29 02:40:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:18,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:18,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:18,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:18,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 02:40:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:18,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 02:40:18,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:18,647 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-29 02:40:18,903 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:40:18,904 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 21 treesize of output 24 [2023-11-29 02:40:18,920 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-29 02:40:18,920 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 27 treesize of output 15 [2023-11-29 02:40:19,042 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 40 treesize of output 32 [2023-11-29 02:40:19,233 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 25 treesize of output 20 [2023-11-29 02:40:19,402 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 28 treesize of output 12 [2023-11-29 02:40:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:19,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:40:20,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 77 treesize of output 54 [2023-11-29 02:40:20,068 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 77 treesize of output 54 [2023-11-29 02:40:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165403237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:20,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:40:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2023-11-29 02:40:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462828622] [2023-11-29 02:40:20,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:40:20,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 02:40:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 02:40:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 02:40:20,264 INFO L87 Difference]: Start difference. First operand 832 states and 1154 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:21,704 INFO L93 Difference]: Finished difference Result 1052 states and 1440 transitions. [2023-11-29 02:40:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 02:40:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2023-11-29 02:40:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:21,710 INFO L225 Difference]: With dead ends: 1052 [2023-11-29 02:40:21,710 INFO L226 Difference]: Without dead ends: 1052 [2023-11-29 02:40:21,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=366, Invalid=2390, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 02:40:21,711 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 271 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:21,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1398 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:40:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2023-11-29 02:40:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 913. [2023-11-29 02:40:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 823 states have (on average 1.4434993924665858) internal successors, (1188), 866 states have internal predecessors, (1188), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 02:40:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1264 transitions. [2023-11-29 02:40:21,732 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1264 transitions. Word has length 43 [2023-11-29 02:40:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:21,733 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1264 transitions. [2023-11-29 02:40:21,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1264 transitions. [2023-11-29 02:40:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:40:21,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:21,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:21,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 02:40:21,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:21,934 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:21,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1317263213, now seen corresponding path program 1 times [2023-11-29 02:40:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131959829] [2023-11-29 02:40:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:23,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:23,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131959829] [2023-11-29 02:40:23,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131959829] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103642966] [2023-11-29 02:40:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:23,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:23,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:23,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:23,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 02:40:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:23,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 02:40:23,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:23,437 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-29 02:40:23,751 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:40:23,751 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 21 treesize of output 24 [2023-11-29 02:40:23,765 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:40:23,765 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 21 treesize of output 20 [2023-11-29 02:40:24,048 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-29 02:40:24,057 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 33 treesize of output 24 [2023-11-29 02:40:24,330 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 36 treesize of output 16 [2023-11-29 02:40:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:24,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:40:25,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:40:25,890 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 365 treesize of output 370 [2023-11-29 02:40:36,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103642966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:36,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:40:36,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 28 [2023-11-29 02:40:36,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147878419] [2023-11-29 02:40:36,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:40:36,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 02:40:36,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 02:40:36,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1398, Unknown=1, NotChecked=0, Total=1560 [2023-11-29 02:40:36,165 INFO L87 Difference]: Start difference. First operand 913 states and 1264 transitions. Second operand has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 27 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:40,048 INFO L93 Difference]: Finished difference Result 1308 states and 1818 transitions. [2023-11-29 02:40:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:40:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 27 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2023-11-29 02:40:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:40,056 INFO L225 Difference]: With dead ends: 1308 [2023-11-29 02:40:40,056 INFO L226 Difference]: Without dead ends: 1308 [2023-11-29 02:40:40,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=409, Invalid=2896, Unknown=1, NotChecked=0, Total=3306 [2023-11-29 02:40:40,058 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 302 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:40,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 2200 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:40:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2023-11-29 02:40:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1138. [2023-11-29 02:40:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1029 states have (on average 1.466472303206997) internal successors, (1509), 1079 states have internal predecessors, (1509), 51 states have call successors, (51), 18 states have call predecessors, (51), 18 states have return successors, (51), 40 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-29 02:40:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1611 transitions. [2023-11-29 02:40:40,079 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1611 transitions. Word has length 43 [2023-11-29 02:40:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:40,080 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1611 transitions. [2023-11-29 02:40:40,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 27 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1611 transitions. [2023-11-29 02:40:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:40:40,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:40,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:40,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 02:40:40,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:40,283 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:40,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1317203632, now seen corresponding path program 1 times [2023-11-29 02:40:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:40,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108686493] [2023-11-29 02:40:40,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:40,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:40,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108686493] [2023-11-29 02:40:40,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108686493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:40,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:40,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:40:40,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314365373] [2023-11-29 02:40:40,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:40,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:40:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:40:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:40:40,544 INFO L87 Difference]: Start difference. First operand 1138 states and 1611 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:40,962 INFO L93 Difference]: Finished difference Result 1444 states and 2050 transitions. [2023-11-29 02:40:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:40:40,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2023-11-29 02:40:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:40,971 INFO L225 Difference]: With dead ends: 1444 [2023-11-29 02:40:40,971 INFO L226 Difference]: Without dead ends: 1444 [2023-11-29 02:40:40,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:40:40,971 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:40,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 461 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:40:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-11-29 02:40:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1340. [2023-11-29 02:40:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1220 states have (on average 1.472950819672131) internal successors, (1797), 1270 states have internal predecessors, (1797), 60 states have call successors, (60), 20 states have call predecessors, (60), 20 states have return successors, (60), 49 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 02:40:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1917 transitions. [2023-11-29 02:40:40,998 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1917 transitions. Word has length 43 [2023-11-29 02:40:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:40,998 INFO L495 AbstractCegarLoop]: Abstraction has 1340 states and 1917 transitions. [2023-11-29 02:40:40,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1917 transitions. [2023-11-29 02:40:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:40:40,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:41,000 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:41,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 02:40:41,000 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:41,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1317203631, now seen corresponding path program 1 times [2023-11-29 02:40:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:41,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736129241] [2023-11-29 02:40:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:41,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:41,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:41,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736129241] [2023-11-29 02:40:41,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736129241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:41,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:41,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 02:40:41,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007892133] [2023-11-29 02:40:41,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:41,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:40:41,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:40:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:40:41,730 INFO L87 Difference]: Start difference. First operand 1340 states and 1917 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:42,428 INFO L93 Difference]: Finished difference Result 1969 states and 2836 transitions. [2023-11-29 02:40:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 02:40:42,428 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2023-11-29 02:40:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:42,437 INFO L225 Difference]: With dead ends: 1969 [2023-11-29 02:40:42,437 INFO L226 Difference]: Without dead ends: 1969 [2023-11-29 02:40:42,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2023-11-29 02:40:42,438 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 281 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:42,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 820 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:40:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2023-11-29 02:40:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1830. [2023-11-29 02:40:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1685 states have (on average 1.4997032640949555) internal successors, (2527), 1735 states have internal predecessors, (2527), 80 states have call successors, (80), 25 states have call predecessors, (80), 25 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 02:40:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2687 transitions. [2023-11-29 02:40:42,462 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2687 transitions. Word has length 43 [2023-11-29 02:40:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:42,462 INFO L495 AbstractCegarLoop]: Abstraction has 1830 states and 2687 transitions. [2023-11-29 02:40:42,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2687 transitions. [2023-11-29 02:40:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 02:40:42,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:42,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:42,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 02:40:42,463 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:42,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash -923482783, now seen corresponding path program 1 times [2023-11-29 02:40:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:42,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362652594] [2023-11-29 02:40:42,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:42,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:43,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:40:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:43,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362652594] [2023-11-29 02:40:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362652594] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083154066] [2023-11-29 02:40:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:43,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:43,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:43,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:43,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 02:40:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:43,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 02:40:43,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:43,738 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 33 treesize of output 21 [2023-11-29 02:40:43,742 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 33 treesize of output 21 [2023-11-29 02:40:44,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:40:44,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:40:44,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 110 [2023-11-29 02:40:44,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:40:44,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:40:44,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 66 [2023-11-29 02:40:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:44,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:40:45,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:40:45,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:40:45,370 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 3 case distinctions, treesize of input 254 treesize of output 252 [2023-11-29 02:40:45,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:40:45,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:40:45,394 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 214 treesize of output 200 [2023-11-29 02:40:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:46,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083154066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:40:46,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:40:46,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 37 [2023-11-29 02:40:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550491712] [2023-11-29 02:40:46,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:40:46,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 02:40:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:46,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 02:40:46,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 02:40:46,016 INFO L87 Difference]: Start difference. First operand 1830 states and 2687 transitions. Second operand has 37 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:40:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:51,140 INFO L93 Difference]: Finished difference Result 2371 states and 3277 transitions. [2023-11-29 02:40:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-29 02:40:51,141 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-11-29 02:40:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:51,150 INFO L225 Difference]: With dead ends: 2371 [2023-11-29 02:40:51,150 INFO L226 Difference]: Without dead ends: 2364 [2023-11-29 02:40:51,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=888, Invalid=6768, Unknown=0, NotChecked=0, Total=7656 [2023-11-29 02:40:51,153 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 973 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:51,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 2955 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 02:40:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2023-11-29 02:40:51,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 1955. [2023-11-29 02:40:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1793 states have (on average 1.4963747908533185) internal successors, (2683), 1850 states have internal predecessors, (2683), 92 states have call successors, (92), 30 states have call predecessors, (92), 30 states have return successors, (92), 74 states have call predecessors, (92), 92 states have call successors, (92) [2023-11-29 02:40:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2867 transitions. [2023-11-29 02:40:51,183 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2867 transitions. Word has length 44 [2023-11-29 02:40:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:51,184 INFO L495 AbstractCegarLoop]: Abstraction has 1955 states and 2867 transitions. [2023-11-29 02:40:51,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:40:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2867 transitions. [2023-11-29 02:40:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 02:40:51,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:51,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:51,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 02:40:51,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-29 02:40:51,386 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:51,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:51,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1131892409, now seen corresponding path program 1 times [2023-11-29 02:40:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:51,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482049189] [2023-11-29 02:40:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:51,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:51,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482049189] [2023-11-29 02:40:51,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482049189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:51,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:40:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:40:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3145720] [2023-11-29 02:40:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:51,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:40:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:40:51,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:40:51,764 INFO L87 Difference]: Start difference. First operand 1955 states and 2867 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:52,010 INFO L93 Difference]: Finished difference Result 1821 states and 2636 transitions. [2023-11-29 02:40:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:40:52,011 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-11-29 02:40:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:52,019 INFO L225 Difference]: With dead ends: 1821 [2023-11-29 02:40:52,020 INFO L226 Difference]: Without dead ends: 1821 [2023-11-29 02:40:52,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:40:52,020 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 158 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:52,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 651 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2023-11-29 02:40:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2023-11-29 02:40:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1671 states have (on average 1.4769599042489527) internal successors, (2468), 1722 states have internal predecessors, (2468), 84 states have call successors, (84), 27 states have call predecessors, (84), 27 states have return successors, (84), 71 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-29 02:40:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2636 transitions. [2023-11-29 02:40:52,046 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2636 transitions. Word has length 44 [2023-11-29 02:40:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:52,047 INFO L495 AbstractCegarLoop]: Abstraction has 1821 states and 2636 transitions. [2023-11-29 02:40:52,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2636 transitions. [2023-11-29 02:40:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 02:40:52,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:52,048 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:52,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 02:40:52,049 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:52,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2114512042, now seen corresponding path program 1 times [2023-11-29 02:40:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658042373] [2023-11-29 02:40:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:52,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:52,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:52,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658042373] [2023-11-29 02:40:52,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658042373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:52,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071120505] [2023-11-29 02:40:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:52,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:52,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:52,112 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:52,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 02:40:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:52,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:40:52,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:52,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:40:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071120505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:52,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:40:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-29 02:40:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375764172] [2023-11-29 02:40:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:52,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:40:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:52,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:40:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:40:52,267 INFO L87 Difference]: Start difference. First operand 1821 states and 2636 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:52,310 INFO L93 Difference]: Finished difference Result 2459 states and 3614 transitions. [2023-11-29 02:40:52,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:40:52,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-11-29 02:40:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:52,321 INFO L225 Difference]: With dead ends: 2459 [2023-11-29 02:40:52,321 INFO L226 Difference]: Without dead ends: 2459 [2023-11-29 02:40:52,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-29 02:40:52,322 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 184 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:52,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:40:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2023-11-29 02:40:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2310. [2023-11-29 02:40:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2143 states have (on average 1.5151656556229585) internal successors, (3247), 2194 states have internal predecessors, (3247), 101 states have call successors, (101), 27 states have call predecessors, (101), 27 states have return successors, (101), 88 states have call predecessors, (101), 101 states have call successors, (101) [2023-11-29 02:40:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3449 transitions. [2023-11-29 02:40:52,351 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3449 transitions. Word has length 44 [2023-11-29 02:40:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:52,352 INFO L495 AbstractCegarLoop]: Abstraction has 2310 states and 3449 transitions. [2023-11-29 02:40:52,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:40:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3449 transitions. [2023-11-29 02:40:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:40:52,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:52,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:52,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 02:40:52,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-29 02:40:52,553 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:52,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:52,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1437171540, now seen corresponding path program 1 times [2023-11-29 02:40:52,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:52,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965140941] [2023-11-29 02:40:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:52,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:52,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:40:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:52,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965140941] [2023-11-29 02:40:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965140941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:52,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344338601] [2023-11-29 02:40:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:52,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:52,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:52,735 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:52,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 02:40:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:52,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 02:40:52,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:53,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:40:53,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344338601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:40:53,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:40:53,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-11-29 02:40:53,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683606950] [2023-11-29 02:40:53,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:40:53,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:40:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:53,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:40:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:40:53,140 INFO L87 Difference]: Start difference. First operand 2310 states and 3449 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:53,336 INFO L93 Difference]: Finished difference Result 2307 states and 3353 transitions. [2023-11-29 02:40:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:40:53,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2023-11-29 02:40:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:53,346 INFO L225 Difference]: With dead ends: 2307 [2023-11-29 02:40:53,346 INFO L226 Difference]: Without dead ends: 2307 [2023-11-29 02:40:53,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:40:53,347 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 272 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:53,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 247 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:40:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2023-11-29 02:40:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2023-11-29 02:40:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2143 states have (on average 1.4703686420905273) internal successors, (3151), 2191 states have internal predecessors, (3151), 101 states have call successors, (101), 27 states have call predecessors, (101), 27 states have return successors, (101), 88 states have call predecessors, (101), 101 states have call successors, (101) [2023-11-29 02:40:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3353 transitions. [2023-11-29 02:40:53,379 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3353 transitions. Word has length 45 [2023-11-29 02:40:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:53,379 INFO L495 AbstractCegarLoop]: Abstraction has 2307 states and 3353 transitions. [2023-11-29 02:40:53,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:40:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3353 transitions. [2023-11-29 02:40:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:40:53,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:53,380 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:53,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-29 02:40:53,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-29 02:40:53,581 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:53,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:53,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2022888598, now seen corresponding path program 1 times [2023-11-29 02:40:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:53,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472245318] [2023-11-29 02:40:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:40:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:54,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472245318] [2023-11-29 02:40:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472245318] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716392316] [2023-11-29 02:40:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:54,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:54,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:54,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 02:40:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:54,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:40:54,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:54,663 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-29 02:40:54,876 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-29 02:40:54,964 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 25 treesize of output 20 [2023-11-29 02:40:55,196 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-29 02:40:55,196 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 23 treesize of output 24 [2023-11-29 02:40:55,199 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 28 treesize of output 12 [2023-11-29 02:40:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:55,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:40:55,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716392316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:55,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:40:55,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2023-11-29 02:40:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92061564] [2023-11-29 02:40:55,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:40:55,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 02:40:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 02:40:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2023-11-29 02:40:55,331 INFO L87 Difference]: Start difference. First operand 2307 states and 3353 transitions. Second operand has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 24 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:40:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:40:56,782 INFO L93 Difference]: Finished difference Result 3331 states and 4788 transitions. [2023-11-29 02:40:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 02:40:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 24 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2023-11-29 02:40:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:40:56,791 INFO L225 Difference]: With dead ends: 3331 [2023-11-29 02:40:56,791 INFO L226 Difference]: Without dead ends: 3331 [2023-11-29 02:40:56,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=535, Invalid=2657, Unknown=0, NotChecked=0, Total=3192 [2023-11-29 02:40:56,793 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 704 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:40:56,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1585 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:40:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2023-11-29 02:40:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 2508. [2023-11-29 02:40:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 2325 states have (on average 1.4455913978494623) internal successors, (3361), 2376 states have internal predecessors, (3361), 114 states have call successors, (114), 33 states have call predecessors, (114), 33 states have return successors, (114), 98 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-29 02:40:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3589 transitions. [2023-11-29 02:40:56,826 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3589 transitions. Word has length 45 [2023-11-29 02:40:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:40:56,827 INFO L495 AbstractCegarLoop]: Abstraction has 2508 states and 3589 transitions. [2023-11-29 02:40:56,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 24 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:40:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3589 transitions. [2023-11-29 02:40:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:40:56,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:40:56,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:40:56,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 02:40:57,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-29 02:40:57,029 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:40:57,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:40:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2022888599, now seen corresponding path program 1 times [2023-11-29 02:40:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:40:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989850818] [2023-11-29 02:40:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:40:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:40:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:58,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:40:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:40:58,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:40:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989850818] [2023-11-29 02:40:58,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989850818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530136809] [2023-11-29 02:40:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:40:58,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:40:58,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:40:58,159 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:40:58,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 02:40:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:40:58,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-29 02:40:58,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:40:58,443 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-29 02:40:58,453 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-29 02:40:58,738 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-29 02:40:58,746 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-29 02:40:58,898 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-29 02:40:58,904 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 34 treesize of output 25 [2023-11-29 02:40:59,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:40:59,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-29 02:40:59,298 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:40:59,298 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-29 02:40:59,301 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 28 treesize of output 12 [2023-11-29 02:40:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:40:59,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:40:59,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530136809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:40:59,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:40:59,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2023-11-29 02:40:59,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937563394] [2023-11-29 02:40:59,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:40:59,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 02:40:59,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:40:59,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 02:40:59,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 02:40:59,676 INFO L87 Difference]: Start difference. First operand 2508 states and 3589 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 27 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:41:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:02,383 INFO L93 Difference]: Finished difference Result 3437 states and 4879 transitions. [2023-11-29 02:41:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:41:02,384 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 27 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2023-11-29 02:41:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:02,390 INFO L225 Difference]: With dead ends: 3437 [2023-11-29 02:41:02,390 INFO L226 Difference]: Without dead ends: 3437 [2023-11-29 02:41:02,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=678, Invalid=3744, Unknown=0, NotChecked=0, Total=4422 [2023-11-29 02:41:02,392 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 561 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:02,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 2131 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:41:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2023-11-29 02:41:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2508. [2023-11-29 02:41:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 2325 states have (on average 1.4288172043010752) internal successors, (3322), 2376 states have internal predecessors, (3322), 114 states have call successors, (114), 33 states have call predecessors, (114), 33 states have return successors, (114), 98 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-29 02:41:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3550 transitions. [2023-11-29 02:41:02,421 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3550 transitions. Word has length 45 [2023-11-29 02:41:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:02,421 INFO L495 AbstractCegarLoop]: Abstraction has 2508 states and 3550 transitions. [2023-11-29 02:41:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 27 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:41:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3550 transitions. [2023-11-29 02:41:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:41:02,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:02,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:02,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 02:41:02,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:41:02,622 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:02,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1125443572, now seen corresponding path program 1 times [2023-11-29 02:41:02,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:02,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705930999] [2023-11-29 02:41:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:02,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705930999] [2023-11-29 02:41:03,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705930999] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102518899] [2023-11-29 02:41:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:03,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:41:03,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:41:03,490 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:41:03,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 02:41:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:03,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 02:41:03,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:03,943 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:41:03,943 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 21 treesize of output 24 [2023-11-29 02:41:04,266 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2023-11-29 02:41:04,267 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 2 case distinctions, treesize of input 66 treesize of output 53 [2023-11-29 02:41:04,272 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 33 treesize of output 21 [2023-11-29 02:41:04,607 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 17 [2023-11-29 02:41:04,610 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 49 treesize of output 25 [2023-11-29 02:41:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:04,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:41:05,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:41:05,102 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 50 treesize of output 53 [2023-11-29 02:41:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102518899] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:22,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:41:22,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 27 [2023-11-29 02:41:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876323626] [2023-11-29 02:41:22,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:41:22,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 02:41:22,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:41:22,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 02:41:22,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1337, Unknown=4, NotChecked=0, Total=1482 [2023-11-29 02:41:22,063 INFO L87 Difference]: Start difference. First operand 2508 states and 3550 transitions. Second operand has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 26 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:41:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:24,249 INFO L93 Difference]: Finished difference Result 2694 states and 3798 transitions. [2023-11-29 02:41:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 02:41:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 26 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2023-11-29 02:41:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:24,254 INFO L225 Difference]: With dead ends: 2694 [2023-11-29 02:41:24,254 INFO L226 Difference]: Without dead ends: 2694 [2023-11-29 02:41:24,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=449, Invalid=2969, Unknown=4, NotChecked=0, Total=3422 [2023-11-29 02:41:24,256 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 357 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:24,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2151 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:41:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2023-11-29 02:41:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2518. [2023-11-29 02:41:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2335 states have (on average 1.4286937901498928) internal successors, (3336), 2386 states have internal predecessors, (3336), 114 states have call successors, (114), 33 states have call predecessors, (114), 33 states have return successors, (114), 98 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-29 02:41:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3564 transitions. [2023-11-29 02:41:24,284 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3564 transitions. Word has length 45 [2023-11-29 02:41:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:24,284 INFO L495 AbstractCegarLoop]: Abstraction has 2518 states and 3564 transitions. [2023-11-29 02:41:24,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 26 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:41:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3564 transitions. [2023-11-29 02:41:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:41:24,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:24,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:24,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 02:41:24,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:41:24,486 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:24,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1182701874, now seen corresponding path program 1 times [2023-11-29 02:41:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484161867] [2023-11-29 02:41:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:24,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484161867] [2023-11-29 02:41:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484161867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:24,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:24,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:41:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592587295] [2023-11-29 02:41:24,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:24,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:41:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:41:24,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:41:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:41:24,709 INFO L87 Difference]: Start difference. First operand 2518 states and 3564 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:41:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:25,090 INFO L93 Difference]: Finished difference Result 2856 states and 4050 transitions. [2023-11-29 02:41:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:41:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-11-29 02:41:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:25,095 INFO L225 Difference]: With dead ends: 2856 [2023-11-29 02:41:25,095 INFO L226 Difference]: Without dead ends: 2856 [2023-11-29 02:41:25,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:41:25,096 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 156 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:25,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 647 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:41:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2023-11-29 02:41:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2757. [2023-11-29 02:41:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2757 states, 2562 states have (on average 1.4383294301327088) internal successors, (3685), 2613 states have internal predecessors, (3685), 123 states have call successors, (123), 36 states have call predecessors, (123), 36 states have return successors, (123), 107 states have call predecessors, (123), 123 states have call successors, (123) [2023-11-29 02:41:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3931 transitions. [2023-11-29 02:41:25,130 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3931 transitions. Word has length 45 [2023-11-29 02:41:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:25,131 INFO L495 AbstractCegarLoop]: Abstraction has 2757 states and 3931 transitions. [2023-11-29 02:41:25,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:41:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3931 transitions. [2023-11-29 02:41:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 02:41:25,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:25,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:25,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 02:41:25,133 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:25,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1751518536, now seen corresponding path program 1 times [2023-11-29 02:41:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807065503] [2023-11-29 02:41:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:25,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:41:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 02:41:25,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:25,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807065503] [2023-11-29 02:41:25,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807065503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:25,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:25,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:41:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698913354] [2023-11-29 02:41:25,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:25,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:41:25,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:41:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:41:25,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:41:25,237 INFO L87 Difference]: Start difference. First operand 2757 states and 3931 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:41:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:25,335 INFO L93 Difference]: Finished difference Result 2775 states and 3929 transitions. [2023-11-29 02:41:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:41:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-11-29 02:41:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:25,341 INFO L225 Difference]: With dead ends: 2775 [2023-11-29 02:41:25,341 INFO L226 Difference]: Without dead ends: 2775 [2023-11-29 02:41:25,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:41:25,341 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 156 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:25,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 323 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:41:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2023-11-29 02:41:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2755. [2023-11-29 02:41:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2562 states have (on average 1.4297423887587821) internal successors, (3663), 2611 states have internal predecessors, (3663), 123 states have call successors, (123), 36 states have call predecessors, (123), 36 states have return successors, (123), 107 states have call predecessors, (123), 123 states have call successors, (123) [2023-11-29 02:41:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3909 transitions. [2023-11-29 02:41:25,377 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3909 transitions. Word has length 48 [2023-11-29 02:41:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:25,377 INFO L495 AbstractCegarLoop]: Abstraction has 2755 states and 3909 transitions. [2023-11-29 02:41:25,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:41:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3909 transitions. [2023-11-29 02:41:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 02:41:25,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:25,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:25,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 02:41:25,379 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:25,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1575028529, now seen corresponding path program 1 times [2023-11-29 02:41:25,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:25,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409180697] [2023-11-29 02:41:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:25,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:25,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409180697] [2023-11-29 02:41:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409180697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374128059] [2023-11-29 02:41:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:25,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:41:25,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:41:25,464 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:41:25,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 02:41:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:25,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:41:25,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:25,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:41:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374128059] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:41:25,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:41:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2023-11-29 02:41:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287465450] [2023-11-29 02:41:25,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:41:25,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:41:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:41:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:41:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:41:25,776 INFO L87 Difference]: Start difference. First operand 2755 states and 3909 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:41:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:25,902 INFO L93 Difference]: Finished difference Result 5189 states and 7447 transitions. [2023-11-29 02:41:25,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:41:25,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2023-11-29 02:41:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:25,915 INFO L225 Difference]: With dead ends: 5189 [2023-11-29 02:41:25,915 INFO L226 Difference]: Without dead ends: 5189 [2023-11-29 02:41:25,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:41:25,916 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 246 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:25,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 541 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:41:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2023-11-29 02:41:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 4017. [2023-11-29 02:41:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 3770 states have (on average 1.459946949602122) internal successors, (5504), 3822 states have internal predecessors, (5504), 177 states have call successors, (177), 36 states have call predecessors, (177), 36 states have return successors, (177), 158 states have call predecessors, (177), 177 states have call successors, (177) [2023-11-29 02:41:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5858 transitions. [2023-11-29 02:41:25,989 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5858 transitions. Word has length 48 [2023-11-29 02:41:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:25,989 INFO L495 AbstractCegarLoop]: Abstraction has 4017 states and 5858 transitions. [2023-11-29 02:41:25,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:41:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5858 transitions. [2023-11-29 02:41:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 02:41:25,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:25,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:25,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 02:41:26,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-11-29 02:41:26,191 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:26,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1537502789, now seen corresponding path program 1 times [2023-11-29 02:41:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179115090] [2023-11-29 02:41:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:26,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:41:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:41:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179115090] [2023-11-29 02:41:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179115090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157330068] [2023-11-29 02:41:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:26,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:41:26,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:41:26,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:41:26,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 02:41:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:27,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:41:27,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:27,235 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-29 02:41:27,475 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:41:27,476 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 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-29 02:41:27,490 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-29 02:41:27,491 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 27 treesize of output 15 [2023-11-29 02:41:27,586 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 40 treesize of output 32 [2023-11-29 02:41:27,793 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 0 case distinctions, treesize of input 40 treesize of output 27 [2023-11-29 02:41:28,118 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 36 treesize of output 16 [2023-11-29 02:41:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:28,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:41:29,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:41:29,045 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 217 treesize of output 222 [2023-11-29 02:41:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157330068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:30,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:41:30,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 27 [2023-11-29 02:41:30,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139960511] [2023-11-29 02:41:30,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:41:30,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 02:41:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:41:30,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 02:41:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 02:41:30,651 INFO L87 Difference]: Start difference. First operand 4017 states and 5858 transitions. Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 25 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:41:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:33,516 INFO L93 Difference]: Finished difference Result 5348 states and 7646 transitions. [2023-11-29 02:41:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:41:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 25 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2023-11-29 02:41:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:33,524 INFO L225 Difference]: With dead ends: 5348 [2023-11-29 02:41:33,524 INFO L226 Difference]: Without dead ends: 5348 [2023-11-29 02:41:33,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=627, Invalid=4923, Unknown=0, NotChecked=0, Total=5550 [2023-11-29 02:41:33,526 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 504 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:33,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1900 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:41:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5348 states. [2023-11-29 02:41:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5348 to 4748. [2023-11-29 02:41:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4748 states, 4453 states have (on average 1.4572198517853132) internal successors, (6489), 4526 states have internal predecessors, (6489), 218 states have call successors, (218), 43 states have call predecessors, (218), 43 states have return successors, (218), 178 states have call predecessors, (218), 218 states have call successors, (218) [2023-11-29 02:41:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6925 transitions. [2023-11-29 02:41:33,596 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6925 transitions. Word has length 49 [2023-11-29 02:41:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:33,596 INFO L495 AbstractCegarLoop]: Abstraction has 4748 states and 6925 transitions. [2023-11-29 02:41:33,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 25 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:41:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6925 transitions. [2023-11-29 02:41:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 02:41:33,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:33,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:33,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 02:41:33,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-11-29 02:41:33,798 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:33,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1537477530, now seen corresponding path program 1 times [2023-11-29 02:41:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030085201] [2023-11-29 02:41:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:34,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:41:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 02:41:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030085201] [2023-11-29 02:41:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030085201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:41:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065862667] [2023-11-29 02:41:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:41:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:41:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:41:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:41:34,185 INFO L87 Difference]: Start difference. First operand 4748 states and 6925 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:41:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:34,497 INFO L93 Difference]: Finished difference Result 4841 states and 7031 transitions. [2023-11-29 02:41:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:41:34,498 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2023-11-29 02:41:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:34,505 INFO L225 Difference]: With dead ends: 4841 [2023-11-29 02:41:34,505 INFO L226 Difference]: Without dead ends: 4841 [2023-11-29 02:41:34,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-29 02:41:34,506 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 185 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:34,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 539 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:41:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2023-11-29 02:41:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 4748. [2023-11-29 02:41:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4748 states, 4453 states have (on average 1.4502582528632382) internal successors, (6458), 4526 states have internal predecessors, (6458), 218 states have call successors, (218), 43 states have call predecessors, (218), 43 states have return successors, (218), 178 states have call predecessors, (218), 218 states have call successors, (218) [2023-11-29 02:41:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6894 transitions. [2023-11-29 02:41:34,560 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6894 transitions. Word has length 49 [2023-11-29 02:41:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:34,561 INFO L495 AbstractCegarLoop]: Abstraction has 4748 states and 6894 transitions. [2023-11-29 02:41:34,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:41:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6894 transitions. [2023-11-29 02:41:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 02:41:34,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:34,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:34,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 02:41:34,562 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:34,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1581242859, now seen corresponding path program 1 times [2023-11-29 02:41:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654555457] [2023-11-29 02:41:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:35,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:35,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654555457] [2023-11-29 02:41:35,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654555457] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:35,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284040117] [2023-11-29 02:41:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:35,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:41:35,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:41:35,398 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:41:35,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 02:41:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:35,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 02:41:35,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:35,968 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:41:35,968 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 21 treesize of output 24 [2023-11-29 02:41:36,362 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2023-11-29 02:41:36,363 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 2 case distinctions, treesize of input 66 treesize of output 53 [2023-11-29 02:41:36,371 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 33 treesize of output 21 [2023-11-29 02:41:36,768 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 69 treesize of output 37 [2023-11-29 02:41:36,781 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 21 treesize of output 13 [2023-11-29 02:41:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:37,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:41:37,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:41:37,344 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 50 treesize of output 53 [2023-11-29 02:41:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284040117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:38,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:41:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2023-11-29 02:41:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748944702] [2023-11-29 02:41:38,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:41:38,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 02:41:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:41:38,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 02:41:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1501, Unknown=1, NotChecked=0, Total=1640 [2023-11-29 02:41:38,240 INFO L87 Difference]: Start difference. First operand 4748 states and 6894 transitions. Second operand has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:41:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:40,887 INFO L93 Difference]: Finished difference Result 4803 states and 6952 transitions. [2023-11-29 02:41:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:41:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2023-11-29 02:41:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:40,897 INFO L225 Difference]: With dead ends: 4803 [2023-11-29 02:41:40,897 INFO L226 Difference]: Without dead ends: 4794 [2023-11-29 02:41:40,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=336, Invalid=2969, Unknown=1, NotChecked=0, Total=3306 [2023-11-29 02:41:40,899 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 203 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:40,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1902 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:41:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2023-11-29 02:41:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 4748. [2023-11-29 02:41:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4748 states, 4453 states have (on average 1.4500336851560744) internal successors, (6457), 4526 states have internal predecessors, (6457), 218 states have call successors, (218), 43 states have call predecessors, (218), 43 states have return successors, (218), 178 states have call predecessors, (218), 218 states have call successors, (218) [2023-11-29 02:41:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6893 transitions. [2023-11-29 02:41:40,971 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6893 transitions. Word has length 49 [2023-11-29 02:41:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:40,971 INFO L495 AbstractCegarLoop]: Abstraction has 4748 states and 6893 transitions. [2023-11-29 02:41:40,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:41:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6893 transitions. [2023-11-29 02:41:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 02:41:40,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:40,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:40,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 02:41:41,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-11-29 02:41:41,172 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:41,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:41,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1188215849, now seen corresponding path program 1 times [2023-11-29 02:41:41,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:41,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201247707] [2023-11-29 02:41:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:41,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:41,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201247707] [2023-11-29 02:41:41,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201247707] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746475499] [2023-11-29 02:41:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:41,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:41:41,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:41:41,483 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:41:41,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 02:41:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:41,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 02:41:41,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:42,052 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 19 treesize of output 1 [2023-11-29 02:41:42,358 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:41:42,359 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 41 treesize of output 17 [2023-11-29 02:41:42,382 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 13 treesize of output 9 [2023-11-29 02:41:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:42,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:41:42,481 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 44 treesize of output 38 [2023-11-29 02:41:55,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746475499] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:55,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:41:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-11-29 02:41:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598710380] [2023-11-29 02:41:55,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:41:55,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:41:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:41:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:41:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=612, Unknown=3, NotChecked=0, Total=702 [2023-11-29 02:41:55,874 INFO L87 Difference]: Start difference. First operand 4748 states and 6893 transitions. Second operand has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:41:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:56,686 INFO L93 Difference]: Finished difference Result 4797 states and 6945 transitions. [2023-11-29 02:41:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:41:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2023-11-29 02:41:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:56,694 INFO L225 Difference]: With dead ends: 4797 [2023-11-29 02:41:56,694 INFO L226 Difference]: Without dead ends: 4785 [2023-11-29 02:41:56,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=166, Invalid=1021, Unknown=3, NotChecked=0, Total=1190 [2023-11-29 02:41:56,695 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 278 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:56,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 916 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:41:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2023-11-29 02:41:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4742. [2023-11-29 02:41:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4742 states, 4447 states have (on average 1.4499662693950979) internal successors, (6448), 4520 states have internal predecessors, (6448), 218 states have call successors, (218), 43 states have call predecessors, (218), 43 states have return successors, (218), 178 states have call predecessors, (218), 218 states have call successors, (218) [2023-11-29 02:41:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4742 states to 4742 states and 6884 transitions. [2023-11-29 02:41:56,768 INFO L78 Accepts]: Start accepts. Automaton has 4742 states and 6884 transitions. Word has length 49 [2023-11-29 02:41:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:56,769 INFO L495 AbstractCegarLoop]: Abstraction has 4742 states and 6884 transitions. [2023-11-29 02:41:56,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:41:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 6884 transitions. [2023-11-29 02:41:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 02:41:56,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:56,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:56,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 02:41:56,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-11-29 02:41:56,971 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:41:56,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash 417163383, now seen corresponding path program 1 times [2023-11-29 02:41:56,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:41:56,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558447107] [2023-11-29 02:41:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:56,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:41:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:41:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:41:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:41:57,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:41:57,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558447107] [2023-11-29 02:41:57,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558447107] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:41:57,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308009897] [2023-11-29 02:41:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:57,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:41:57,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:41:57,757 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:41:57,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 02:41:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:57,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 02:41:57,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:58,250 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:41:58,251 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 21 treesize of output 24 [2023-11-29 02:41:58,563 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 33 treesize of output 21 [2023-11-29 02:41:58,582 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2023-11-29 02:41:58,582 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 2 case distinctions, treesize of input 66 treesize of output 53 [2023-11-29 02:41:59,025 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 53 treesize of output 29 [2023-11-29 02:41:59,028 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 21 treesize of output 13 [2023-11-29 02:41:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:59,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:41:59,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:41:59,410 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 50 treesize of output 53 [2023-11-29 02:42:13,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308009897] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:13,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:13,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 28 [2023-11-29 02:42:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454934530] [2023-11-29 02:42:13,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:13,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 02:42:13,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 02:42:13,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1182, Unknown=3, NotChecked=0, Total=1332 [2023-11-29 02:42:13,663 INFO L87 Difference]: Start difference. First operand 4742 states and 6884 transitions. Second operand has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:15,712 INFO L93 Difference]: Finished difference Result 4865 states and 7004 transitions. [2023-11-29 02:42:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:42:15,713 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 50 [2023-11-29 02:42:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:15,719 INFO L225 Difference]: With dead ends: 4865 [2023-11-29 02:42:15,719 INFO L226 Difference]: Without dead ends: 4865 [2023-11-29 02:42:15,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=378, Invalid=2699, Unknown=3, NotChecked=0, Total=3080 [2023-11-29 02:42:15,720 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 199 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:15,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1927 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:42:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2023-11-29 02:42:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4742. [2023-11-29 02:42:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4742 states, 4447 states have (on average 1.4486170451990106) internal successors, (6442), 4520 states have internal predecessors, (6442), 218 states have call successors, (218), 43 states have call predecessors, (218), 43 states have return successors, (218), 178 states have call predecessors, (218), 218 states have call successors, (218) [2023-11-29 02:42:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4742 states to 4742 states and 6878 transitions. [2023-11-29 02:42:15,787 INFO L78 Accepts]: Start accepts. Automaton has 4742 states and 6878 transitions. Word has length 50 [2023-11-29 02:42:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:15,787 INFO L495 AbstractCegarLoop]: Abstraction has 4742 states and 6878 transitions. [2023-11-29 02:42:15,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 6878 transitions. [2023-11-29 02:42:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 02:42:15,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:15,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:15,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 02:42:15,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-11-29 02:42:15,989 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:15,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:15,990 INFO L85 PathProgramCache]: Analyzing trace with hash 47163196, now seen corresponding path program 1 times [2023-11-29 02:42:15,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:15,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997969620] [2023-11-29 02:42:15,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:15,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:16,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:42:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:42:16,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997969620] [2023-11-29 02:42:16,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997969620] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:16,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189419742] [2023-11-29 02:42:16,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:16,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:16,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:16,642 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:16,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 02:42:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:16,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 02:42:16,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:16,936 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-29 02:42:17,223 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:42:17,223 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 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-29 02:42:17,241 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-29 02:42:17,241 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 27 treesize of output 15 [2023-11-29 02:42:17,329 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 40 treesize of output 32 [2023-11-29 02:42:17,556 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 0 case distinctions, treesize of input 40 treesize of output 27 [2023-11-29 02:42:17,803 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 36 treesize of output 16 [2023-11-29 02:42:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:17,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:18,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:42:18,746 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 217 treesize of output 222 [2023-11-29 02:42:20,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189419742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:20,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:20,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 27 [2023-11-29 02:42:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934832867] [2023-11-29 02:42:20,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:20,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 02:42:20,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:20,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 02:42:20,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 02:42:20,275 INFO L87 Difference]: Start difference. First operand 4742 states and 6878 transitions. Second operand has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:21,660 INFO L93 Difference]: Finished difference Result 4835 states and 6974 transitions. [2023-11-29 02:42:21,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:42:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2023-11-29 02:42:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:21,665 INFO L225 Difference]: With dead ends: 4835 [2023-11-29 02:42:21,665 INFO L226 Difference]: Without dead ends: 4835 [2023-11-29 02:42:21,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=363, Invalid=2187, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 02:42:21,666 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 183 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:21,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1324 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:42:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2023-11-29 02:42:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 4754. [2023-11-29 02:42:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 4459 states have (on average 1.446961202063243) internal successors, (6452), 4532 states have internal predecessors, (6452), 218 states have call successors, (218), 43 states have call predecessors, (218), 43 states have return successors, (218), 178 states have call predecessors, (218), 218 states have call successors, (218) [2023-11-29 02:42:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6888 transitions. [2023-11-29 02:42:21,712 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6888 transitions. Word has length 51 [2023-11-29 02:42:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:21,712 INFO L495 AbstractCegarLoop]: Abstraction has 4754 states and 6888 transitions. [2023-11-29 02:42:21,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6888 transitions. [2023-11-29 02:42:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 02:42:21,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:21,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:21,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 02:42:21,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:21,914 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:21,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1462059289, now seen corresponding path program 1 times [2023-11-29 02:42:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229160120] [2023-11-29 02:42:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:22,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:42:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:42:22,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:22,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229160120] [2023-11-29 02:42:22,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229160120] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:22,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791637808] [2023-11-29 02:42:22,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:22,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:22,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:22,650 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:22,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 02:42:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:22,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 02:42:22,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:23,004 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:42:23,005 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 11 treesize of output 11 [2023-11-29 02:42:23,324 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:42:23,325 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 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-29 02:42:23,340 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-29 02:42:23,340 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 27 treesize of output 15 [2023-11-29 02:42:23,434 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 40 treesize of output 32 [2023-11-29 02:42:23,703 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 0 case distinctions, treesize of input 39 treesize of output 26 [2023-11-29 02:42:23,981 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 35 treesize of output 15 [2023-11-29 02:42:24,035 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 02:42:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:24,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:24,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:42:24,482 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 38 treesize of output 42 [2023-11-29 02:42:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791637808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:25,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2023-11-29 02:42:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341913971] [2023-11-29 02:42:25,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:25,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 02:42:25,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 02:42:25,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 02:42:25,719 INFO L87 Difference]: Start difference. First operand 4754 states and 6888 transitions. Second operand has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 30 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:27,679 INFO L93 Difference]: Finished difference Result 5089 states and 7301 transitions. [2023-11-29 02:42:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 02:42:27,679 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 30 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2023-11-29 02:42:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:27,683 INFO L225 Difference]: With dead ends: 5089 [2023-11-29 02:42:27,684 INFO L226 Difference]: Without dead ends: 5089 [2023-11-29 02:42:27,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=549, Invalid=3483, Unknown=0, NotChecked=0, Total=4032 [2023-11-29 02:42:27,684 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 404 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:27,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1087 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:42:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5089 states. [2023-11-29 02:42:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5089 to 4913. [2023-11-29 02:42:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 4607 states have (on average 1.4441067940091166) internal successors, (6653), 4681 states have internal predecessors, (6653), 225 states have call successors, (225), 47 states have call predecessors, (225), 47 states have return successors, (225), 184 states have call predecessors, (225), 225 states have call successors, (225) [2023-11-29 02:42:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 7103 transitions. [2023-11-29 02:42:27,743 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 7103 transitions. Word has length 52 [2023-11-29 02:42:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:27,744 INFO L495 AbstractCegarLoop]: Abstraction has 4913 states and 7103 transitions. [2023-11-29 02:42:27,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 30 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 7103 transitions. [2023-11-29 02:42:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 02:42:27,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:27,745 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:27,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 02:42:27,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:27,946 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:27,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1920802082, now seen corresponding path program 1 times [2023-11-29 02:42:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129897675] [2023-11-29 02:42:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:28,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:42:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 02:42:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129897675] [2023-11-29 02:42:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129897675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:42:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979464260] [2023-11-29 02:42:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:28,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:42:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:42:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:42:28,066 INFO L87 Difference]: Start difference. First operand 4913 states and 7103 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:28,194 INFO L93 Difference]: Finished difference Result 4963 states and 7096 transitions. [2023-11-29 02:42:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:42:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2023-11-29 02:42:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:28,200 INFO L225 Difference]: With dead ends: 4963 [2023-11-29 02:42:28,200 INFO L226 Difference]: Without dead ends: 4963 [2023-11-29 02:42:28,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:42:28,201 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 175 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:28,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 297 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:42:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4963 states. [2023-11-29 02:42:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4963 to 4912. [2023-11-29 02:42:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4912 states, 4607 states have (on average 1.4315172563490342) internal successors, (6595), 4680 states have internal predecessors, (6595), 225 states have call successors, (225), 47 states have call predecessors, (225), 47 states have return successors, (225), 184 states have call predecessors, (225), 225 states have call successors, (225) [2023-11-29 02:42:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 7045 transitions. [2023-11-29 02:42:28,249 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 7045 transitions. Word has length 53 [2023-11-29 02:42:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:28,249 INFO L495 AbstractCegarLoop]: Abstraction has 4912 states and 7045 transitions. [2023-11-29 02:42:28,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 7045 transitions. [2023-11-29 02:42:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 02:42:28,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:28,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:28,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-11-29 02:42:28,251 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:28,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2147295489, now seen corresponding path program 1 times [2023-11-29 02:42:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369316481] [2023-11-29 02:42:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:28,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:28,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:42:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:42:28,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369316481] [2023-11-29 02:42:28,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369316481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:28,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:28,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:42:28,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548634290] [2023-11-29 02:42:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:28,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:42:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:42:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:42:28,586 INFO L87 Difference]: Start difference. First operand 4912 states and 7045 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:42:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:28,903 INFO L93 Difference]: Finished difference Result 3933 states and 5615 transitions. [2023-11-29 02:42:28,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:42:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2023-11-29 02:42:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:28,907 INFO L225 Difference]: With dead ends: 3933 [2023-11-29 02:42:28,907 INFO L226 Difference]: Without dead ends: 3933 [2023-11-29 02:42:28,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:42:28,907 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 111 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:28,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1057 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:42:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2023-11-29 02:42:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3794. [2023-11-29 02:42:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3543 states have (on average 1.4397403330510867) internal successors, (5101), 3615 states have internal predecessors, (5101), 169 states have call successors, (169), 49 states have call predecessors, (169), 49 states have return successors, (169), 129 states have call predecessors, (169), 169 states have call successors, (169) [2023-11-29 02:42:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5439 transitions. [2023-11-29 02:42:28,945 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5439 transitions. Word has length 59 [2023-11-29 02:42:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:28,946 INFO L495 AbstractCegarLoop]: Abstraction has 3794 states and 5439 transitions. [2023-11-29 02:42:28,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:42:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5439 transitions. [2023-11-29 02:42:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 02:42:28,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:28,947 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:28,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-11-29 02:42:28,947 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:28,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1286961215, now seen corresponding path program 1 times [2023-11-29 02:42:28,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:28,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677715166] [2023-11-29 02:42:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:28,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:29,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 02:42:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:29,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 02:42:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 02:42:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677715166] [2023-11-29 02:42:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677715166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:29,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:29,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:42:29,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257382159] [2023-11-29 02:42:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:29,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:42:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:42:29,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:42:29,485 INFO L87 Difference]: Start difference. First operand 3794 states and 5439 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:42:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:30,004 INFO L93 Difference]: Finished difference Result 4884 states and 6946 transitions. [2023-11-29 02:42:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 02:42:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-11-29 02:42:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:30,009 INFO L225 Difference]: With dead ends: 4884 [2023-11-29 02:42:30,009 INFO L226 Difference]: Without dead ends: 4884 [2023-11-29 02:42:30,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2023-11-29 02:42:30,010 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 215 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:30,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 568 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:42:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2023-11-29 02:42:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4653. [2023-11-29 02:42:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4350 states have (on average 1.4289655172413793) internal successors, (6216), 4417 states have internal predecessors, (6216), 203 states have call successors, (203), 67 states have call predecessors, (203), 67 states have return successors, (203), 168 states have call predecessors, (203), 203 states have call successors, (203) [2023-11-29 02:42:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 6622 transitions. [2023-11-29 02:42:30,055 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 6622 transitions. Word has length 64 [2023-11-29 02:42:30,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:30,055 INFO L495 AbstractCegarLoop]: Abstraction has 4653 states and 6622 transitions. [2023-11-29 02:42:30,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:42:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 6622 transitions. [2023-11-29 02:42:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 02:42:30,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:30,056 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:30,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-11-29 02:42:30,057 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:30,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1440644351, now seen corresponding path program 2 times [2023-11-29 02:42:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:30,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381250633] [2023-11-29 02:42:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:30,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:42:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 02:42:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 02:42:30,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:30,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381250633] [2023-11-29 02:42:30,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381250633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:30,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:30,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:42:30,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900224055] [2023-11-29 02:42:30,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:30,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:42:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:30,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:42:30,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:42:30,555 INFO L87 Difference]: Start difference. First operand 4653 states and 6622 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:42:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:31,316 INFO L93 Difference]: Finished difference Result 5486 states and 7766 transitions. [2023-11-29 02:42:31,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 02:42:31,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-11-29 02:42:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:31,322 INFO L225 Difference]: With dead ends: 5486 [2023-11-29 02:42:31,322 INFO L226 Difference]: Without dead ends: 5486 [2023-11-29 02:42:31,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:42:31,322 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 324 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:31,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1156 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:42:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5486 states. [2023-11-29 02:42:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5486 to 4639. [2023-11-29 02:42:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4639 states, 4326 states have (on average 1.4091539528432733) internal successors, (6096), 4400 states have internal predecessors, (6096), 211 states have call successors, (211), 69 states have call predecessors, (211), 69 states have return successors, (211), 169 states have call predecessors, (211), 211 states have call successors, (211) [2023-11-29 02:42:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 6518 transitions. [2023-11-29 02:42:31,380 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 6518 transitions. Word has length 64 [2023-11-29 02:42:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:31,381 INFO L495 AbstractCegarLoop]: Abstraction has 4639 states and 6518 transitions. [2023-11-29 02:42:31,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:42:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 6518 transitions. [2023-11-29 02:42:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 02:42:31,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:31,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:31,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-11-29 02:42:31,383 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:31,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash -327537597, now seen corresponding path program 1 times [2023-11-29 02:42:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776641731] [2023-11-29 02:42:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:31,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:42:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 02:42:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 02:42:31,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776641731] [2023-11-29 02:42:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776641731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928100412] [2023-11-29 02:42:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:31,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:31,605 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:31,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-29 02:42:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:31,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 02:42:31,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 02:42:32,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:32,084 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 02:42:32,085 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 12 treesize of output 11 [2023-11-29 02:42:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 02:42:32,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928100412] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:32,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:42:32,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-29 02:42:32,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971617282] [2023-11-29 02:42:32,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:32,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:42:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:32,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:42:32,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:42:32,107 INFO L87 Difference]: Start difference. First operand 4639 states and 6518 transitions. Second operand has 12 states, 11 states have (on average 10.363636363636363) internal successors, (114), 12 states have internal predecessors, (114), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 02:42:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:32,363 INFO L93 Difference]: Finished difference Result 5564 states and 7393 transitions. [2023-11-29 02:42:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:42:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.363636363636363) internal successors, (114), 12 states have internal predecessors, (114), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2023-11-29 02:42:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:32,369 INFO L225 Difference]: With dead ends: 5564 [2023-11-29 02:42:32,369 INFO L226 Difference]: Without dead ends: 5564 [2023-11-29 02:42:32,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 02:42:32,369 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 372 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:32,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 334 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:42:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5564 states. [2023-11-29 02:42:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5564 to 5426. [2023-11-29 02:42:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5426 states, 5063 states have (on average 1.3288564092435315) internal successors, (6728), 5142 states have internal predecessors, (6728), 256 states have call successors, (256), 80 states have call predecessors, (256), 80 states have return successors, (256), 203 states have call predecessors, (256), 256 states have call successors, (256) [2023-11-29 02:42:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5426 states to 5426 states and 7240 transitions. [2023-11-29 02:42:32,423 INFO L78 Accepts]: Start accepts. Automaton has 5426 states and 7240 transitions. Word has length 66 [2023-11-29 02:42:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:32,424 INFO L495 AbstractCegarLoop]: Abstraction has 5426 states and 7240 transitions. [2023-11-29 02:42:32,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.363636363636363) internal successors, (114), 12 states have internal predecessors, (114), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 02:42:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5426 states and 7240 transitions. [2023-11-29 02:42:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 02:42:32,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:32,425 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:32,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-29 02:42:32,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:32,626 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:32,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash 175270795, now seen corresponding path program 1 times [2023-11-29 02:42:32,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:32,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676147023] [2023-11-29 02:42:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:32,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:33,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:42:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:42:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:33,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676147023] [2023-11-29 02:42:33,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676147023] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:33,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047426446] [2023-11-29 02:42:33,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:33,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:33,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:33,371 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:33,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 02:42:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:33,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 02:42:33,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:33,739 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-29 02:42:34,005 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:42:34,005 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 21 treesize of output 24 [2023-11-29 02:42:34,019 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-29 02:42:34,020 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 27 treesize of output 15 [2023-11-29 02:42:34,103 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 40 treesize of output 32 [2023-11-29 02:42:34,241 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 25 treesize of output 20 [2023-11-29 02:42:34,383 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 02:42:34,384 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 21 treesize of output 29 [2023-11-29 02:42:34,699 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2023-11-29 02:42:34,699 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 2 case distinctions, treesize of input 54 treesize of output 41 [2023-11-29 02:42:35,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:42:35,278 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 77 treesize of output 49 [2023-11-29 02:42:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:35,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:35,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047426446] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:35,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:35,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 29 [2023-11-29 02:42:35,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650115808] [2023-11-29 02:42:35,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:35,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 02:42:35,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:35,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 02:42:35,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 02:42:35,751 INFO L87 Difference]: Start difference. First operand 5426 states and 7240 transitions. Second operand has 29 states, 29 states have (on average 4.275862068965517) internal successors, (124), 28 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:38,528 INFO L93 Difference]: Finished difference Result 6342 states and 8224 transitions. [2023-11-29 02:42:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 02:42:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.275862068965517) internal successors, (124), 28 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 66 [2023-11-29 02:42:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:38,535 INFO L225 Difference]: With dead ends: 6342 [2023-11-29 02:42:38,536 INFO L226 Difference]: Without dead ends: 6342 [2023-11-29 02:42:38,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=493, Invalid=3667, Unknown=0, NotChecked=0, Total=4160 [2023-11-29 02:42:38,536 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 621 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:38,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 2206 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 02:42:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6342 states. [2023-11-29 02:42:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6342 to 5944. [2023-11-29 02:42:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5944 states, 5540 states have (on average 1.3005415162454874) internal successors, (7205), 5632 states have internal predecessors, (7205), 285 states have call successors, (285), 92 states have call predecessors, (285), 92 states have return successors, (285), 219 states have call predecessors, (285), 285 states have call successors, (285) [2023-11-29 02:42:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5944 states to 5944 states and 7775 transitions. [2023-11-29 02:42:38,619 INFO L78 Accepts]: Start accepts. Automaton has 5944 states and 7775 transitions. Word has length 66 [2023-11-29 02:42:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:38,619 INFO L495 AbstractCegarLoop]: Abstraction has 5944 states and 7775 transitions. [2023-11-29 02:42:38,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.275862068965517) internal successors, (124), 28 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5944 states and 7775 transitions. [2023-11-29 02:42:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 02:42:38,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:38,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:38,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-29 02:42:38,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:38,822 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:38,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:38,822 INFO L85 PathProgramCache]: Analyzing trace with hash 982106274, now seen corresponding path program 1 times [2023-11-29 02:42:38,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:38,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868814493] [2023-11-29 02:42:38,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:38,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:40,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:42:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 02:42:40,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868814493] [2023-11-29 02:42:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868814493] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469238169] [2023-11-29 02:42:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:40,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:40,293 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:40,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-29 02:42:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:40,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 02:42:40,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:40,672 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-29 02:42:40,919 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-29 02:42:40,922 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-29 02:42:41,173 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 17 treesize of output 9 [2023-11-29 02:42:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:42:41,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:41,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469238169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:41,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:42:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [22] total 33 [2023-11-29 02:42:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248492863] [2023-11-29 02:42:41,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:41,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:42:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:42:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 02:42:41,208 INFO L87 Difference]: Start difference. First operand 5944 states and 7775 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:41,833 INFO L93 Difference]: Finished difference Result 6050 states and 7900 transitions. [2023-11-29 02:42:41,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:42:41,833 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2023-11-29 02:42:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:41,840 INFO L225 Difference]: With dead ends: 6050 [2023-11-29 02:42:41,840 INFO L226 Difference]: Without dead ends: 6050 [2023-11-29 02:42:41,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=1746, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 02:42:41,840 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 295 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:41,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 702 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:42:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2023-11-29 02:42:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 5959. [2023-11-29 02:42:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5959 states, 5555 states have (on average 1.3006300630063006) internal successors, (7225), 5647 states have internal predecessors, (7225), 285 states have call successors, (285), 92 states have call predecessors, (285), 92 states have return successors, (285), 219 states have call predecessors, (285), 285 states have call successors, (285) [2023-11-29 02:42:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5959 states to 5959 states and 7795 transitions. [2023-11-29 02:42:41,906 INFO L78 Accepts]: Start accepts. Automaton has 5959 states and 7795 transitions. Word has length 67 [2023-11-29 02:42:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:41,906 INFO L495 AbstractCegarLoop]: Abstraction has 5959 states and 7795 transitions. [2023-11-29 02:42:41,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5959 states and 7795 transitions. [2023-11-29 02:42:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 02:42:41,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:41,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:41,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-11-29 02:42:42,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2023-11-29 02:42:42,109 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:42,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash -201175777, now seen corresponding path program 1 times [2023-11-29 02:42:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:42,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577919600] [2023-11-29 02:42:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:42:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:42:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577919600] [2023-11-29 02:42:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577919600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459965521] [2023-11-29 02:42:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:42,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:42,931 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:42,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-29 02:42:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:43,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 02:42:43,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:43,330 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-29 02:42:43,537 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-29 02:42:43,623 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 25 treesize of output 20 [2023-11-29 02:42:43,797 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 28 treesize of output 12 [2023-11-29 02:42:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:42:43,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459965521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:42:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 29 [2023-11-29 02:42:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882298011] [2023-11-29 02:42:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:43,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:42:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:42:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2023-11-29 02:42:43,815 INFO L87 Difference]: Start difference. First operand 5959 states and 7795 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:44,592 INFO L93 Difference]: Finished difference Result 6297 states and 8162 transitions. [2023-11-29 02:42:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 02:42:44,592 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-11-29 02:42:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:44,599 INFO L225 Difference]: With dead ends: 6297 [2023-11-29 02:42:44,599 INFO L226 Difference]: Without dead ends: 6297 [2023-11-29 02:42:44,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 02:42:44,600 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 197 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:44,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 911 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:42:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6297 states. [2023-11-29 02:42:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6297 to 5970. [2023-11-29 02:42:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5970 states, 5566 states have (on average 1.3007545813869925) internal successors, (7240), 5658 states have internal predecessors, (7240), 285 states have call successors, (285), 92 states have call predecessors, (285), 92 states have return successors, (285), 219 states have call predecessors, (285), 285 states have call successors, (285) [2023-11-29 02:42:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5970 states to 5970 states and 7810 transitions. [2023-11-29 02:42:44,660 INFO L78 Accepts]: Start accepts. Automaton has 5970 states and 7810 transitions. Word has length 68 [2023-11-29 02:42:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:44,660 INFO L495 AbstractCegarLoop]: Abstraction has 5970 states and 7810 transitions. [2023-11-29 02:42:44,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5970 states and 7810 transitions. [2023-11-29 02:42:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 02:42:44,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:44,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:44,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-29 02:42:44,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2023-11-29 02:42:44,862 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:44,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1468084469, now seen corresponding path program 1 times [2023-11-29 02:42:44,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:44,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362224345] [2023-11-29 02:42:44,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:44,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:45,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:42:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:42:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362224345] [2023-11-29 02:42:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362224345] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736391787] [2023-11-29 02:42:45,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:45,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:45,700 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:45,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-29 02:42:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:45,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 02:42:45,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:46,299 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:42:46,300 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 21 treesize of output 24 [2023-11-29 02:42:46,638 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 33 treesize of output 21 [2023-11-29 02:42:46,658 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2023-11-29 02:42:46,658 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 2 case distinctions, treesize of input 66 treesize of output 53 [2023-11-29 02:42:46,894 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 0 case distinctions, treesize of input 26 treesize of output 3 [2023-11-29 02:42:47,251 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 69 treesize of output 37 [2023-11-29 02:42:47,264 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 21 treesize of output 13 [2023-11-29 02:42:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:47,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:47,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:42:47,826 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 50 treesize of output 53 [2023-11-29 02:42:48,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736391787] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:48,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:48,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2023-11-29 02:42:48,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512708549] [2023-11-29 02:42:48,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:48,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 02:42:48,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:48,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 02:42:48,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1343, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 02:42:48,725 INFO L87 Difference]: Start difference. First operand 5970 states and 7810 transitions. Second operand has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 states have internal predecessors, (128), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:51,417 INFO L93 Difference]: Finished difference Result 6029 states and 7867 transitions. [2023-11-29 02:42:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 02:42:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 states have internal predecessors, (128), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 69 [2023-11-29 02:42:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:51,426 INFO L225 Difference]: With dead ends: 6029 [2023-11-29 02:42:51,426 INFO L226 Difference]: Without dead ends: 6015 [2023-11-29 02:42:51,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=381, Invalid=3159, Unknown=0, NotChecked=0, Total=3540 [2023-11-29 02:42:51,427 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 200 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:51,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1808 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1532 Invalid, 1 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:42:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2023-11-29 02:42:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 5871. [2023-11-29 02:42:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5871 states, 5471 states have (on average 1.3021385487113872) internal successors, (7124), 5565 states have internal predecessors, (7124), 283 states have call successors, (283), 90 states have call predecessors, (283), 90 states have return successors, (283), 215 states have call predecessors, (283), 283 states have call successors, (283) [2023-11-29 02:42:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5871 states to 5871 states and 7690 transitions. [2023-11-29 02:42:51,507 INFO L78 Accepts]: Start accepts. Automaton has 5871 states and 7690 transitions. Word has length 69 [2023-11-29 02:42:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:51,507 INFO L495 AbstractCegarLoop]: Abstraction has 5871 states and 7690 transitions. [2023-11-29 02:42:51,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 states have internal predecessors, (128), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:42:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5871 states and 7690 transitions. [2023-11-29 02:42:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 02:42:51,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:51,510 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:51,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-29 02:42:51,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:51,710 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:51,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1747973493, now seen corresponding path program 1 times [2023-11-29 02:42:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94864475] [2023-11-29 02:42:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:51,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:51,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:42:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 02:42:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 02:42:51,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:51,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94864475] [2023-11-29 02:42:51,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94864475] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:51,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381134720] [2023-11-29 02:42:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:51,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:51,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:51,872 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:51,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-29 02:42:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:52,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:42:52,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 02:42:52,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 02:42:52,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381134720] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:52,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:42:52,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-11-29 02:42:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298925618] [2023-11-29 02:42:52,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:52,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:42:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:42:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:42:52,259 INFO L87 Difference]: Start difference. First operand 5871 states and 7690 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 02:42:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:52,404 INFO L93 Difference]: Finished difference Result 3857 states and 4966 transitions. [2023-11-29 02:42:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:42:52,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 70 [2023-11-29 02:42:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:52,411 INFO L225 Difference]: With dead ends: 3857 [2023-11-29 02:42:52,411 INFO L226 Difference]: Without dead ends: 3857 [2023-11-29 02:42:52,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:42:52,412 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 5 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:52,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 489 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:42:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2023-11-29 02:42:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3603. [2023-11-29 02:42:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3603 states, 3329 states have (on average 1.2802643436467407) internal successors, (4262), 3413 states have internal predecessors, (4262), 187 states have call successors, (187), 60 states have call predecessors, (187), 60 states have return successors, (187), 129 states have call predecessors, (187), 187 states have call successors, (187) [2023-11-29 02:42:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 4636 transitions. [2023-11-29 02:42:52,468 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 4636 transitions. Word has length 70 [2023-11-29 02:42:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:52,469 INFO L495 AbstractCegarLoop]: Abstraction has 3603 states and 4636 transitions. [2023-11-29 02:42:52,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 02:42:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 4636 transitions. [2023-11-29 02:42:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 02:42:52,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:52,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:52,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-11-29 02:42:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:52,672 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:52,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1088636861, now seen corresponding path program 1 times [2023-11-29 02:42:52,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:52,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286610278] [2023-11-29 02:42:52,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:53,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:42:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:42:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286610278] [2023-11-29 02:42:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286610278] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478231617] [2023-11-29 02:42:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:53,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:53,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:53,733 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:53,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-29 02:42:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:53,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 02:42:53,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:54,443 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-29 02:42:54,615 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 17 treesize of output 9 [2023-11-29 02:42:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:42:54,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:54,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478231617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:54,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:42:54,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 25 [2023-11-29 02:42:54,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575949952] [2023-11-29 02:42:54,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:54,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:42:54,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:54,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:42:54,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:42:54,624 INFO L87 Difference]: Start difference. First operand 3603 states and 4636 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:55,246 INFO L93 Difference]: Finished difference Result 3652 states and 4671 transitions. [2023-11-29 02:42:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 02:42:55,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2023-11-29 02:42:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:55,249 INFO L225 Difference]: With dead ends: 3652 [2023-11-29 02:42:55,249 INFO L226 Difference]: Without dead ends: 3652 [2023-11-29 02:42:55,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 02:42:55,250 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 255 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:55,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 698 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:42:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2023-11-29 02:42:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3599. [2023-11-29 02:42:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3599 states, 3325 states have (on average 1.2806015037593985) internal successors, (4258), 3409 states have internal predecessors, (4258), 187 states have call successors, (187), 60 states have call predecessors, (187), 60 states have return successors, (187), 129 states have call predecessors, (187), 187 states have call successors, (187) [2023-11-29 02:42:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4632 transitions. [2023-11-29 02:42:55,283 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4632 transitions. Word has length 69 [2023-11-29 02:42:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:55,283 INFO L495 AbstractCegarLoop]: Abstraction has 3599 states and 4632 transitions. [2023-11-29 02:42:55,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4632 transitions. [2023-11-29 02:42:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 02:42:55,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:55,285 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:55,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-11-29 02:42:55,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:55,485 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:55,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1607717228, now seen corresponding path program 2 times [2023-11-29 02:42:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:55,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193268855] [2023-11-29 02:42:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:55,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:55,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:42:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 02:42:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 02:42:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193268855] [2023-11-29 02:42:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193268855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887996599] [2023-11-29 02:42:55,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:42:55,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:55,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:55,684 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:55,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-29 02:42:56,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:42:56,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:42:56,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 02:42:56,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 02:42:56,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 02:42:56,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887996599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:56,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:42:56,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-11-29 02:42:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029177130] [2023-11-29 02:42:56,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:56,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:42:56,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:42:56,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:42:56,232 INFO L87 Difference]: Start difference. First operand 3599 states and 4632 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 02:42:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:56,534 INFO L93 Difference]: Finished difference Result 3655 states and 4688 transitions. [2023-11-29 02:42:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:42:56,534 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 73 [2023-11-29 02:42:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:56,538 INFO L225 Difference]: With dead ends: 3655 [2023-11-29 02:42:56,538 INFO L226 Difference]: Without dead ends: 3655 [2023-11-29 02:42:56,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:42:56,539 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:56,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 787 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:42:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2023-11-29 02:42:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3655. [2023-11-29 02:42:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 3381 states have (on average 1.2759538598047915) internal successors, (4314), 3465 states have internal predecessors, (4314), 187 states have call successors, (187), 60 states have call predecessors, (187), 60 states have return successors, (187), 129 states have call predecessors, (187), 187 states have call successors, (187) [2023-11-29 02:42:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 4688 transitions. [2023-11-29 02:42:56,585 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 4688 transitions. Word has length 73 [2023-11-29 02:42:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:56,585 INFO L495 AbstractCegarLoop]: Abstraction has 3655 states and 4688 transitions. [2023-11-29 02:42:56,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 02:42:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 4688 transitions. [2023-11-29 02:42:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 02:42:56,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:56,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:56,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-11-29 02:42:56,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:56,788 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:42:56,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:56,788 INFO L85 PathProgramCache]: Analyzing trace with hash -282386302, now seen corresponding path program 1 times [2023-11-29 02:42:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:56,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825228302] [2023-11-29 02:42:56,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:56,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:42:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:42:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:58,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825228302] [2023-11-29 02:42:58,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825228302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:42:58,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229834500] [2023-11-29 02:42:58,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:58,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:42:58,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:42:58,601 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:42:58,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-29 02:42:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:58,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-29 02:42:58,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:58,937 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-29 02:42:59,188 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:42:59,188 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 21 treesize of output 24 [2023-11-29 02:42:59,349 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2023-11-29 02:42:59,349 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 2 case distinctions, treesize of input 49 treesize of output 40 [2023-11-29 02:42:59,661 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:42:59,661 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-29 02:42:59,978 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-29 02:43:00,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:43:00,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:43:00,366 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:43:00,366 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 1 case distinctions, treesize of input 37 treesize of output 36 [2023-11-29 02:43:00,556 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 62 treesize of output 34 [2023-11-29 02:43:01,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36 [2023-11-29 02:43:01,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:01,094 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 27 treesize of output 21 [2023-11-29 02:43:01,237 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 02:43:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:43:01,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:43:01,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:01,728 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 83 [2023-11-29 02:43:02,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:02,266 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 255 treesize of output 259 [2023-11-29 02:43:02,277 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 226 treesize of output 222 [2023-11-29 02:43:02,317 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 278 treesize of output 274 [2023-11-29 02:43:02,339 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 20 [2023-11-29 02:43:02,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:02,360 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 199 treesize of output 203 [2023-11-29 02:43:02,369 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 146 treesize of output 142 [2023-11-29 02:43:02,394 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-29 02:43:02,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:02,421 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 1291 treesize of output 1275 [2023-11-29 02:43:02,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:02,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:02,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 58 treesize of output 56 [2023-11-29 02:43:02,493 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:02,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:02,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:02,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:02,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:02,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:02,507 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 28 treesize of output 26 [2023-11-29 02:43:02,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:02,515 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:02,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-29 02:43:03,881 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 52 treesize of output 29 [2023-11-29 02:43:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229834500] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:43:04,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:43:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 52 [2023-11-29 02:43:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523147478] [2023-11-29 02:43:04,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:43:04,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-29 02:43:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:43:04,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-29 02:43:04,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=5195, Unknown=10, NotChecked=0, Total=5550 [2023-11-29 02:43:04,183 INFO L87 Difference]: Start difference. First operand 3655 states and 4688 transitions. Second operand has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 49 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:43:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:43:10,721 INFO L93 Difference]: Finished difference Result 3926 states and 4991 transitions. [2023-11-29 02:43:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-29 02:43:10,722 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 49 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 72 [2023-11-29 02:43:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:43:10,726 INFO L225 Difference]: With dead ends: 3926 [2023-11-29 02:43:10,726 INFO L226 Difference]: Without dead ends: 3926 [2023-11-29 02:43:10,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5649 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1820, Invalid=17352, Unknown=10, NotChecked=0, Total=19182 [2023-11-29 02:43:10,728 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 668 mSDsluCounter, 3537 mSDsCounter, 0 mSdLazyCounter, 3328 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 3708 SdHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:43:10,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 3708 Invalid, 3450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3328 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 02:43:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2023-11-29 02:43:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3660. [2023-11-29 02:43:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 3386 states have (on average 1.2758417011222682) internal successors, (4320), 3470 states have internal predecessors, (4320), 187 states have call successors, (187), 60 states have call predecessors, (187), 60 states have return successors, (187), 129 states have call predecessors, (187), 187 states have call successors, (187) [2023-11-29 02:43:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4694 transitions. [2023-11-29 02:43:10,765 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4694 transitions. Word has length 72 [2023-11-29 02:43:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:43:10,765 INFO L495 AbstractCegarLoop]: Abstraction has 3660 states and 4694 transitions. [2023-11-29 02:43:10,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 49 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:43:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4694 transitions. [2023-11-29 02:43:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 02:43:10,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:43:10,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:43:10,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-11-29 02:43:10,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:43:10,967 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:43:10,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:43:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash -282386301, now seen corresponding path program 1 times [2023-11-29 02:43:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:43:10,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106166261] [2023-11-29 02:43:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:43:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:43:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:43:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:43:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:43:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:43:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106166261] [2023-11-29 02:43:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106166261] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:43:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020163143] [2023-11-29 02:43:13,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:43:13,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:43:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:43:13,592 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:43:13,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-29 02:43:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:13,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 132 conjunts are in the unsatisfiable core [2023-11-29 02:43:13,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:43:14,002 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-29 02:43:14,015 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 8 treesize of output 1 [2023-11-29 02:43:14,451 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:43:14,451 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 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-29 02:43:14,464 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:43:14,465 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 21 treesize of output 24 [2023-11-29 02:43:15,162 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 18 [2023-11-29 02:43:15,169 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 0 case distinctions, treesize of input 49 treesize of output 32 [2023-11-29 02:43:15,725 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 02:43:15,725 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-29 02:43:15,741 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:43:15,741 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-29 02:43:15,748 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 26 treesize of output 10 [2023-11-29 02:43:16,056 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-29 02:43:16,074 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-29 02:43:16,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:16,236 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 27 treesize of output 11 [2023-11-29 02:43:16,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:16,273 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 27 treesize of output 11 [2023-11-29 02:43:16,298 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-29 02:43:16,317 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-29 02:43:16,507 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:43:16,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:43:16,513 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 24 treesize of output 11 [2023-11-29 02:43:16,774 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 0 case distinctions, treesize of input 71 treesize of output 39 [2023-11-29 02:43:17,247 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 75 treesize of output 43 [2023-11-29 02:43:17,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:17,360 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 35 treesize of output 25 [2023-11-29 02:43:17,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:17,370 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 17 treesize of output 15 [2023-11-29 02:43:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:43:17,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:43:20,351 INFO L349 Elim1Store]: treesize reduction 52, result has 48.5 percent of original size [2023-11-29 02:43:20,351 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 3 case distinctions, treesize of input 52 treesize of output 77 [2023-11-29 02:43:20,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:20,378 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 112 treesize of output 146 [2023-11-29 02:43:20,455 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:20,462 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 73 treesize of output 79 [2023-11-29 02:43:20,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:20,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,471 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 55 treesize of output 53 [2023-11-29 02:43:20,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:20,481 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 42 treesize of output 14 [2023-11-29 02:43:20,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:20,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2023-11-29 02:43:20,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:20,500 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 20 treesize of output 12 [2023-11-29 02:43:20,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:20,525 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 80 treesize of output 91 [2023-11-29 02:43:20,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:20,530 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,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 68 treesize of output 66 [2023-11-29 02:43:20,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:20,545 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 42 treesize of output 14 [2023-11-29 02:43:20,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:43:20,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:20,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 10 [2023-11-29 02:43:20,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:20,575 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 20 treesize of output 12 [2023-11-29 02:43:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020163143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:43:21,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:43:21,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 56 [2023-11-29 02:43:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807797362] [2023-11-29 02:43:21,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:43:21,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-29 02:43:21,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:43:21,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-29 02:43:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=5018, Unknown=4, NotChecked=0, Total=5256 [2023-11-29 02:43:21,547 INFO L87 Difference]: Start difference. First operand 3660 states and 4694 transitions. Second operand has 57 states, 56 states have (on average 2.392857142857143) internal successors, (134), 53 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:43:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:43:30,347 INFO L93 Difference]: Finished difference Result 3963 states and 5045 transitions. [2023-11-29 02:43:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-29 02:43:30,348 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.392857142857143) internal successors, (134), 53 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 72 [2023-11-29 02:43:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:43:30,352 INFO L225 Difference]: With dead ends: 3963 [2023-11-29 02:43:30,352 INFO L226 Difference]: Without dead ends: 3963 [2023-11-29 02:43:30,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3813 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1138, Invalid=15114, Unknown=4, NotChecked=0, Total=16256 [2023-11-29 02:43:30,354 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 723 mSDsluCounter, 4091 mSDsCounter, 0 mSdLazyCounter, 4380 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 4228 SdHoareTripleChecker+Invalid, 4505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:43:30,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 4228 Invalid, 4505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4380 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 02:43:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2023-11-29 02:43:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3667. [2023-11-29 02:43:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3667 states, 3396 states have (on average 1.2765017667844523) internal successors, (4335), 3477 states have internal predecessors, (4335), 184 states have call successors, (184), 60 states have call predecessors, (184), 60 states have return successors, (184), 129 states have call predecessors, (184), 184 states have call successors, (184) [2023-11-29 02:43:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 4703 transitions. [2023-11-29 02:43:30,406 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 4703 transitions. Word has length 72 [2023-11-29 02:43:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:43:30,407 INFO L495 AbstractCegarLoop]: Abstraction has 3667 states and 4703 transitions. [2023-11-29 02:43:30,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.392857142857143) internal successors, (134), 53 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:43:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 4703 transitions. [2023-11-29 02:43:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 02:43:30,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:43:30,409 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:43:30,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-11-29 02:43:30,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2023-11-29 02:43:30,609 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:43:30,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:43:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash 397672068, now seen corresponding path program 1 times [2023-11-29 02:43:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:43:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943998129] [2023-11-29 02:43:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:43:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:43:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:43:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:34,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:43:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:43:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:43:34,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943998129] [2023-11-29 02:43:34,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943998129] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:43:34,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123807486] [2023-11-29 02:43:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:43:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:43:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:43:34,246 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:43:34,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-11-29 02:43:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:34,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 103 conjunts are in the unsatisfiable core [2023-11-29 02:43:34,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:43:34,687 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-29 02:43:35,115 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:43:35,116 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 21 treesize of output 24 [2023-11-29 02:43:35,129 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:43:35,129 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 21 treesize of output 20 [2023-11-29 02:43:35,415 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2023-11-29 02:43:35,416 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 2 case distinctions, treesize of input 58 treesize of output 49 [2023-11-29 02:43:35,434 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-11-29 02:43:35,435 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 2 case distinctions, treesize of input 55 treesize of output 61 [2023-11-29 02:43:35,988 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 02:43:35,988 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 21 treesize of output 29 [2023-11-29 02:43:36,664 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 27 treesize of output 1 [2023-11-29 02:43:36,810 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 0 case distinctions, treesize of input 73 treesize of output 37 [2023-11-29 02:43:37,287 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 54 treesize of output 30 [2023-11-29 02:43:37,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:37,383 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 25 treesize of output 21 [2023-11-29 02:43:37,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-11-29 02:43:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:43:37,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:43:38,282 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 128 treesize of output 106 [2023-11-29 02:43:38,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:38,300 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 78 treesize of output 56 [2023-11-29 02:43:39,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123807486] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:43:39,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:43:39,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 22] total 52 [2023-11-29 02:43:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249945461] [2023-11-29 02:43:39,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:43:39,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-29 02:43:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:43:39,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-29 02:43:39,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4080, Unknown=0, NotChecked=0, Total=4290 [2023-11-29 02:43:39,766 INFO L87 Difference]: Start difference. First operand 3667 states and 4703 transitions. Second operand has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 49 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:43:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:43:47,112 INFO L93 Difference]: Finished difference Result 3896 states and 4961 transitions. [2023-11-29 02:43:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 02:43:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 49 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 72 [2023-11-29 02:43:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:43:47,116 INFO L225 Difference]: With dead ends: 3896 [2023-11-29 02:43:47,116 INFO L226 Difference]: Without dead ends: 3896 [2023-11-29 02:43:47,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=782, Invalid=8530, Unknown=0, NotChecked=0, Total=9312 [2023-11-29 02:43:47,117 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 469 mSDsluCounter, 3889 mSDsCounter, 0 mSdLazyCounter, 3968 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 4037 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:43:47,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 4037 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3968 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 02:43:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2023-11-29 02:43:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3678. [2023-11-29 02:43:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3407 states have (on average 1.2764895802759026) internal successors, (4349), 3488 states have internal predecessors, (4349), 184 states have call successors, (184), 60 states have call predecessors, (184), 60 states have return successors, (184), 129 states have call predecessors, (184), 184 states have call successors, (184) [2023-11-29 02:43:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4717 transitions. [2023-11-29 02:43:47,153 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4717 transitions. Word has length 72 [2023-11-29 02:43:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:43:47,153 INFO L495 AbstractCegarLoop]: Abstraction has 3678 states and 4717 transitions. [2023-11-29 02:43:47,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 49 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:43:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4717 transitions. [2023-11-29 02:43:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 02:43:47,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:43:47,154 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:43:47,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-11-29 02:43:47,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2023-11-29 02:43:47,355 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:43:47,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:43:47,355 INFO L85 PathProgramCache]: Analyzing trace with hash 397672069, now seen corresponding path program 1 times [2023-11-29 02:43:47,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:43:47,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767979080] [2023-11-29 02:43:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:43:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:43:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:43:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:43:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:43:49,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:43:49,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767979080] [2023-11-29 02:43:49,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767979080] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:43:49,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549351226] [2023-11-29 02:43:49,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:43:49,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:43:49,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:43:49,706 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:43:49,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-11-29 02:43:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:43:49,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-29 02:43:49,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:43:50,446 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:43:50,446 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 21 treesize of output 24 [2023-11-29 02:43:50,465 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:43:50,465 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 21 treesize of output 24 [2023-11-29 02:43:50,944 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 33 treesize of output 28 [2023-11-29 02:43:50,949 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 40 treesize of output 31 [2023-11-29 02:43:51,429 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 43 treesize of output 23 [2023-11-29 02:43:51,442 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-29 02:43:52,051 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 27 treesize of output 1 [2023-11-29 02:43:52,055 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 19 treesize of output 11 [2023-11-29 02:43:52,183 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 0 case distinctions, treesize of input 59 treesize of output 31 [2023-11-29 02:43:52,548 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 40 treesize of output 24 [2023-11-29 02:43:52,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:52,634 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 15 treesize of output 15 [2023-11-29 02:43:52,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:43:52,645 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 17 treesize of output 17 [2023-11-29 02:43:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:43:52,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:43:53,529 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 166 treesize of output 144 [2023-11-29 02:43:53,533 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 258 treesize of output 214 [2023-11-29 02:43:53,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:43:53,554 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 74 treesize of output 52 [2023-11-29 02:44:15,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549351226] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:44:15,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:44:15,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 50 [2023-11-29 02:44:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036202732] [2023-11-29 02:44:15,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:44:15,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-29 02:44:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:44:15,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 02:44:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4994, Unknown=3, NotChecked=0, Total=5256 [2023-11-29 02:44:15,298 INFO L87 Difference]: Start difference. First operand 3678 states and 4717 transitions. Second operand has 51 states, 50 states have (on average 2.68) internal successors, (134), 47 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:44:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:21,946 INFO L93 Difference]: Finished difference Result 3960 states and 5031 transitions. [2023-11-29 02:44:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:44:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.68) internal successors, (134), 47 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 72 [2023-11-29 02:44:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:21,950 INFO L225 Difference]: With dead ends: 3960 [2023-11-29 02:44:21,950 INFO L226 Difference]: Without dead ends: 3960 [2023-11-29 02:44:21,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=871, Invalid=10682, Unknown=3, NotChecked=0, Total=11556 [2023-11-29 02:44:21,951 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 467 mSDsluCounter, 4954 mSDsCounter, 0 mSdLazyCounter, 3410 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 5121 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:21,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 5121 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3410 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 02:44:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2023-11-29 02:44:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 3670. [2023-11-29 02:44:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 3399 states have (on average 1.276551927037364) internal successors, (4339), 3480 states have internal predecessors, (4339), 184 states have call successors, (184), 60 states have call predecessors, (184), 60 states have return successors, (184), 129 states have call predecessors, (184), 184 states have call successors, (184) [2023-11-29 02:44:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 4707 transitions. [2023-11-29 02:44:21,992 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 4707 transitions. Word has length 72 [2023-11-29 02:44:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:21,992 INFO L495 AbstractCegarLoop]: Abstraction has 3670 states and 4707 transitions. [2023-11-29 02:44:21,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.68) internal successors, (134), 47 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:44:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 4707 transitions. [2023-11-29 02:44:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 02:44:21,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:21,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:21,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-11-29 02:44:22,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2023-11-29 02:44:22,194 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:44:22,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash -207782124, now seen corresponding path program 1 times [2023-11-29 02:44:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:22,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067890003] [2023-11-29 02:44:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:44:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:44:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:44:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:44:23,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:44:23,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067890003] [2023-11-29 02:44:23,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067890003] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:44:23,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455244501] [2023-11-29 02:44:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:23,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:44:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:44:23,558 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:44:23,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-11-29 02:44:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:23,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 02:44:23,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:24,004 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-29 02:44:24,225 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-29 02:44:24,480 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 17 treesize of output 9 [2023-11-29 02:44:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:44:24,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:44:24,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455244501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:44:24,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:44:24,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 33 [2023-11-29 02:44:24,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144350489] [2023-11-29 02:44:24,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:44:24,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:44:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:44:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:44:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 02:44:24,484 INFO L87 Difference]: Start difference. First operand 3670 states and 4707 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 02:44:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:25,127 INFO L93 Difference]: Finished difference Result 3745 states and 4793 transitions. [2023-11-29 02:44:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 02:44:25,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2023-11-29 02:44:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:25,131 INFO L225 Difference]: With dead ends: 3745 [2023-11-29 02:44:25,131 INFO L226 Difference]: Without dead ends: 3745 [2023-11-29 02:44:25,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=1875, Unknown=0, NotChecked=0, Total=2070 [2023-11-29 02:44:25,132 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 278 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:25,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 798 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:44:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2023-11-29 02:44:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3697. [2023-11-29 02:44:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3697 states, 3427 states have (on average 1.2742923840093376) internal successors, (4367), 3507 states have internal predecessors, (4367), 184 states have call successors, (184), 60 states have call predecessors, (184), 60 states have return successors, (184), 129 states have call predecessors, (184), 184 states have call successors, (184) [2023-11-29 02:44:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 4735 transitions. [2023-11-29 02:44:25,169 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 4735 transitions. Word has length 73 [2023-11-29 02:44:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:25,169 INFO L495 AbstractCegarLoop]: Abstraction has 3697 states and 4735 transitions. [2023-11-29 02:44:25,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 02:44:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 4735 transitions. [2023-11-29 02:44:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 02:44:25,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:25,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:25,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-11-29 02:44:25,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2023-11-29 02:44:25,371 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:44:25,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:25,371 INFO L85 PathProgramCache]: Analyzing trace with hash -207782123, now seen corresponding path program 1 times [2023-11-29 02:44:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:25,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905599726] [2023-11-29 02:44:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:44:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:44:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:26,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:44:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 02:44:26,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:44:26,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905599726] [2023-11-29 02:44:26,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905599726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:44:26,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474604651] [2023-11-29 02:44:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:26,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:44:26,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:44:26,992 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:44:26,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-11-29 02:44:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:27,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 02:44:27,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:27,437 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-29 02:44:27,681 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-29 02:44:27,684 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-29 02:44:28,088 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 17 treesize of output 9 [2023-11-29 02:44:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:44:28,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:44:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474604651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:44:28,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:44:28,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [27] total 41 [2023-11-29 02:44:28,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675755974] [2023-11-29 02:44:28,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:44:28,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:44:28,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:44:28,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:44:28,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 02:44:28,121 INFO L87 Difference]: Start difference. First operand 3697 states and 4735 transitions. Second operand has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 02:44:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:29,002 INFO L93 Difference]: Finished difference Result 3728 states and 4740 transitions. [2023-11-29 02:44:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:44:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2023-11-29 02:44:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:29,007 INFO L225 Difference]: With dead ends: 3728 [2023-11-29 02:44:29,007 INFO L226 Difference]: Without dead ends: 3728 [2023-11-29 02:44:29,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=327, Invalid=2643, Unknown=0, NotChecked=0, Total=2970 [2023-11-29 02:44:29,007 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 269 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:29,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1118 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:44:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2023-11-29 02:44:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 3697. [2023-11-29 02:44:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3697 states, 3427 states have (on average 1.2702071782900497) internal successors, (4353), 3507 states have internal predecessors, (4353), 184 states have call successors, (184), 60 states have call predecessors, (184), 60 states have return successors, (184), 129 states have call predecessors, (184), 184 states have call successors, (184) [2023-11-29 02:44:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 4721 transitions. [2023-11-29 02:44:29,041 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 4721 transitions. Word has length 73 [2023-11-29 02:44:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:29,041 INFO L495 AbstractCegarLoop]: Abstraction has 3697 states and 4721 transitions. [2023-11-29 02:44:29,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 02:44:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 4721 transitions. [2023-11-29 02:44:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 02:44:29,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:29,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:29,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-11-29 02:44:29,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2023-11-29 02:44:29,243 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:44:29,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash -164042054, now seen corresponding path program 1 times [2023-11-29 02:44:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841409680] [2023-11-29 02:44:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:29,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:44:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:29,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:44:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:44:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:44:29,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841409680] [2023-11-29 02:44:29,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841409680] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:44:29,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349525919] [2023-11-29 02:44:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:29,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:44:29,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:44:29,331 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:44:29,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-11-29 02:44:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:29,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:44:29,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:44:29,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:44:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:44:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349525919] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:44:29,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:44:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-29 02:44:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918897208] [2023-11-29 02:44:29,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:44:29,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:44:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:44:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:44:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:44:29,762 INFO L87 Difference]: Start difference. First operand 3697 states and 4721 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:44:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:29,896 INFO L93 Difference]: Finished difference Result 4886 states and 6291 transitions. [2023-11-29 02:44:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:44:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2023-11-29 02:44:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:29,902 INFO L225 Difference]: With dead ends: 4886 [2023-11-29 02:44:29,902 INFO L226 Difference]: Without dead ends: 4886 [2023-11-29 02:44:29,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:44:29,902 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 336 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:29,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 790 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:44:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2023-11-29 02:44:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4208. [2023-11-29 02:44:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4208 states, 3918 states have (on average 1.2866258295048494) internal successors, (5041), 4000 states have internal predecessors, (5041), 204 states have call successors, (204), 60 states have call predecessors, (204), 60 states have return successors, (204), 147 states have call predecessors, (204), 204 states have call successors, (204) [2023-11-29 02:44:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 5449 transitions. [2023-11-29 02:44:29,981 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 5449 transitions. Word has length 73 [2023-11-29 02:44:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:29,981 INFO L495 AbstractCegarLoop]: Abstraction has 4208 states and 5449 transitions. [2023-11-29 02:44:29,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:44:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 5449 transitions. [2023-11-29 02:44:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 02:44:29,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:29,982 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:29,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2023-11-29 02:44:30,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:44:30,183 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:44:30,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2146276049, now seen corresponding path program 1 times [2023-11-29 02:44:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:30,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711350175] [2023-11-29 02:44:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:44:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:44:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:44:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 02:44:33,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:44:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711350175] [2023-11-29 02:44:33,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711350175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:44:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673274382] [2023-11-29 02:44:33,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:33,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:44:33,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:44:33,035 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:44:33,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-11-29 02:44:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:33,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 02:44:33,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:33,420 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-29 02:44:33,669 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:44:33,670 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 21 treesize of output 24 [2023-11-29 02:44:33,845 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2023-11-29 02:44:33,845 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 2 case distinctions, treesize of input 49 treesize of output 40 [2023-11-29 02:44:34,190 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:44:34,191 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-29 02:44:34,449 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-29 02:44:34,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:44:34,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:44:34,839 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:44:34,839 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 1 case distinctions, treesize of input 37 treesize of output 36 [2023-11-29 02:44:35,072 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 62 treesize of output 34 [2023-11-29 02:44:35,088 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-29 02:44:36,124 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 68 treesize of output 36 [2023-11-29 02:44:36,205 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 25 treesize of output 13 [2023-11-29 02:44:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:44:36,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:44:36,718 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 84 treesize of output 80 [2023-11-29 02:44:40,739 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_append_one_~to#1| 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_append_one_~item~1#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|))) (.cse2 (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse0 (= |c_~#list~0.offset| .cse3))) (or (and .cse0 (= (select |c_#valid| (select .cse1 (+ |c_ULTIMATE.start_append_one_~item~1#1.offset| 4))) 1) .cse2) (and (forall ((v_arrayElimCell_244 Int)) (= (select |c_#valid| (select .cse1 (+ v_arrayElimCell_244 4))) 1)) (or (not .cse2) (not .cse0)))))) is different from false [2023-11-29 02:45:14,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:14,962 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 92 treesize of output 160 [2023-11-29 02:45:15,105 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ (* |c_ULTIMATE.start_append_one_~to#1| 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse5 (= |c_~#list~0.offset| .cse12)) (.cse0 (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse3 (+ |c_ULTIMATE.start_create_item_~head~0#1.offset| 4)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|) .cse12 |c_ULTIMATE.start_create_item_~head~0#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse4))) (let ((.cse1 (select .cse2 .cse3))) (or (= .cse1 |c_ULTIMATE.start_create_item_~link#1.base|) (= (select .cse2 (+ v_arrayElimCell_244 4)) .cse1))))) (not .cse5)) (or (and .cse5 .cse0) (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int)) (let ((.cse7 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse4))) (let ((.cse6 (select .cse7 (+ v_arrayElimCell_244 4)))) (or (= .cse6 (select .cse7 .cse3)) (= .cse6 |c_ULTIMATE.start_create_item_~link#1.base|)))))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int)) (let ((.cse10 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse4))) (let ((.cse8 (select .cse10 .cse3)) (.cse9 (select .cse10 (+ v_arrayElimCell_244 4)))) (or (= .cse8 |c_ULTIMATE.start_create_item_~link#1.base|) (= .cse9 .cse8) (= .cse9 |c_ULTIMATE.start_create_item_~link#1.base|))))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int)) (let ((.cse11 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse4))) (or (= (select .cse11 .cse3) |c_ULTIMATE.start_create_item_~link#1.base|) (= (select .cse11 (+ v_arrayElimCell_244 4)) |c_ULTIMATE.start_create_item_~link#1.base|))))))) is different from false [2023-11-29 02:45:15,233 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (+ (* |c_ULTIMATE.start_append_one_~to#1| 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse8 (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse7 (= |c_~#list~0.offset| .cse14)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| 4)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|) .cse14 |c_ULTIMATE.start_create_item_~item~0#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|))) (and (forall ((v_ArrVal_3815 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3815 .cse1)) v_ArrVal_3815)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int)) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse4))) (or (= |c_ULTIMATE.start_create_item_~link#1.base| (select .cse2 (+ v_arrayElimCell_244 4))) (= (select .cse2 .cse3) |c_ULTIMATE.start_create_item_~link#1.base|)))))) (or (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse4))) (let ((.cse6 (select .cse5 (+ v_arrayElimCell_244 4)))) (or (= (select .cse5 .cse3) .cse6) (= |c_ULTIMATE.start_create_item_~link#1.base| .cse6) (not (= (store .cse0 .cse1 (select v_ArrVal_3815 .cse1)) v_ArrVal_3815)))))) (and .cse7 .cse8)) (or (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse4))) (let ((.cse9 (select .cse10 .cse3))) (or (= .cse9 (select .cse10 (+ v_arrayElimCell_244 4))) (not (= (store .cse0 .cse1 (select v_ArrVal_3815 .cse1)) v_ArrVal_3815)) (= .cse9 |c_ULTIMATE.start_create_item_~link#1.base|))))) (not .cse8) (not .cse7)) (forall ((v_ArrVal_3815 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3815 .cse1)) v_ArrVal_3815)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int)) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse4))) (let ((.cse12 (select .cse13 (+ v_arrayElimCell_244 4))) (.cse11 (select .cse13 .cse3))) (or (= .cse11 .cse12) (= |c_ULTIMATE.start_create_item_~link#1.base| .cse12) (= .cse11 |c_ULTIMATE.start_create_item_~link#1.base|)))))))))) is different from false [2023-11-29 02:45:15,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (+ (* |c_ULTIMATE.start_append_one_~to#1| 4) |c_ULTIMATE.start_append_one_~list#1.offset|)) (.cse10 (= 2 |c_ULTIMATE.start_create_item_~term_field~0#1|))) (let ((.cse9 (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse0 (not .cse10)) (.cse8 (= |c_~#list~0.offset| .cse25)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| (* |c_ULTIMATE.start_create_item_~term_field~0#1| 4))) (.cse4 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| 8)) (.cse6 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| 4)) (.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|) .cse25 |c_ULTIMATE.start_create_item_~item~0#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse7))) (let ((.cse2 (select .cse5 (+ v_arrayElimCell_244 4))) (.cse1 (select .cse5 .cse6))) (or (= .cse1 .cse2) (= |c_ULTIMATE.start_create_item_~link#1.base| .cse2) (not (= (store .cse3 .cse4 (select v_ArrVal_3815 .cse4)) v_ArrVal_3815)) (= .cse1 |c_ULTIMATE.start_create_item_~link#1.base|)))))) (or (and .cse8 .cse9) (and (or .cse10 (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse7))) (let ((.cse12 (select .cse11 (+ v_arrayElimCell_244 4)))) (or (= (select .cse11 .cse6) .cse12) (= |c_ULTIMATE.start_create_item_~link#1.base| .cse12) (not (= v_ArrVal_3815 (store (store .cse3 .cse13 (select v_ArrVal_3815 .cse13)) .cse4 (select v_ArrVal_3815 .cse4))))))))) (or .cse0 (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse7))) (let ((.cse15 (select .cse14 (+ v_arrayElimCell_244 4)))) (or (= (select .cse14 .cse6) .cse15) (= |c_ULTIMATE.start_create_item_~link#1.base| .cse15) (not (= (store .cse3 .cse4 (select v_ArrVal_3815 .cse4)) v_ArrVal_3815))))))))) (or (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse7))) (or (= |c_ULTIMATE.start_create_item_~link#1.base| (select .cse16 (+ v_arrayElimCell_244 4))) (not (= (store .cse3 .cse4 (select v_ArrVal_3815 .cse4)) v_ArrVal_3815)) (= (select .cse16 .cse6) |c_ULTIMATE.start_create_item_~link#1.base|)))) .cse0) (or (not .cse9) (and (or .cse10 (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse7))) (let ((.cse17 (select .cse18 .cse6))) (or (= .cse17 (select .cse18 (+ v_arrayElimCell_244 4))) (not (= v_ArrVal_3815 (store (store .cse3 .cse13 (select v_ArrVal_3815 .cse13)) .cse4 (select v_ArrVal_3815 .cse4)))) (= .cse17 |c_ULTIMATE.start_create_item_~link#1.base|)))))) (or .cse0 (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse7))) (let ((.cse19 (select .cse20 .cse6))) (or (= .cse19 (select .cse20 (+ v_arrayElimCell_244 4))) (not (= (store .cse3 .cse4 (select v_ArrVal_3815 .cse4)) v_ArrVal_3815)) (= .cse19 |c_ULTIMATE.start_create_item_~link#1.base|))))))) (not .cse8)) (or (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse7))) (or (= |c_ULTIMATE.start_create_item_~link#1.base| (select .cse21 (+ v_arrayElimCell_244 4))) (not (= v_ArrVal_3815 (store (store .cse3 .cse13 (select v_ArrVal_3815 .cse13)) .cse4 (select v_ArrVal_3815 .cse4)))) (= (select .cse21 .cse6) |c_ULTIMATE.start_create_item_~link#1.base|)))) .cse10) (or (forall ((v_ArrVal_3816 (Array Int Int)) (v_arrayElimCell_244 Int) (v_ArrVal_3815 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_3815) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_3816) .cse7))) (let ((.cse23 (select .cse24 (+ v_arrayElimCell_244 4))) (.cse22 (select .cse24 .cse6))) (or (= .cse22 .cse23) (= |c_ULTIMATE.start_create_item_~link#1.base| .cse23) (not (= v_ArrVal_3815 (store (store .cse3 .cse13 (select v_ArrVal_3815 .cse13)) .cse4 (select v_ArrVal_3815 .cse4)))) (= .cse22 |c_ULTIMATE.start_create_item_~link#1.base|))))) .cse10)))) is different from false [2023-11-29 02:45:15,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:15,449 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 861 treesize of output 775 [2023-11-29 02:45:15,473 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 02:45:15,473 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 161 treesize of output 140 [2023-11-29 02:45:15,530 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:15,531 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 276 treesize of output 236 [2023-11-29 02:45:15,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:15,713 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 874 treesize of output 788 [2023-11-29 02:45:15,743 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 02:45:15,743 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 161 treesize of output 140 [2023-11-29 02:45:15,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:15,824 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 61 treesize of output 49 [2023-11-29 02:45:15,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:15,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:15,851 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 2255 treesize of output 2055 [2023-11-29 02:45:17,073 INFO L349 Elim1Store]: treesize reduction 20, result has 16.7 percent of original size [2023-11-29 02:45:17,074 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 806 treesize of output 736 [2023-11-29 02:45:17,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:17,208 INFO L349 Elim1Store]: treesize reduction 158, result has 33.6 percent of original size [2023-11-29 02:45:17,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 188 treesize of output 226 [2023-11-29 02:45:17,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:17,256 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 218 treesize of output 226 [2023-11-29 02:45:17,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:17,286 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 153 treesize of output 145 [2023-11-29 02:45:17,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:17,878 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:17,881 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 61 treesize of output 59 [2023-11-29 02:45:17,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:17,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:17,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:17,892 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:17,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 1 [2023-11-29 02:45:17,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:17,903 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 196 treesize of output 194 [2023-11-29 02:45:17,931 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 02:45:17,931 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 592 treesize of output 535 [2023-11-29 02:45:17,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:17,956 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 86 treesize of output 70 [2023-11-29 02:45:18,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:18,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:18,094 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 35 treesize of output 33 [2023-11-29 02:45:18,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 02:45:18,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:18,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:18,112 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 52 treesize of output 50 [2023-11-29 02:45:18,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:18,119 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:18,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2023-11-29 02:45:18,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:18,133 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:18,136 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 39 treesize of output 37 [2023-11-29 02:45:18,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 02:45:19,653 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 52 treesize of output 29 [2023-11-29 02:45:19,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673274382] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:45:19,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:45:19,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 56 [2023-11-29 02:45:19,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019790878] [2023-11-29 02:45:19,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:45:19,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-29 02:45:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:45:19,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-29 02:45:19,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=5370, Unknown=16, NotChecked=604, Total=6320 [2023-11-29 02:45:19,928 INFO L87 Difference]: Start difference. First operand 4208 states and 5449 transitions. Second operand has 57 states, 56 states have (on average 2.3392857142857144) internal successors, (131), 51 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:45:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:45:35,778 INFO L93 Difference]: Finished difference Result 4484 states and 5750 transitions. [2023-11-29 02:45:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-29 02:45:35,779 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.3392857142857144) internal successors, (131), 51 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2023-11-29 02:45:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:45:35,783 INFO L225 Difference]: With dead ends: 4484 [2023-11-29 02:45:35,783 INFO L226 Difference]: Without dead ends: 4484 [2023-11-29 02:45:35,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5499 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=1837, Invalid=16793, Unknown=18, NotChecked=1092, Total=19740 [2023-11-29 02:45:35,784 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 808 mSDsluCounter, 4746 mSDsCounter, 0 mSdLazyCounter, 3976 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 4106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:45:35,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 4918 Invalid, 4106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3976 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 02:45:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2023-11-29 02:45:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 4214. [2023-11-29 02:45:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4214 states, 3924 states have (on average 1.2864424057084607) internal successors, (5048), 4006 states have internal predecessors, (5048), 204 states have call successors, (204), 60 states have call predecessors, (204), 60 states have return successors, (204), 147 states have call predecessors, (204), 204 states have call successors, (204) [2023-11-29 02:45:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4214 states to 4214 states and 5456 transitions. [2023-11-29 02:45:35,823 INFO L78 Accepts]: Start accepts. Automaton has 4214 states and 5456 transitions. Word has length 74 [2023-11-29 02:45:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:45:35,824 INFO L495 AbstractCegarLoop]: Abstraction has 4214 states and 5456 transitions. [2023-11-29 02:45:35,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.3392857142857144) internal successors, (131), 51 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:45:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4214 states and 5456 transitions. [2023-11-29 02:45:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 02:45:35,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:45:35,825 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:45:35,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-11-29 02:45:36,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:45:36,026 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:45:36,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:45:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2146276048, now seen corresponding path program 1 times [2023-11-29 02:45:36,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:45:36,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916358199] [2023-11-29 02:45:36,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:45:36,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:45:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:45:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:39,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:45:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:45:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:45:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:45:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916358199] [2023-11-29 02:45:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916358199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:45:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071178914] [2023-11-29 02:45:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:45:39,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:45:39,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:45:39,650 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:45:39,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-11-29 02:45:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:39,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 152 conjunts are in the unsatisfiable core [2023-11-29 02:45:39,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:45:40,078 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-29 02:45:40,085 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-29 02:45:40,537 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:45:40,538 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 21 treesize of output 24 [2023-11-29 02:45:40,550 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:45:40,550 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 21 treesize of output 20 [2023-11-29 02:45:41,038 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 42 treesize of output 29 [2023-11-29 02:45:41,050 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-29 02:45:41,608 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:45:41,608 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-29 02:45:41,621 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 02:45:42,039 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-29 02:45:42,054 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-29 02:45:42,214 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-29 02:45:42,232 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-29 02:45:42,407 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-29 02:45:42,437 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-29 02:45:42,652 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:45:42,652 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 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:45:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:42,661 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 24 treesize of output 11 [2023-11-29 02:45:42,966 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 0 case distinctions, treesize of input 71 treesize of output 39 [2023-11-29 02:45:42,981 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 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 02:45:44,108 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 75 treesize of output 43 [2023-11-29 02:45:44,209 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 33 treesize of output 17 [2023-11-29 02:45:44,214 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-29 02:45:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:45:44,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:45:46,953 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:46,992 INFO L349 Elim1Store]: treesize reduction 36, result has 55.0 percent of original size [2023-11-29 02:45:46,992 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 3 case distinctions, treesize of input 116 treesize of output 136 [2023-11-29 02:45:47,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:47,006 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 451 treesize of output 455 [2023-11-29 02:45:47,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:47,029 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 763 treesize of output 652 [2023-11-29 02:45:47,039 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 274 treesize of output 234 [2023-11-29 02:45:47,047 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 234 treesize of output 194 [2023-11-29 02:45:47,136 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 27 treesize of output 7 [2023-11-29 02:45:47,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:47,227 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 1075 treesize of output 995 [2023-11-29 02:45:48,041 INFO L349 Elim1Store]: treesize reduction 56, result has 44.6 percent of original size [2023-11-29 02:45:48,041 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 3 case distinctions, treesize of input 68 treesize of output 89 [2023-11-29 02:45:48,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:48,083 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 144 treesize of output 196 [2023-11-29 02:45:48,159 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 23 treesize of output 3 [2023-11-29 02:45:48,171 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:48,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:45:48,182 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 109 treesize of output 115 [2023-11-29 02:45:48,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:48,191 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:48,195 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 91 treesize of output 89 [2023-11-29 02:45:48,200 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:48,205 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 78 treesize of output 32 [2023-11-29 02:45:48,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:45:48,214 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:45:49,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071178914] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:45:49,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:45:49,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27] total 60 [2023-11-29 02:45:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19213008] [2023-11-29 02:45:49,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:45:49,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-29 02:45:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:45:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-29 02:45:49,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=5870, Unknown=11, NotChecked=0, Total=6162 [2023-11-29 02:45:49,442 INFO L87 Difference]: Start difference. First operand 4214 states and 5456 transitions. Second operand has 61 states, 60 states have (on average 2.2333333333333334) internal successors, (134), 57 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:46:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:46:04,537 INFO L93 Difference]: Finished difference Result 4532 states and 5799 transitions. [2023-11-29 02:46:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-11-29 02:46:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.2333333333333334) internal successors, (134), 57 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2023-11-29 02:46:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:46:04,541 INFO L225 Difference]: With dead ends: 4532 [2023-11-29 02:46:04,541 INFO L226 Difference]: Without dead ends: 4532 [2023-11-29 02:46:04,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7131 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1898, Invalid=22897, Unknown=11, NotChecked=0, Total=24806 [2023-11-29 02:46:04,543 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 768 mSDsluCounter, 5806 mSDsCounter, 0 mSdLazyCounter, 5037 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 5981 SdHoareTripleChecker+Invalid, 5218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 5037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:46:04,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 5981 Invalid, 5218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 5037 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 02:46:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2023-11-29 02:46:04,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4214. [2023-11-29 02:46:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4214 states, 3924 states have (on average 1.285677879714577) internal successors, (5045), 4006 states have internal predecessors, (5045), 204 states have call successors, (204), 60 states have call predecessors, (204), 60 states have return successors, (204), 147 states have call predecessors, (204), 204 states have call successors, (204) [2023-11-29 02:46:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4214 states to 4214 states and 5453 transitions. [2023-11-29 02:46:04,585 INFO L78 Accepts]: Start accepts. Automaton has 4214 states and 5453 transitions. Word has length 74 [2023-11-29 02:46:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:46:04,585 INFO L495 AbstractCegarLoop]: Abstraction has 4214 states and 5453 transitions. [2023-11-29 02:46:04,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.2333333333333334) internal successors, (134), 57 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:46:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4214 states and 5453 transitions. [2023-11-29 02:46:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 02:46:04,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:46:04,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:46:04,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-11-29 02:46:04,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:04,787 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:46:04,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:46:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2147061368, now seen corresponding path program 1 times [2023-11-29 02:46:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:46:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759945438] [2023-11-29 02:46:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:46:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:46:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:05,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:46:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:46:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 02:46:05,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:46:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759945438] [2023-11-29 02:46:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759945438] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129350524] [2023-11-29 02:46:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:05,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:05,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:46:05,285 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:46:05,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-11-29 02:46:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:05,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 02:46:05,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:05,935 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-29 02:46:06,101 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 17 treesize of output 9 [2023-11-29 02:46:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:46:06,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:06,169 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 32 [2023-11-29 02:46:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 02:46:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129350524] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:46:06,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:46:06,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2023-11-29 02:46:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186104792] [2023-11-29 02:46:06,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:46:06,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 02:46:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:46:06,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 02:46:06,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:46:06,360 INFO L87 Difference]: Start difference. First operand 4214 states and 5453 transitions. Second operand has 28 states, 27 states have (on average 6.111111111111111) internal successors, (165), 25 states have internal predecessors, (165), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-29 02:46:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:46:07,179 INFO L93 Difference]: Finished difference Result 4260 states and 5491 transitions. [2023-11-29 02:46:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:46:07,180 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 6.111111111111111) internal successors, (165), 25 states have internal predecessors, (165), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 74 [2023-11-29 02:46:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:46:07,184 INFO L225 Difference]: With dead ends: 4260 [2023-11-29 02:46:07,184 INFO L226 Difference]: Without dead ends: 4260 [2023-11-29 02:46:07,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 02:46:07,185 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 279 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:46:07,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1318 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:46:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2023-11-29 02:46:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 4220. [2023-11-29 02:46:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 3930 states have (on average 1.2844783715012722) internal successors, (5048), 4012 states have internal predecessors, (5048), 204 states have call successors, (204), 60 states have call predecessors, (204), 60 states have return successors, (204), 147 states have call predecessors, (204), 204 states have call successors, (204) [2023-11-29 02:46:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 5456 transitions. [2023-11-29 02:46:07,225 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 5456 transitions. Word has length 74 [2023-11-29 02:46:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:46:07,225 INFO L495 AbstractCegarLoop]: Abstraction has 4220 states and 5456 transitions. [2023-11-29 02:46:07,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 6.111111111111111) internal successors, (165), 25 states have internal predecessors, (165), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-29 02:46:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 5456 transitions. [2023-11-29 02:46:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 02:46:07,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:46:07,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:46:07,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-11-29 02:46:07,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2023-11-29 02:46:07,427 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:46:07,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:46:07,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1186304198, now seen corresponding path program 1 times [2023-11-29 02:46:07,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:46:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265944417] [2023-11-29 02:46:07,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:07,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:46:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:46:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:46:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:46:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:46:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265944417] [2023-11-29 02:46:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265944417] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649364848] [2023-11-29 02:46:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:08,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:46:08,758 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:46:08,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-11-29 02:46:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:09,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 02:46:09,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:09,329 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 19 treesize of output 1 [2023-11-29 02:46:09,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:46:09,669 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 32 treesize of output 12 [2023-11-29 02:46:09,747 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 16 treesize of output 8 [2023-11-29 02:46:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:46:09,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:10,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649364848] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:10,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:46:10,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2023-11-29 02:46:10,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698319937] [2023-11-29 02:46:10,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:46:10,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 02:46:10,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:46:10,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 02:46:10,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 02:46:10,139 INFO L87 Difference]: Start difference. First operand 4220 states and 5456 transitions. Second operand has 31 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 29 states have internal predecessors, (115), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:46:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:46:12,529 INFO L93 Difference]: Finished difference Result 3605 states and 4671 transitions. [2023-11-29 02:46:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 02:46:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 29 states have internal predecessors, (115), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 73 [2023-11-29 02:46:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:46:12,533 INFO L225 Difference]: With dead ends: 3605 [2023-11-29 02:46:12,533 INFO L226 Difference]: Without dead ends: 3605 [2023-11-29 02:46:12,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=493, Invalid=3047, Unknown=0, NotChecked=0, Total=3540 [2023-11-29 02:46:12,534 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 482 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:46:12,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1953 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:46:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2023-11-29 02:46:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3488. [2023-11-29 02:46:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 3259 states have (on average 1.2945688861613993) internal successors, (4219), 3317 states have internal predecessors, (4219), 159 states have call successors, (159), 44 states have call predecessors, (159), 44 states have return successors, (159), 126 states have call predecessors, (159), 159 states have call successors, (159) [2023-11-29 02:46:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4537 transitions. [2023-11-29 02:46:12,567 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4537 transitions. Word has length 73 [2023-11-29 02:46:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:46:12,567 INFO L495 AbstractCegarLoop]: Abstraction has 3488 states and 4537 transitions. [2023-11-29 02:46:12,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 29 states have internal predecessors, (115), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:46:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4537 transitions. [2023-11-29 02:46:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 02:46:12,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:46:12,568 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:46:12,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-11-29 02:46:12,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2023-11-29 02:46:12,769 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:46:12,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:46:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash -790256668, now seen corresponding path program 1 times [2023-11-29 02:46:12,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:46:12,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318357087] [2023-11-29 02:46:12,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:46:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:46:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:46:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:46:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:46:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318357087] [2023-11-29 02:46:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318357087] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853097749] [2023-11-29 02:46:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:14,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:14,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:46:14,803 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:46:14,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-11-29 02:46:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:15,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-29 02:46:15,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:15,245 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-29 02:46:15,612 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:46:15,613 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 21 treesize of output 24 [2023-11-29 02:46:15,629 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-29 02:46:15,629 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 27 treesize of output 15 [2023-11-29 02:46:15,773 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 40 treesize of output 32 [2023-11-29 02:46:15,984 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 34 treesize of output 25 [2023-11-29 02:46:16,370 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:46:16,371 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-29 02:46:16,700 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 1 [2023-11-29 02:46:16,817 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-29 02:46:16,961 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-29 02:46:17,111 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 28 treesize of output 15 [2023-11-29 02:46:17,346 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 0 case distinctions, treesize of input 63 treesize of output 35 [2023-11-29 02:46:17,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 44 treesize of output 20 [2023-11-29 02:46:17,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:46:17,821 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 45 treesize of output 35 [2023-11-29 02:46:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:46:17,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:18,379 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_4381) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* |c_ULTIMATE.start_append_one_~to#1| 4) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|)) 4) |c_#StackHeapBarrier|)) is different from false [2023-11-29 02:46:18,395 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4380 (Array Int Int)) (v_ArrVal_4381 (Array Int Int))) (or (not (= v_ArrVal_4380 (let ((.cse0 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select v_ArrVal_4380 .cse0))))) (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_4380) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_4381) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* |c_ULTIMATE.start_append_one_~to#1| 4) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|)) 4) |c_#StackHeapBarrier|))) is different from false [2023-11-29 02:46:18,421 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= 2 |c_ULTIMATE.start_create_item_~term_field~0#1|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| 8)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* |c_ULTIMATE.start_append_one_~to#1| 4) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_4380 (Array Int Int)) (v_ArrVal_4381 (Array Int Int))) (or (not (= v_ArrVal_4380 (store .cse1 .cse2 (select v_ArrVal_4380 .cse2)))) (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_4380) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_4381) .cse3) 4) |c_#StackHeapBarrier|)))) (or .cse0 (forall ((v_ArrVal_4380 (Array Int Int)) (v_ArrVal_4381 (Array Int Int))) (or (not (= (store (let ((.cse4 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| (* |c_ULTIMATE.start_create_item_~term_field~0#1| 4)))) (store .cse1 .cse4 (select v_ArrVal_4380 .cse4))) .cse2 (select v_ArrVal_4380 .cse2)) v_ArrVal_4380)) (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_4380) |c_ULTIMATE.start_create_item_~link#1.base| v_ArrVal_4381) .cse3) 4) |c_#StackHeapBarrier|)))))) is different from false [2023-11-29 02:46:18,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:46:18,448 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 805 treesize of output 754 [2023-11-29 02:46:18,461 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 369 treesize of output 365 [2023-11-29 02:46:18,472 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 365 treesize of output 361 [2023-11-29 02:46:18,566 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 7 treesize of output 5 [2023-11-29 02:46:18,569 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 7 treesize of output 5 [2023-11-29 02:46:18,578 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 290 treesize of output 286 [2023-11-29 02:46:18,683 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 68 treesize of output 66 [2023-11-29 02:46:19,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853097749] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:19,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:46:19,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 54 [2023-11-29 02:46:19,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901428755] [2023-11-29 02:46:19,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:46:19,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-29 02:46:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:46:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-29 02:46:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3946, Unknown=3, NotChecked=384, Total=4556 [2023-11-29 02:46:19,425 INFO L87 Difference]: Start difference. First operand 3488 states and 4537 transitions. Second operand has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 51 states have internal predecessors, (136), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:46:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:46:28,410 INFO L93 Difference]: Finished difference Result 4132 states and 5303 transitions. [2023-11-29 02:46:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-11-29 02:46:28,410 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 51 states have internal predecessors, (136), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 74 [2023-11-29 02:46:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:46:28,414 INFO L225 Difference]: With dead ends: 4132 [2023-11-29 02:46:28,414 INFO L226 Difference]: Without dead ends: 4132 [2023-11-29 02:46:28,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 148 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6593 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1852, Invalid=19619, Unknown=3, NotChecked=876, Total=22350 [2023-11-29 02:46:28,415 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1130 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 4397 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 3279 SdHoareTripleChecker+Invalid, 4558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 4397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:46:28,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 3279 Invalid, 4558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 4397 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 02:46:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4132 states. [2023-11-29 02:46:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4132 to 3667. [2023-11-29 02:46:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3667 states, 3410 states have (on average 1.2976539589442815) internal successors, (4425), 3486 states have internal predecessors, (4425), 177 states have call successors, (177), 54 states have call predecessors, (177), 54 states have return successors, (177), 126 states have call predecessors, (177), 177 states have call successors, (177) [2023-11-29 02:46:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 4779 transitions. [2023-11-29 02:46:28,451 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 4779 transitions. Word has length 74 [2023-11-29 02:46:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:46:28,451 INFO L495 AbstractCegarLoop]: Abstraction has 3667 states and 4779 transitions. [2023-11-29 02:46:28,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 51 states have internal predecessors, (136), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:46:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 4779 transitions. [2023-11-29 02:46:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 02:46:28,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:46:28,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:46:28,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-11-29 02:46:28,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2023-11-29 02:46:28,653 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:46:28,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:46:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -89192090, now seen corresponding path program 1 times [2023-11-29 02:46:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:46:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931700153] [2023-11-29 02:46:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:46:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:46:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:46:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:46:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:46:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931700153] [2023-11-29 02:46:32,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931700153] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028182276] [2023-11-29 02:46:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:32,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:32,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:46:32,611 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:46:32,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-11-29 02:46:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:32,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-29 02:46:32,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:33,503 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:46:33,504 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 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-29 02:46:33,517 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:46:33,517 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 21 treesize of output 20 [2023-11-29 02:46:34,195 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 0 case distinctions, treesize of input 31 treesize of output 22 [2023-11-29 02:46:34,201 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-29 02:46:35,164 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 27 treesize of output 1 [2023-11-29 02:46:35,292 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 0 case distinctions, treesize of input 48 treesize of output 24 [2023-11-29 02:46:35,601 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 29 treesize of output 17 [2023-11-29 02:46:35,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:46:35,693 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 17 treesize of output 17 [2023-11-29 02:46:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:46:35,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:40,280 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 90 treesize of output 68 [2023-11-29 02:46:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028182276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:46,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:46:46,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24] total 53 [2023-11-29 02:46:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608510335] [2023-11-29 02:46:46,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:46:46,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 02:46:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:46:46,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 02:46:46,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5103, Unknown=1, NotChecked=0, Total=5402 [2023-11-29 02:46:46,241 INFO L87 Difference]: Start difference. First operand 3667 states and 4779 transitions. Second operand has 54 states, 53 states have (on average 2.490566037735849) internal successors, (132), 50 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:46:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:46:53,523 INFO L93 Difference]: Finished difference Result 3790 states and 4910 transitions. [2023-11-29 02:46:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-29 02:46:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.490566037735849) internal successors, (132), 50 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 74 [2023-11-29 02:46:53,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:46:53,528 INFO L225 Difference]: With dead ends: 3790 [2023-11-29 02:46:53,528 INFO L226 Difference]: Without dead ends: 3790 [2023-11-29 02:46:53,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=909, Invalid=10220, Unknown=1, NotChecked=0, Total=11130 [2023-11-29 02:46:53,529 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 415 mSDsluCounter, 4062 mSDsCounter, 0 mSdLazyCounter, 3631 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 4202 SdHoareTripleChecker+Invalid, 3686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:46:53,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 4202 Invalid, 3686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3631 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 02:46:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2023-11-29 02:46:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 3658. [2023-11-29 02:46:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 3401 states have (on average 1.2984416348132901) internal successors, (4416), 3477 states have internal predecessors, (4416), 177 states have call successors, (177), 54 states have call predecessors, (177), 54 states have return successors, (177), 126 states have call predecessors, (177), 177 states have call successors, (177) [2023-11-29 02:46:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4770 transitions. [2023-11-29 02:46:53,563 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4770 transitions. Word has length 74 [2023-11-29 02:46:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:46:53,564 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 4770 transitions. [2023-11-29 02:46:53,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.490566037735849) internal successors, (132), 50 states have internal predecessors, (132), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:46:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4770 transitions. [2023-11-29 02:46:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 02:46:53,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:46:53,565 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:46:53,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2023-11-29 02:46:53,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:53,765 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:46:53,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:46:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2134392757, now seen corresponding path program 1 times [2023-11-29 02:46:53,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:46:53,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875870835] [2023-11-29 02:46:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:46:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:46:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:46:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:54,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:46:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:46:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:46:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875870835] [2023-11-29 02:46:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875870835] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516942919] [2023-11-29 02:46:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:46:54,585 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:46:54,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-11-29 02:46:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:54,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 02:46:54,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:55,053 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-29 02:46:55,292 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-29 02:46:55,468 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 17 treesize of output 9 [2023-11-29 02:46:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:46:55,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:55,505 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 40 treesize of output 36 [2023-11-29 02:46:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 02:46:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516942919] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:46:55,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:46:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 30 [2023-11-29 02:46:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061675642] [2023-11-29 02:46:55,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:46:55,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 02:46:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:46:55,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 02:46:55,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2023-11-29 02:46:55,810 INFO L87 Difference]: Start difference. First operand 3658 states and 4770 transitions. Second operand has 31 states, 30 states have (on average 5.633333333333334) internal successors, (169), 28 states have internal predecessors, (169), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-29 02:46:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:46:56,902 INFO L93 Difference]: Finished difference Result 3719 states and 4841 transitions. [2023-11-29 02:46:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 02:46:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 5.633333333333334) internal successors, (169), 28 states have internal predecessors, (169), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2023-11-29 02:46:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:46:56,906 INFO L225 Difference]: With dead ends: 3719 [2023-11-29 02:46:56,906 INFO L226 Difference]: Without dead ends: 3719 [2023-11-29 02:46:56,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=2009, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 02:46:56,907 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 617 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:46:56,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1534 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:46:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2023-11-29 02:46:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3682. [2023-11-29 02:46:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3425 states have (on average 1.2978102189781022) internal successors, (4445), 3501 states have internal predecessors, (4445), 177 states have call successors, (177), 54 states have call predecessors, (177), 54 states have return successors, (177), 126 states have call predecessors, (177), 177 states have call successors, (177) [2023-11-29 02:46:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4799 transitions. [2023-11-29 02:46:56,941 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4799 transitions. Word has length 75 [2023-11-29 02:46:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:46:56,942 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4799 transitions. [2023-11-29 02:46:56,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 5.633333333333334) internal successors, (169), 28 states have internal predecessors, (169), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-29 02:46:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4799 transitions. [2023-11-29 02:46:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 02:46:56,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:46:56,943 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:46:56,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2023-11-29 02:46:57,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:57,143 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:46:57,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:46:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1741665814, now seen corresponding path program 1 times [2023-11-29 02:46:57,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:46:57,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625388224] [2023-11-29 02:46:57,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:57,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:46:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:46:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:46:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:46:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 02:46:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:46:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625388224] [2023-11-29 02:46:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625388224] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307687048] [2023-11-29 02:46:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:46:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:46:58,078 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:46:58,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-11-29 02:46:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:58,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 02:46:58,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:58,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:46:58,686 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-29 02:46:58,892 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 1 [2023-11-29 02:46:59,106 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 16 treesize of output 8 [2023-11-29 02:46:59,150 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-29 02:46:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:46:59,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:59,296 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 43 treesize of output 39 [2023-11-29 02:46:59,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:46:59,303 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 50 [2023-11-29 02:46:59,661 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 02:46:59,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 13 treesize of output 12 [2023-11-29 02:46:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:46:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307687048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:46:59,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:46:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 40 [2023-11-29 02:46:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835536765] [2023-11-29 02:46:59,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:46:59,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 02:46:59,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:46:59,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 02:46:59,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1476, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 02:46:59,701 INFO L87 Difference]: Start difference. First operand 3682 states and 4799 transitions. Second operand has 41 states, 40 states have (on average 4.475) internal successors, (179), 38 states have internal predecessors, (179), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 02:47:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:47:00,861 INFO L93 Difference]: Finished difference Result 4282 states and 5370 transitions. [2023-11-29 02:47:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:47:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 4.475) internal successors, (179), 38 states have internal predecessors, (179), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 76 [2023-11-29 02:47:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:47:00,866 INFO L225 Difference]: With dead ends: 4282 [2023-11-29 02:47:00,866 INFO L226 Difference]: Without dead ends: 4282 [2023-11-29 02:47:00,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=2756, Unknown=0, NotChecked=0, Total=3192 [2023-11-29 02:47:00,866 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 670 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:47:00,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1486 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:47:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2023-11-29 02:47:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 3929. [2023-11-29 02:47:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3929 states, 3660 states have (on average 1.2363387978142077) internal successors, (4525), 3732 states have internal predecessors, (4525), 190 states have call successors, (190), 57 states have call predecessors, (190), 57 states have return successors, (190), 139 states have call predecessors, (190), 190 states have call successors, (190) [2023-11-29 02:47:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 4905 transitions. [2023-11-29 02:47:00,905 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 4905 transitions. Word has length 76 [2023-11-29 02:47:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:47:00,906 INFO L495 AbstractCegarLoop]: Abstraction has 3929 states and 4905 transitions. [2023-11-29 02:47:00,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 4.475) internal successors, (179), 38 states have internal predecessors, (179), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 02:47:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 4905 transitions. [2023-11-29 02:47:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 02:47:00,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:47:00,907 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:00,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2023-11-29 02:47:01,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:47:01,108 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2023-11-29 02:47:01,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2007715540, now seen corresponding path program 3 times [2023-11-29 02:47:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:01,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652912692] [2023-11-29 02:47:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:03,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:47:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:47:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:47:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 02:47:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652912692] [2023-11-29 02:47:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652912692] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174662353] [2023-11-29 02:47:03,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:47:03,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:47:03,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:47:03,011 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:47:03,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b093d25e-3375-4978-ab55-83ddf1c5b391/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-11-29 02:47:04,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 02:47:04,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:47:04,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 02:47:04,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:47:04,587 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-29 02:47:04,596 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-29 02:47:04,659 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-29 02:47:04,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 23 treesize of output 11 [2023-11-29 02:47:04,737 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-29 02:47:04,747 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-29 02:47:04,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 23 treesize of output 11 [2023-11-29 02:47:04,839 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-29 02:47:04,918 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-29 02:47:04,929 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-29 02:47:05,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,024 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 34 treesize of output 21 [2023-11-29 02:47:05,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,034 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 28 treesize of output 30 [2023-11-29 02:47:05,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-29 02:47:05,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,143 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 30 treesize of output 21 [2023-11-29 02:47:05,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:05,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2023-11-29 02:47:05,301 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2023-11-29 02:47:05,301 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 2 case distinctions, treesize of input 34 treesize of output 29 [2023-11-29 02:47:06,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:06,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:06,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:06,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:47:06,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 122 [2023-11-29 02:47:06,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:47:06,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:47:06,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 79 [2023-11-29 02:47:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 02:47:06,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:12,239 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (< c_~i~0 11)) (.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse5 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| 1)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse2 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|)) (.cse7 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (and (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse4 (* v_y_3 4294967296))) (let ((.cse3 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse4))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse0 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse3 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse0 0) 0)) (= (select .cse0 4) 0)))) (< (+ v_z_3 .cse4) .cse5) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse3 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse7))) (or (and (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse8 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse8) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 .cse8) .cse5)))) (< v_z_3 0) (< (+ v_z_3 1) .cse7))) (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse7) (forall ((v_y_3 Int)) (let ((.cse9 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse9) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 .cse9) .cse5))))))) .cse10) (or (forall ((v_z_3 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4974 Int) (v_ArrVal_4971 Int)) (let ((.cse11 (* v_y_3 4294967296))) (let ((.cse12 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse11))) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< (+ v_z_3 .cse11) .cse5) (< v_z_3 0) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse12 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 1) .cse7) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse12 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)))))) .cse10) (or (< 0 .cse7) (and (or (and (forall ((v_y_3 Int)) (let ((.cse13 (* v_y_3 4294967296))) (or (< (+ 4294967294 .cse13) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse13) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (forall ((v_y_3 Int)) (let ((.cse14 (* v_y_3 4294967296))) (or (< (+ 4294967294 .cse14) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse14) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)))))) .cse10) (forall ((v_y_3 Int)) (let ((.cse15 (* v_y_3 4294967296))) (let ((.cse16 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse15))) (or (< (+ 4294967294 .cse15) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse16 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse17 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse16 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse17 4) 0)) (= (select .cse17 0) 0)))))))) (or (forall ((v_z_3 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4974 Int) (v_ArrVal_4971 Int)) (let ((.cse18 (* v_y_3 4294967296))) (let ((.cse19 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse18))) (or (< 4294967295 v_z_3) (< (+ v_z_3 .cse18) .cse5) (< v_z_3 0) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse19 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse19 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)))))) .cse10) (or (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse20 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse20) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 .cse20) .cse5)))) (< v_z_3 0))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse21 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse21) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 .cse21) .cse5))))))) .cse10) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse24 (* v_y_3 4294967296))) (let ((.cse22 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse24))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse22 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse23 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse22 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse23 4) 0)) (= (select .cse23 0) 0)))) (< (+ v_z_3 .cse24) .cse5))))))) (forall ((v_y_3 Int)) (let ((.cse25 (* v_y_3 4294967296))) (let ((.cse27 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse25))) (or (< (+ 4294967294 .cse25) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse26 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse27 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse26 4) 0)) (= (select .cse26 0) 0)))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse27 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))) (forall ((v_z_3 Int)) (or (forall ((v_y_3 Int)) (let ((.cse30 (* v_y_3 4294967296))) (let ((.cse29 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse30))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse28 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse29 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse28 0) 0)) (= (select .cse28 4) 0)))) (< (+ v_z_3 .cse30) .cse5) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse29 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))))) (< 4294967295 v_z_3) (< v_z_3 0))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse32 (* v_y_3 4294967296))) (let ((.cse31 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse32))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse31 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (< (+ v_z_3 .cse32) .cse5) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse33 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse31 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse33 4) 0)) (= (select .cse33 0) 0)))))))))) (or (forall ((v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4974 Int) (v_ArrVal_4971 Int)) (let ((.cse34 (* v_y_3 4294967296))) (let ((.cse35 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse34))) (or (< (+ 4294967294 .cse34) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse35 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse35 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)))))) .cse10) (forall ((v_y_3 Int)) (let ((.cse36 (* v_y_3 4294967296))) (let ((.cse37 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse36))) (or (< (+ 4294967294 .cse36) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse37 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse38 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse37 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse38 4) 0) (not (= (select .cse38 0) 0))))))))) (forall ((v_y_3 Int)) (let ((.cse39 (* v_y_3 4294967296))) (let ((.cse40 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse39))) (or (< (+ 4294967294 .cse39) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse40 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse41 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse40 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse41 4) 0) (not (= (select .cse41 0) 0))))))))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse44 (* v_y_3 4294967296))) (let ((.cse42 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse44))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse42 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse43 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse42 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse43 4) 0) (not (= (select .cse43 0) 0))))) (< (+ v_z_3 .cse44) .cse5))))))))) (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse47 (* v_y_3 4294967296))) (let ((.cse45 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse47))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse45 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse46 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse45 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse46 4) 0) (not (= (select .cse46 0) 0))))) (< (+ v_z_3 .cse47) .cse5))))) (< (+ v_z_3 1) .cse7))) (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse50 (* v_y_3 4294967296))) (let ((.cse48 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse50))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse48 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse49 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse48 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse49 4) 0)) (= (select .cse49 0) 0)))) (< (+ v_z_3 .cse50) .cse5))))) (< (+ v_z_3 1) .cse7))) (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse52 (* v_y_3 4294967296))) (let ((.cse51 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse52))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse1 .cse2 v_ArrVal_4968) .cse51 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (< (+ v_z_3 .cse52) .cse5) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse53 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse6 .cse2 v_ArrVal_4967) .cse51 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse53 4) 0)) (= (select .cse53 0) 0)))))))) (< (+ v_z_3 1) .cse7))))) is different from true [2023-11-29 02:47:17,152 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))) (let ((.cse11 (< c_~i~0 11)) (.cse7 (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) .cse4 0)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse5 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| 2)) (.cse8 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (and (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse0 (* v_y_3 4294967296))) (let ((.cse6 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse0))) (or (< (+ v_z_3 .cse0) .cse1) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse6 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse2 4) 0)) (= (select .cse2 0) 0)))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse6 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse8))) (or (< 0 .cse8) (and (or (and (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse9 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse9) .cse1) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse9) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (forall ((v_z_3 Int)) (or (forall ((v_y_3 Int)) (let ((.cse10 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse10) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 .cse10) .cse1)))) (< 4294967295 v_z_3) (< v_z_3 0)))) .cse11) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse12 (* v_y_3 4294967296))) (let ((.cse13 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse12))) (or (< (+ .cse12 4294967293) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse13 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse14 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse13 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse14 4) 0)) (= (select .cse14 0) 0)))))))) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse17 (* v_y_3 4294967296))) (let ((.cse16 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse17))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse15 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse16 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse15 0) 0)) (= (select .cse15 4) 0)))) (< (+ .cse17 4294967293) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse16 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))))) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse19 (* v_y_3 4294967296))) (let ((.cse18 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse19))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse18 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (< (+ .cse19 4294967293) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse20 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse18 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse20 0) 0) (not (= (select .cse20 4) 0))))))))) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (forall ((v_y_3 Int)) (let ((.cse23 (* v_y_3 4294967296))) (let ((.cse22 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse23))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse21 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse22 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse21 4) 0)) (= (select .cse21 0) 0)))) (< (+ v_z_3 .cse23) .cse1) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse22 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))))))) (< 4294967295 v_z_3) (< v_z_3 0))) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (forall ((v_y_3 Int)) (let ((.cse24 (* v_y_3 4294967296))) (let ((.cse26 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse24))) (or (< (+ v_z_3 .cse24) .cse1) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse25 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse26 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse25 4) 0)) (= (select .cse25 0) 0)))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse26 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))) (< 4294967295 v_z_3) (< v_z_3 0))) (or (forall ((v_z_3 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (v_ArrVal_4971 Int)) (let ((.cse28 (* v_y_3 4294967296))) (let ((.cse27 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse28))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse27 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 .cse28) .cse1) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse27 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)))))) .cse11) (or (forall ((v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (v_ArrVal_4971 Int)) (let ((.cse30 (* v_y_3 4294967296))) (let ((.cse29 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse30))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse29 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ .cse30 4294967293) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse29 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)))))) .cse11) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse33 (* v_y_3 4294967296))) (let ((.cse31 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse33))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse31 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse32 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse31 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse32 0) 0)) (= (select .cse32 4) 0)))) (< (+ v_z_3 .cse33) .cse1))))))) (or (and (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse34 (* v_y_3 4294967296))) (or (< (+ .cse34 4294967293) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse34) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (forall ((v_y_3 Int)) (let ((.cse35 (* v_y_3 4294967296))) (or (< (+ .cse35 4294967293) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse35) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)))))) .cse11) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse36 (* v_y_3 4294967296))) (let ((.cse37 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse36))) (or (< (+ .cse36 4294967293) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse37 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse38 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse37 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse38 0) 0)) (= (select .cse38 4) 0)))))))) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse41 (* v_y_3 4294967296))) (let ((.cse39 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse41))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse39 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse40 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse39 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse40 4) 0) (not (= (select .cse40 0) 0))))) (< (+ v_z_3 .cse41) .cse1))))))))) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse44 (* v_y_3 4294967296))) (let ((.cse43 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse44))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse42 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse43 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse42 4) 0)) (= (select .cse42 0) 0)))) (< (+ v_z_3 .cse44) .cse1) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse43 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))))))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse8))) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse47 (* v_y_3 4294967296))) (let ((.cse45 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse47))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse45 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse46 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse45 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse46 4) 0) (not (= (select .cse46 0) 0))))) (< (+ v_z_3 .cse47) .cse1))))) (< (+ v_z_3 1) .cse8))) (or (forall ((v_z_3 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (v_ArrVal_4971 Int)) (let ((.cse49 (* v_y_3 4294967296))) (let ((.cse48 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse49))) (or (= 4294967295 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse48 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 .cse49) .cse1) (< (+ v_z_3 1) .cse8) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse48 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)))))) .cse11) (or (and (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse50 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse50) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 .cse50) .cse1)))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse8))) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse8) (forall ((v_y_3 Int)) (let ((.cse51 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse51) .cse1) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse51) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)))))))) .cse11) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse54 (* v_y_3 4294967296))) (let ((.cse52 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse54))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store .cse7 .cse5 v_ArrVal_4967) .cse52 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse53 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse3 .cse4 v_ArrVal_4963) .cse5 v_ArrVal_4968) .cse52 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse53 0) 0)) (= (select .cse53 4) 0)))) (< (+ v_z_3 .cse54) .cse1))))) (< (+ v_z_3 1) .cse8)))))) is different from true [2023-11-29 02:47:22,429 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse83 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))) (let ((.cse14 (< c_~i~0 11)) (.cse8 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| 1)) (.cse6 (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) .cse83 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#value#1| 256))) (.cse1 (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) .cse83 0)) (.cse7 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (and (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse0 (* v_y_3 4294967296))) (let ((.cse2 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse3 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse4 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse0))) (or (< (+ v_z_3 .cse0) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse2 0) .cse3 v_ArrVal_4967) .cse4 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse2 v_ArrVal_4963) .cse3 v_ArrVal_4968) .cse4 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse5 4) 0) (not (= (select .cse5 0) 0))))))))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse7))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse9 (* v_y_3 4294967296))) (let ((.cse10 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse11 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse12 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse9))) (or (< (+ v_z_3 .cse9) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse10 v_ArrVal_4963) .cse11 v_ArrVal_4968) .cse12 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse13 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse10 0) .cse11 v_ArrVal_4967) .cse12 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse13 4) 0) (not (= (select .cse13 0) 0))))))))) (< (+ v_z_3 1) .cse7))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (or .cse14 (forall ((v_z_3 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4971 Int)) (let ((.cse15 (* v_y_3 4294967296))) (let ((.cse16 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse17 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse18 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse15))) (or (= 4294967295 v_z_3) (< (+ v_z_3 .cse15) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (< 4294967295 v_z_3) (< v_z_3 0) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse16 0) .cse17 v_ArrVal_4967) .cse18 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse16 v_ArrVal_4963) .cse17 v_ArrVal_4968) .cse18 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 1) .cse7)))))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse7) (forall ((v_y_3 Int)) (let ((.cse19 (* v_y_3 4294967296))) (let ((.cse20 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse21 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse22 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse19))) (or (< (+ v_z_3 .cse19) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse20 v_ArrVal_4963) .cse21 v_ArrVal_4968) .cse22 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse23 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse20 0) .cse21 v_ArrVal_4967) .cse22 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse23 0) 0) (not (= (select .cse23 4) 0))))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (or (and (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse24 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse24) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse24) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (< v_z_3 0) (< (+ v_z_3 1) .cse7))))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse25 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse25) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse25) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))) (< v_z_3 0) (< (+ v_z_3 1) .cse7))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8)))) .cse14) (or (and (or (forall ((v_z_3 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4971 Int)) (let ((.cse26 (* v_y_3 4294967296))) (let ((.cse27 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse28 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse29 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse26))) (or (< (+ v_z_3 .cse26) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (< 4294967295 v_z_3) (< v_z_3 0) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse27 0) .cse28 v_ArrVal_4967) .cse29 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse27 v_ArrVal_4963) .cse28 v_ArrVal_4968) .cse29 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)))))) .cse14) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse34 (* v_y_3 4294967296))) (let ((.cse31 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse32 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse33 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse34))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse30 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse31 v_ArrVal_4963) .cse32 v_ArrVal_4968) .cse33 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse30 0) 0) (not (= 0 (select .cse30 4)))))) (< (+ .cse34 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse31 0) .cse32 v_ArrVal_4967) .cse33 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse39 (* v_y_3 4294967296))) (let ((.cse35 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse36 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse37 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse39))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse35 0) .cse36 v_ArrVal_4967) .cse37 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse38 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse35 v_ArrVal_4963) .cse36 v_ArrVal_4968) .cse37 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse38 0) 0)) (= 0 (select .cse38 4))))) (< (+ .cse39 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (or (and (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse40 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse40) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse40) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))) (< v_z_3 0))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse41 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse41) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse41) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (< v_z_3 0)))))) .cse14) (or (and (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse42 (* v_y_3 4294967296))) (or (< (+ .cse42 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse42) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_y_3 Int)) (let ((.cse43 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse43) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ .cse43 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8)))) .cse14) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (forall ((v_y_3 Int)) (let ((.cse44 (* v_y_3 4294967296))) (let ((.cse45 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse46 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse47 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse44))) (or (< (+ v_z_3 .cse44) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse45 0) .cse46 v_ArrVal_4967) .cse47 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse48 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse45 v_ArrVal_4963) .cse46 v_ArrVal_4968) .cse47 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse48 4) 0) (not (= (select .cse48 0) 0))))))))) (< 4294967295 v_z_3) (< v_z_3 0))))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse49 (* v_y_3 4294967296))) (let ((.cse50 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse51 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse52 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse49))) (or (< (+ v_z_3 .cse49) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse50 v_ArrVal_4963) .cse51 v_ArrVal_4968) .cse52 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse53 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse50 0) .cse51 v_ArrVal_4967) .cse52 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse53 0) 0) (not (= (select .cse53 4) 0))))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (or (forall ((v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4971 Int)) (let ((.cse57 (* v_y_3 4294967296))) (let ((.cse54 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse55 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse56 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse57))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse54 v_ArrVal_4963) .cse55 v_ArrVal_4968) .cse56 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse54 0) .cse55 v_ArrVal_4967) .cse56 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (< (+ .cse57 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))) .cse14) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse58 (* v_y_3 4294967296))) (let ((.cse59 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse60 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse61 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse58))) (or (< (+ v_z_3 .cse58) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse59 v_ArrVal_4963) .cse60 v_ArrVal_4968) .cse61 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse62 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse59 0) .cse60 v_ArrVal_4967) .cse61 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse62 4) 0) (not (= (select .cse62 0) 0))))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse67 (* v_y_3 4294967296))) (let ((.cse63 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse64 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse65 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse67))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse63 v_ArrVal_4963) .cse64 v_ArrVal_4968) .cse65 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse66 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse63 0) .cse64 v_ArrVal_4967) .cse65 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse66 4) 0) (not (= (select .cse66 0) 0))))) (< (+ .cse67 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse68 (* v_y_3 4294967296))) (let ((.cse70 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse71 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse72 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse68))) (or (< (+ v_z_3 .cse68) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse69 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse70 v_ArrVal_4963) .cse71 v_ArrVal_4968) .cse72 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse69 4) 0)) (= (select .cse69 0) 0)))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse70 0) .cse71 v_ArrVal_4967) .cse72 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8))) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse77 (* v_y_3 4294967296))) (let ((.cse73 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse74 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse75 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse77))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse73 v_ArrVal_4963) .cse74 v_ArrVal_4968) .cse75 v_ArrVal_4974)) |c_~#list~0.base|) 4)))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse76 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse73 0) .cse74 v_ArrVal_4967) .cse75 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse76 4) 0)) (= (select .cse76 0) 0)))) (< (+ .cse77 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8)))) (< 0 .cse7)) (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse8) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse78 (* v_y_3 4294967296))) (let ((.cse80 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse81 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse82 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse78))) (or (< (+ v_z_3 .cse78) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse79 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse6 .cse80 v_ArrVal_4963) .cse81 v_ArrVal_4968) .cse82 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse79 4) 0)) (= (select .cse79 0) 0)))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store .cse1 .cse80 0) .cse81 v_ArrVal_4967) .cse82 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))) (< (+ v_z_3 1) .cse7)))))))) is different from true [2023-11-29 02:47:27,813 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse24 (< c_~i~0 11)) (.cse11 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse6 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#value#1| 256)) (.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse4 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 1)) (.cse0 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| 2))) (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse1 (* v_y_3 4294967296))) (let ((.cse7 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse8 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse9 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse1))) (or (< (+ v_z_3 .cse1) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse7 v_ArrVal_4963) .cse8 v_ArrVal_4968) .cse9 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse2 0) 0) (not (= (select .cse2 4) 0))))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse7 0) .cse8 v_ArrVal_4967) .cse9 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse11))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse16 (* v_y_3 4294967296))) (let ((.cse13 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse14 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse15 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse16))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse12 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse13 0) .cse14 v_ArrVal_4967) .cse15 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse12 0) 0)) (= (select .cse12 4) 0)))) (< (+ v_z_3 .cse16) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse13 v_ArrVal_4963) .cse14 v_ArrVal_4968) .cse15 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (< v_z_3 0) (< (+ v_z_3 1) .cse11))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse17 (* v_y_3 4294967296))) (let ((.cse18 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse19 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse20 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse17))) (or (< (+ v_z_3 .cse17) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse18 0) .cse19 v_ArrVal_4967) .cse20 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse21 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse18 v_ArrVal_4963) .cse19 v_ArrVal_4968) .cse20 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse21 4) 0) (not (= (select .cse21 0) 0))))))))) (< (+ v_z_3 1) .cse11))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (or (and (forall ((v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse22 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse22) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse22) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (< v_z_3 0) (< (+ v_z_3 1) .cse11))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (forall ((v_ArrVal_4958 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse23 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse23) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 .cse23) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse11)))))) .cse24) (or (forall ((v_ArrVal_4958 Int) (v_z_3 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4971 Int)) (let ((.cse25 (* v_y_3 4294967296))) (let ((.cse26 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse27 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse28 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse25))) (or (= 4294967295 v_z_3) (< (+ v_z_3 .cse25) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (< 4294967295 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse26 0) .cse27 v_ArrVal_4967) .cse28 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< v_z_3 0) (< (+ v_z_3 1) .cse11) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse26 v_ArrVal_4963) .cse27 v_ArrVal_4968) .cse28 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)))))) .cse24) (or (< 0 .cse11) (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse32 (* v_y_3 4294967296))) (let ((.cse29 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse30 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse31 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse32))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse29 v_ArrVal_4963) .cse30 v_ArrVal_4968) .cse31 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (< (+ .cse32 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse33 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse29 0) .cse30 v_ArrVal_4967) .cse31 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse33 0) 0)) (= (select .cse33 4) 0)))))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse38 (* v_y_3 4294967296))) (let ((.cse34 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse35 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse36 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse38))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse34 0) .cse35 v_ArrVal_4967) .cse36 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse37 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse34 v_ArrVal_4963) .cse35 v_ArrVal_4968) .cse36 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse37 4) 0)) (= (select .cse37 0) 0)))) (< (+ .cse38 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))))) (or (forall ((v_z_3 Int) (v_ArrVal_4958 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4971 Int)) (let ((.cse39 (* v_y_3 4294967296))) (let ((.cse40 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse41 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse42 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse39))) (or (< (+ v_z_3 .cse39) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (< 4294967295 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse40 0) .cse41 v_ArrVal_4967) .cse42 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< v_z_3 0) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse40 v_ArrVal_4963) .cse41 v_ArrVal_4968) .cse42 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)))))) .cse24) (or (forall ((v_ArrVal_4958 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4971 Int)) (let ((.cse46 (* v_y_3 4294967296))) (let ((.cse43 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse44 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse45 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse46))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse43 v_ArrVal_4963) .cse44 v_ArrVal_4968) .cse45 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse43 0) .cse44 v_ArrVal_4967) .cse45 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (< (+ .cse46 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))) .cse24) (or (and (forall ((v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse47 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse47) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< (+ .cse47 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)))))) (forall ((v_ArrVal_4958 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_y_3 Int)) (let ((.cse48 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse48) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ .cse48 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))))) .cse24) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse52 (* v_y_3 4294967296))) (let ((.cse49 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse50 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse51 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse52))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse49 0) .cse50 v_ArrVal_4967) .cse51 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (< (+ .cse52 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse53 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse49 v_ArrVal_4963) .cse50 v_ArrVal_4968) .cse51 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse53 0) 0)) (= (select .cse53 4) 0)))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (forall ((v_y_3 Int)) (let ((.cse54 (* v_y_3 4294967296))) (let ((.cse56 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse57 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse58 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse54))) (or (< (+ v_z_3 .cse54) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse55 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse56 v_ArrVal_4963) .cse57 v_ArrVal_4968) .cse58 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse55 0) 0) (not (= (select .cse55 4) 0))))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse56 0) .cse57 v_ArrVal_4967) .cse58 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))) (< 4294967295 v_z_3) (< v_z_3 0))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse62 (* v_y_3 4294967296))) (let ((.cse59 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse60 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse61 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse62))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse59 v_ArrVal_4963) .cse60 v_ArrVal_4968) .cse61 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (< (+ v_z_3 .cse62) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse63 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse59 0) .cse60 v_ArrVal_4967) .cse61 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse63 0) 0) (not (= (select .cse63 4) 0))))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (or .cse24 (and (forall ((v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse64 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse64) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse64) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (< v_z_3 0))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (forall ((v_ArrVal_4958 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int)) (or (forall ((v_y_3 Int)) (let ((.cse65 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse65) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ v_z_3 .cse65) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))) (< 4294967295 v_z_3) (< v_z_3 0))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse70 (* v_y_3 4294967296))) (let ((.cse67 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse68 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse69 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse70))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse66 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse67 0) .cse68 v_ArrVal_4967) .cse69 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse66 0) 0) (not (= (select .cse66 4) 0))))) (< (+ .cse70 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse67 v_ArrVal_4963) .cse68 v_ArrVal_4968) .cse69 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse71 (* v_y_3 4294967296))) (let ((.cse72 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse73 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse74 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse71))) (or (< (+ v_z_3 .cse71) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse72 0) .cse73 v_ArrVal_4967) .cse74 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse75 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse72 v_ArrVal_4963) .cse73 v_ArrVal_4968) .cse74 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse75 4) 0) (not (= (select .cse75 0) 0))))))))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse80 (* v_y_3 4294967296))) (let ((.cse77 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse78 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse79 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse80))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse76 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse77 0) .cse78 v_ArrVal_4967) .cse79 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse76 0) 0)) (= (select .cse76 4) 0)))) (< (+ v_z_3 .cse80) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse77 v_ArrVal_4963) .cse78 v_ArrVal_4968) .cse79 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (< v_z_3 0))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse11) (forall ((v_y_3 Int)) (let ((.cse84 (* v_y_3 4294967296))) (let ((.cse81 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse82 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse83 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse84))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_4955) .cse5 .cse6) .cse81 v_ArrVal_4963) .cse82 v_ArrVal_4968) .cse83 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (< (+ v_z_3 .cse84) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse85 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store .cse10 .cse4 v_ArrVal_4958) .cse5 0) .cse81 0) .cse82 v_ArrVal_4967) .cse83 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse85 0) 0) (not (= (select .cse85 4) 0))))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))))) is different from true [2023-11-29 02:47:33,385 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse10 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| 3)) (.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse2 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 2)) (.cse9 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#value#1| 256)) (.cse11 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (.cse12 (< c_~i~0 11))) (and (or (forall ((v_z_3 Int) (v_ArrVal_4958 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (v_ArrVal_4951 Int) (v_ArrVal_4971 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (let ((.cse0 (* v_y_3 4294967296))) (let ((.cse5 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse6 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse7 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse0))) (or (= 4294967295 v_z_3) (< (+ v_z_3 .cse0) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse5 0) .cse6 v_ArrVal_4967) .cse7 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< 4294967295 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse5 v_ArrVal_4963) .cse6 v_ArrVal_4968) .cse7 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< v_z_3 0) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (< (+ v_z_3 1) .cse11))))) .cse12) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse16 (* v_y_3 4294967296))) (let ((.cse13 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse14 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse15 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse16))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse13 0) .cse14 v_ArrVal_4967) .cse15 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (< (+ v_z_3 .cse16) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse17 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse13 v_ArrVal_4963) .cse14 v_ArrVal_4968) .cse15 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse17 4) 0) (not (= (select .cse17 0) 0))))))))) (< (+ v_z_3 1) .cse11))))) (or (< 0 .cse11) (and (or (forall ((v_z_3 Int) (v_ArrVal_4958 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (v_ArrVal_4951 Int) (v_ArrVal_4971 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (let ((.cse18 (* v_y_3 4294967296))) (let ((.cse19 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse20 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse21 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse18))) (or (< (+ v_z_3 .cse18) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse19 0) .cse20 v_ArrVal_4967) .cse21 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< 4294967295 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse19 v_ArrVal_4963) .cse20 v_ArrVal_4968) .cse21 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< v_z_3 0) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10))))) .cse12) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse22 (* v_y_3 4294967296))) (let ((.cse23 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse24 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse25 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse22))) (or (< (+ v_z_3 .cse22) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse23 v_ArrVal_4963) .cse24 v_ArrVal_4968) .cse25 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse26 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse23 0) .cse24 v_ArrVal_4967) .cse25 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse26 4) 0)) (= (select .cse26 0) 0)))))))))))) (or (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int)) (or (forall ((v_y_3 Int)) (let ((.cse27 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse27) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse27) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))) (< 4294967295 v_z_3) (< v_z_3 0))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10))) (forall ((v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse28 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse28) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse28) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10)))) .cse12) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse33 (* v_y_3 4294967296))) (let ((.cse29 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse30 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse31 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse33))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse29 0) .cse30 v_ArrVal_4967) .cse31 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse32 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse29 v_ArrVal_4963) .cse30 v_ArrVal_4968) .cse31 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse32 0) 0) (not (= (select .cse32 4) 0))))) (< (+ .cse33 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse38 (* v_y_3 4294967296))) (let ((.cse35 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse36 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse37 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse38))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse34 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse35 0) .cse36 v_ArrVal_4967) .cse37 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse34 4) 0) (not (= (select .cse34 0) 0))))) (< (+ v_z_3 .cse38) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse35 v_ArrVal_4963) .cse36 v_ArrVal_4968) .cse37 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (< v_z_3 0))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse43 (* v_y_3 4294967296))) (let ((.cse39 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse40 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse41 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse43))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse39 0) .cse40 v_ArrVal_4967) .cse41 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse42 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse39 v_ArrVal_4963) .cse40 v_ArrVal_4968) .cse41 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse42 0) 0)) (= (select .cse42 4) 0)))) (< (+ .cse43 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))))) (or (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_y_3 Int)) (let ((.cse44 (* v_y_3 4294967296))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse44) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ .cse44 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10))) (forall ((v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse45 (* v_y_3 4294967296))) (or (< (+ .cse45 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse45) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10)))) .cse12) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (forall ((v_y_3 Int)) (let ((.cse49 (* v_y_3 4294967296))) (let ((.cse46 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse47 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse48 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse49))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse46 0) .cse47 v_ArrVal_4967) .cse48 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (< (+ v_z_3 .cse49) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse50 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse46 v_ArrVal_4963) .cse47 v_ArrVal_4968) .cse48 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse50 4) 0)) (= (select .cse50 0) 0)))))))) (< 4294967295 v_z_3) (< v_z_3 0))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse51 (* v_y_3 4294967296))) (let ((.cse53 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse54 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse55 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse51))) (or (< (+ .cse51 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse52 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse53 0) .cse54 v_ArrVal_4967) .cse55 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse52 4) 0)) (= (select .cse52 0) 0)))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse53 v_ArrVal_4963) .cse54 v_ArrVal_4968) .cse55 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))))))))) (or (forall ((v_ArrVal_4958 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4951 Int) (v_ArrVal_4971 Int)) (let ((.cse59 (* v_y_3 4294967296))) (let ((.cse56 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse57 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse58 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse59))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse56 v_ArrVal_4963) .cse57 v_ArrVal_4968) .cse58 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (< (+ .cse59 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse56 0) .cse57 v_ArrVal_4967) .cse58 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)))))) .cse12) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse60 (* v_y_3 4294967296))) (let ((.cse61 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse62 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse63 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse60))) (or (< (+ .cse60 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse61 v_ArrVal_4963) .cse62 v_ArrVal_4968) .cse63 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse64 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse61 0) .cse62 v_ArrVal_4967) .cse63 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse64 0) 0)) (= (select .cse64 4) 0)))))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse68 (* v_y_3 4294967296))) (let ((.cse65 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse66 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse67 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse68))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse65 0) .cse66 v_ArrVal_4967) .cse67 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (< (+ v_z_3 .cse68) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse69 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse65 v_ArrVal_4963) .cse66 v_ArrVal_4968) .cse67 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse69 4) 0) (not (= (select .cse69 0) 0))))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse70 (* v_y_3 4294967296))) (let ((.cse71 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse72 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse73 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse70))) (or (< (+ v_z_3 .cse70) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse71 v_ArrVal_4963) .cse72 v_ArrVal_4968) .cse73 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse74 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse71 0) .cse72 v_ArrVal_4967) .cse73 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse74 4) 0)) (= (select .cse74 0) 0)))))))) (< (+ v_z_3 1) .cse11))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse79 (* v_y_3 4294967296))) (let ((.cse76 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse77 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse78 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse79))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse75 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse76 0) .cse77 v_ArrVal_4967) .cse78 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse75 4) 0) (not (= (select .cse75 0) 0))))) (< (+ v_z_3 .cse79) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse76 v_ArrVal_4963) .cse77 v_ArrVal_4968) .cse78 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (< v_z_3 0) (< (+ v_z_3 1) .cse11))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse83 (* v_y_3 4294967296))) (let ((.cse80 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse81 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse82 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse83))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) .cse80 0) .cse81 v_ArrVal_4967) .cse82 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (< (+ v_z_3 .cse83) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse84 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) .cse80 v_ArrVal_4963) .cse81 v_ArrVal_4968) .cse82 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse84 4) 0)) (= (select .cse84 0) 0)))))))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse11))))) (or (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int)) (or (forall ((v_y_3 Int)) (let ((.cse85 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse85) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse1 .cse2 v_ArrVal_4951) .cse3 v_ArrVal_4958) .cse4 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse85) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))) (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse11))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10))) (forall ((v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse10) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse86 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse86) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store .cse8 .cse2 v_ArrVal_4954) .cse3 v_ArrVal_4955) .cse4 .cse9) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse86) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (< (+ v_z_3 1) .cse11)))))) .cse12))) is different from true [2023-11-29 02:47:39,431 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse16 (< c_~i~0 11)) (.cse0 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| 4)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (.cse4 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 1)) (.cse6 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 2)) (.cse7 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 3)) (.cse12 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#value#1| 256)) (.cse13 (mod |c_ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse1 (* v_y_3 4294967296))) (let ((.cse8 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse9 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse10 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse1))) (or (< (+ v_z_3 .cse1) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse8 0) .cse9 v_ArrVal_4967) .cse10 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse2 4) 0) (not (= (select .cse2 0) 0))))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse8 v_ArrVal_4963) .cse9 v_ArrVal_4968) .cse10 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (< v_z_3 0) (< (+ v_z_3 1) .cse13))))) (or (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse14 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse14) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse14) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))) (< (+ v_z_3 1) .cse13))))) (forall ((v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse15 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse15) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse15) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse13)))))) .cse16) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (< (+ v_z_3 1) .cse13) (forall ((v_y_3 Int)) (let ((.cse17 (* v_y_3 4294967296))) (let ((.cse19 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse20 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse21 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse17))) (or (< (+ v_z_3 .cse17) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse18 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse19 0) .cse20 v_ArrVal_4967) .cse21 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse18 4) 0)) (= (select .cse18 0) 0)))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse19 v_ArrVal_4963) .cse20 v_ArrVal_4968) .cse21 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))))))))))) (or (< 0 .cse13) (and (or (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (forall ((v_y_3 Int)) (let ((.cse22 (* v_y_3 4294967296))) (or (< (+ .cse22 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse22) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (forall ((v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse23 (* v_y_3 4294967296))) (or (< (+ .cse23 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse23) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)))))))) .cse16) (or (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_y_3 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (v_ArrVal_4951 Int) (v_ArrVal_4971 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (let ((.cse27 (* v_y_3 4294967296))) (let ((.cse24 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse25 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse26 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse27))) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse24 v_ArrVal_4963) .cse25 v_ArrVal_4968) .cse26 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse24 0) .cse25 v_ArrVal_4967) .cse26 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< (+ .cse27 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|))))) .cse16) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse28 (* v_y_3 4294967296))) (let ((.cse29 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse30 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse31 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse28))) (or (< (+ v_z_3 .cse28) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse29 0) .cse30 v_ArrVal_4967) .cse31 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse32 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse29 v_ArrVal_4963) .cse30 v_ArrVal_4968) .cse31 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse32 4) 0)) (= (select .cse32 0) 0)))))))))))) (or (forall ((v_z_3 Int) (v_ArrVal_4958 Int) (v_y_3 Int) (v_ArrVal_4948 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (v_ArrVal_4951 Int) (v_ArrVal_4971 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (let ((.cse33 (* v_y_3 4294967296))) (let ((.cse34 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse35 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse36 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse33))) (or (< (+ v_z_3 .cse33) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse34 v_ArrVal_4963) .cse35 v_ArrVal_4968) .cse36 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< 4294967295 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse34 0) .cse35 v_ArrVal_4967) .cse36 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (< v_z_3 0))))) .cse16) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse40 (* v_y_3 4294967296))) (let ((.cse37 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse38 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse39 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse40))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse37 0) .cse38 v_ArrVal_4967) .cse39 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (< (+ v_z_3 .cse40) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse41 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse37 v_ArrVal_4963) .cse38 v_ArrVal_4968) .cse39 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse41 0) 0)) (= (select .cse41 4) 0)))))))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse46 (* v_y_3 4294967296))) (let ((.cse43 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse44 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse45 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse46))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse42 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse43 0) .cse44 v_ArrVal_4967) .cse45 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse42 0) 0) (not (= (select .cse42 4) 0))))) (< (+ .cse46 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse43 v_ArrVal_4963) .cse44 v_ArrVal_4968) .cse45 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse51 (* v_y_3 4294967296))) (let ((.cse48 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse49 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse50 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse51))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse47 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse48 0) .cse49 v_ArrVal_4967) .cse50 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse47 4) 0) (not (= (select .cse47 0) 0))))) (< (+ .cse51 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse48 v_ArrVal_4963) .cse49 v_ArrVal_4968) .cse50 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse52 (* v_y_3 4294967296))) (let ((.cse54 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse55 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse56 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse52))) (or (< (+ v_z_3 .cse52) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse53 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse54 0) .cse55 v_ArrVal_4967) .cse56 v_ArrVal_4971)) |c_~#list~0.base|))) (or (not (= (select .cse53 4) 0)) (= (select .cse53 0) 0)))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse54 v_ArrVal_4963) .cse55 v_ArrVal_4968) .cse56 v_ArrVal_4974)) |c_~#list~0.base|) 4) 0))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (or .cse16 (and (forall ((v_ArrVal_4958 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse57 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse57) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) 0) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4967) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse57) v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (forall ((v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (forall ((v_y_3 Int)) (let ((.cse58 (* v_y_3 4294967296))) (or (< (+ v_z_3 .cse58) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) v_ArrVal_4963) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1) v_ArrVal_4968) (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse58) v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))) (< 4294967295 v_z_3) (< v_z_3 0))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse63 (* v_y_3 4294967296))) (let ((.cse60 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse61 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse62 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse63))) (or (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse59 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse60 v_ArrVal_4963) .cse61 v_ArrVal_4968) .cse62 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse59 0) 0) (not (= (select .cse59 4) 0))))) (< (+ .cse63 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse60 0) .cse61 v_ArrVal_4967) .cse62 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))))))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (< 4294967295 v_z_3) (forall ((v_y_3 Int)) (let ((.cse64 (* v_y_3 4294967296))) (let ((.cse66 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse67 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse68 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse64))) (or (< (+ v_z_3 .cse64) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (let ((.cse65 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse66 0) .cse67 v_ArrVal_4967) .cse68 v_ArrVal_4971)) |c_~#list~0.base|))) (or (= (select .cse65 4) 0) (not (= (select .cse65 0) 0))))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse66 v_ArrVal_4963) .cse67 v_ArrVal_4968) .cse68 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0))))))) (< v_z_3 0))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (forall ((v_y_3 Int) (v_ArrVal_4963 Int)) (let ((.cse69 (* v_y_3 4294967296))) (let ((.cse70 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse71 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse72 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 4294967295 .cse69))) (or (< (+ .cse69 4294967293) |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse70 0) .cse71 v_ArrVal_4967) .cse72 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse73 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse70 v_ArrVal_4963) .cse71 v_ArrVal_4968) .cse72 v_ArrVal_4974)) |c_~#list~0.base|))) (or (= (select .cse73 4) 0) (not (= (select .cse73 0) 0))))))))) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0))))) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse74 (* v_y_3 4294967296))) (let ((.cse75 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse76 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse77 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse74))) (or (< (+ v_z_3 .cse74) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse75 0) .cse76 v_ArrVal_4967) .cse77 v_ArrVal_4971)) |c_~#list~0.base|) 4) 0))) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse78 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse75 v_ArrVal_4963) .cse76 v_ArrVal_4968) .cse77 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse78 4) 0)) (= (select .cse78 0) 0)))))))) (< (+ v_z_3 1) .cse13))))) (or (forall ((v_z_3 Int) (v_ArrVal_4958 Int) (v_y_3 Int) (v_ArrVal_4948 Int) (v_ArrVal_4967 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4963 Int) (v_ArrVal_4974 Int) (v_ArrVal_4951 Int) (v_ArrVal_4971 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (let ((.cse79 (* v_y_3 4294967296))) (let ((.cse80 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse81 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse82 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse79))) (or (= 4294967295 v_z_3) (< (+ v_z_3 .cse79) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse80 v_ArrVal_4963) .cse81 v_ArrVal_4968) .cse82 v_ArrVal_4974)) |c_~#list~0.base|) 0) 0)) (< 4294967295 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse80 0) .cse81 v_ArrVal_4967) .cse82 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0)) (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (< v_z_3 0) (< (+ v_z_3 1) .cse13))))) .cse16) (forall ((v_ArrVal_4958 Int) (v_ArrVal_4948 Int) (v_ArrVal_4954 Int) (v_ArrVal_4955 Int) (v_ArrVal_4951 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| Int) (v_ArrVal_4949 Int)) (or (< |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| .cse0) (forall ((v_z_3 Int) (v_ArrVal_4963 Int)) (or (= 4294967295 v_z_3) (< 4294967295 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int)) (let ((.cse86 (* v_y_3 4294967296))) (let ((.cse83 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (.cse84 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40| 1)) (.cse85 (+ |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| v_z_3 .cse86))) (or (forall ((v_ArrVal_4967 Int) (v_ArrVal_4971 Int)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse3 .cse4 v_ArrVal_4949) .cse5 v_ArrVal_4951) .cse6 v_ArrVal_4958) .cse7 0) .cse83 0) .cse84 v_ArrVal_4967) .cse85 v_ArrVal_4971)) |c_~#list~0.base|) 0) 0))) (< (+ v_z_3 .cse86) (+ 2 |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr36#1_40|)) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4974 Int)) (let ((.cse87 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| (store (store (store (store (store (store (store .cse11 .cse4 v_ArrVal_4948) .cse5 v_ArrVal_4954) .cse6 v_ArrVal_4955) .cse7 .cse12) .cse83 v_ArrVal_4963) .cse84 v_ArrVal_4968) .cse85 v_ArrVal_4974)) |c_~#list~0.base|))) (or (not (= (select .cse87 0) 0)) (= (select .cse87 4) 0)))))))) (< (+ v_z_3 1) .cse13))))))) is different from true [2023-11-29 02:47:40,083 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,095 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,100 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,104 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,114 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,119 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,122 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,127 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,130 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,136 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,140 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,149 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,154 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,158 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,166 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:47:40,176 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 02:47:40,206 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 114270708 treesize of output 114205172 [2023-11-29 02:48:56,640 WARN L293 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 1258 DAG size of output: 227 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:48:58,256 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 117662196 treesize of output 117596660