./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:33:16,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:33:16,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:33:16,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:33:16,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:33:16,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:33:16,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:33:16,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:33:16,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:33:16,400 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:33:16,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:33:16,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:33:16,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:33:16,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:33:16,402 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:33:16,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:33:16,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:33:16,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:33:16,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:33:16,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:33:16,402 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:33:16,402 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:33:16,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:33:16,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:33:16,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:33:16,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:33:16,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:33:16,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:33:16,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:33:16,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:33:16,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:33:16,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:33:16,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:33:16,405 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-04 09:33:16,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:33:16,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:33:16,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:33:16,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:33:16,665 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:33:16,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2025-03-04 09:33:17,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dc13808/e0c6cbf2d0d64779bf172535bc5f5006/FLAG5b44bc536 [2025-03-04 09:33:18,105 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:33:18,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2025-03-04 09:33:18,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dc13808/e0c6cbf2d0d64779bf172535bc5f5006/FLAG5b44bc536 [2025-03-04 09:33:18,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dc13808/e0c6cbf2d0d64779bf172535bc5f5006 [2025-03-04 09:33:18,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:33:18,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:33:18,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:33:18,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:33:18,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:33:18,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:18,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286da023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18, skipping insertion in model container [2025-03-04 09:33:18,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:18,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:33:18,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,726 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,729 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,737 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,759 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,760 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,761 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,762 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:33:18,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:33:18,782 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:33:18,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:33:18,918 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:33:18,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18 WrapperNode [2025-03-04 09:33:18,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:33:18,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:33:18,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:33:18,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:33:18,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:18,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,009 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1251 [2025-03-04 09:33:19,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:33:19,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:33:19,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:33:19,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:33:19,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,086 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-04 09:33:19,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:33:19,138 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:33:19,138 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:33:19,138 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:33:19,139 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (1/1) ... [2025-03-04 09:33:19,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:33:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:33:19,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:33:19,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:33:19,185 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:33:19,185 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:33:19,185 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:33:19,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:33:19,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:33:19,369 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:33:20,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 09:33:21,053 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2025-03-04 09:33:21,054 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:33:21,104 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:33:21,104 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 09:33:21,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:33:21 BoogieIcfgContainer [2025-03-04 09:33:21,105 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:33:21,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:33:21,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:33:21,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:33:21,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:33:18" (1/3) ... [2025-03-04 09:33:21,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6595399d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:33:21, skipping insertion in model container [2025-03-04 09:33:21,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:33:18" (2/3) ... [2025-03-04 09:33:21,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6595399d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:33:21, skipping insertion in model container [2025-03-04 09:33:21,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:33:21" (3/3) ... [2025-03-04 09:33:21,112 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2025-03-04 09:33:21,125 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:33:21,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-1.i that has 4 procedures, 1058 locations, 1 initial locations, 31 loop locations, and 420 error locations. [2025-03-04 09:33:21,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:33:21,181 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3868220f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:33:21,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2025-03-04 09:33:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 1048 states, 626 states have (on average 2.015974440894569) internal successors, (1262), 1043 states have internal predecessors, (1262), 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) [2025-03-04 09:33:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:33:21,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:21,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:33:21,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:21,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash 41525260, now seen corresponding path program 1 times [2025-03-04 09:33:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964484300] [2025-03-04 09:33:21,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:21,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:21,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:33:21,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:33:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:21,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:21,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:21,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964484300] [2025-03-04 09:33:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964484300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:21,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:21,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:33:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274472022] [2025-03-04 09:33:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:21,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:21,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:21,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:21,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:21,422 INFO L87 Difference]: Start difference. First operand has 1048 states, 626 states have (on average 2.015974440894569) internal successors, (1262), 1043 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:22,378 INFO L93 Difference]: Finished difference Result 1342 states and 1595 transitions. [2025-03-04 09:33:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:33:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 09:33:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:22,391 INFO L225 Difference]: With dead ends: 1342 [2025-03-04 09:33:22,391 INFO L226 Difference]: Without dead ends: 1338 [2025-03-04 09:33:22,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:22,398 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 380 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:22,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2510 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:33:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-04 09:33:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1253. [2025-03-04 09:33:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 837 states have (on average 1.8888888888888888) internal successors, (1581), 1248 states have internal predecessors, (1581), 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) [2025-03-04 09:33:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1587 transitions. [2025-03-04 09:33:22,485 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1587 transitions. Word has length 4 [2025-03-04 09:33:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:22,485 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1587 transitions. [2025-03-04 09:33:22,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1587 transitions. [2025-03-04 09:33:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:33:22,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:22,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:33:22,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:33:22,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:22,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash 41526588, now seen corresponding path program 1 times [2025-03-04 09:33:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440144617] [2025-03-04 09:33:22,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:22,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:33:22,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:33:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:22,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440144617] [2025-03-04 09:33:22,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440144617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:22,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:22,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:33:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113243337] [2025-03-04 09:33:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:22,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:33:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:22,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:33:22,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:22,572 INFO L87 Difference]: Start difference. First operand 1253 states and 1587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:23,068 INFO L93 Difference]: Finished difference Result 1250 states and 1579 transitions. [2025-03-04 09:33:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:33:23,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 09:33:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:23,073 INFO L225 Difference]: With dead ends: 1250 [2025-03-04 09:33:23,073 INFO L226 Difference]: Without dead ends: 1250 [2025-03-04 09:33:23,074 INFO L434 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 [2025-03-04 09:33:23,074 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1081 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:23,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 815 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:33:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-04 09:33:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-03-04 09:33:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 845 states have (on average 1.8615384615384616) internal successors, (1573), 1245 states have internal predecessors, (1573), 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) [2025-03-04 09:33:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1579 transitions. [2025-03-04 09:33:23,099 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1579 transitions. Word has length 4 [2025-03-04 09:33:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:23,099 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1579 transitions. [2025-03-04 09:33:23,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1579 transitions. [2025-03-04 09:33:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:33:23,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:23,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:33:23,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:33:23,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:23,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash 41526589, now seen corresponding path program 1 times [2025-03-04 09:33:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698448756] [2025-03-04 09:33:23,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:23,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:33:23,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:33:23,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:23,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:23,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:23,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698448756] [2025-03-04 09:33:23,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698448756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:23,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:23,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:33:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044001852] [2025-03-04 09:33:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:23,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:33:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:23,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:33:23,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:23,170 INFO L87 Difference]: Start difference. First operand 1250 states and 1579 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:23,913 INFO L93 Difference]: Finished difference Result 2005 states and 2479 transitions. [2025-03-04 09:33:23,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:33:23,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 09:33:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:23,920 INFO L225 Difference]: With dead ends: 2005 [2025-03-04 09:33:23,920 INFO L226 Difference]: Without dead ends: 2005 [2025-03-04 09:33:23,920 INFO L434 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 [2025-03-04 09:33:23,921 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 899 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:23,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1601 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 09:33:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-03-04 09:33:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1743. [2025-03-04 09:33:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1339 states have (on average 1.8356982823002241) internal successors, (2458), 1736 states have internal predecessors, (2458), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2468 transitions. [2025-03-04 09:33:23,952 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2468 transitions. Word has length 4 [2025-03-04 09:33:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:23,952 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2468 transitions. [2025-03-04 09:33:23,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2468 transitions. [2025-03-04 09:33:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:33:23,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:23,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:23,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:33:23,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -539402885, now seen corresponding path program 1 times [2025-03-04 09:33:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204400043] [2025-03-04 09:33:23,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:23,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:23,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:33:23,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:33:23,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:23,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204400043] [2025-03-04 09:33:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204400043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:33:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235889768] [2025-03-04 09:33:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:33:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:24,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:33:24,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:24,026 INFO L87 Difference]: Start difference. First operand 1743 states and 2468 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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) [2025-03-04 09:33:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:24,609 INFO L93 Difference]: Finished difference Result 1781 states and 2399 transitions. [2025-03-04 09:33:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:33:24,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 [2025-03-04 09:33:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:24,614 INFO L225 Difference]: With dead ends: 1781 [2025-03-04 09:33:24,614 INFO L226 Difference]: Without dead ends: 1781 [2025-03-04 09:33:24,614 INFO L434 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 [2025-03-04 09:33:24,616 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 1066 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:24,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1330 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:33:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-04 09:33:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1696. [2025-03-04 09:33:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1339 states have (on average 1.782673637042569) internal successors, (2387), 1689 states have internal predecessors, (2387), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2397 transitions. [2025-03-04 09:33:24,647 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2397 transitions. Word has length 9 [2025-03-04 09:33:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:24,648 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2397 transitions. [2025-03-04 09:33:24,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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) [2025-03-04 09:33:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2397 transitions. [2025-03-04 09:33:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:33:24,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:24,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:24,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:33:24,649 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:24,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash -539402884, now seen corresponding path program 1 times [2025-03-04 09:33:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:24,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67142400] [2025-03-04 09:33:24,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:24,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:24,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:33:24,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:33:24,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:24,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67142400] [2025-03-04 09:33:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67142400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:24,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:24,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:33:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469180122] [2025-03-04 09:33:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:24,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:33:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:24,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:33:24,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:24,719 INFO L87 Difference]: Start difference. First operand 1696 states and 2397 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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) [2025-03-04 09:33:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:25,273 INFO L93 Difference]: Finished difference Result 1987 states and 2739 transitions. [2025-03-04 09:33:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:33:25,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 [2025-03-04 09:33:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:25,280 INFO L225 Difference]: With dead ends: 1987 [2025-03-04 09:33:25,280 INFO L226 Difference]: Without dead ends: 1987 [2025-03-04 09:33:25,281 INFO L434 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 [2025-03-04 09:33:25,281 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 859 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:25,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1574 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:33:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-04 09:33:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1671. [2025-03-04 09:33:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1339 states have (on average 1.7460791635548918) internal successors, (2338), 1664 states have internal predecessors, (2338), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2348 transitions. [2025-03-04 09:33:25,312 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2348 transitions. Word has length 9 [2025-03-04 09:33:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:25,312 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2348 transitions. [2025-03-04 09:33:25,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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) [2025-03-04 09:33:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2348 transitions. [2025-03-04 09:33:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 09:33:25,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:25,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:25,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:33:25,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:25,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1139546303, now seen corresponding path program 1 times [2025-03-04 09:33:25,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:25,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141408432] [2025-03-04 09:33:25,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:33:25,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:33:25,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141408432] [2025-03-04 09:33:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141408432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:33:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786374823] [2025-03-04 09:33:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:25,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:25,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:25,380 INFO L87 Difference]: Start difference. First operand 1671 states and 2348 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 09:33:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:25,892 INFO L93 Difference]: Finished difference Result 1795 states and 2507 transitions. [2025-03-04 09:33:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:33:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-04 09:33:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:25,898 INFO L225 Difference]: With dead ends: 1795 [2025-03-04 09:33:25,899 INFO L226 Difference]: Without dead ends: 1795 [2025-03-04 09:33:25,899 INFO L434 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 [2025-03-04 09:33:25,899 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 1281 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:25,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1318 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:33:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-03-04 09:33:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1648. [2025-03-04 09:33:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1339 states have (on average 1.6945481702763256) internal successors, (2269), 1641 states have internal predecessors, (2269), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2279 transitions. [2025-03-04 09:33:25,928 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2279 transitions. Word has length 13 [2025-03-04 09:33:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:25,928 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2279 transitions. [2025-03-04 09:33:25,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 09:33:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2279 transitions. [2025-03-04 09:33:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 09:33:25,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:25,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:25,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:33:25,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:25,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1139546304, now seen corresponding path program 1 times [2025-03-04 09:33:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:25,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145557241] [2025-03-04 09:33:25,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:25,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:33:25,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:33:25,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:25,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:26,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145557241] [2025-03-04 09:33:26,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145557241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:26,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:26,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:33:26,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791483104] [2025-03-04 09:33:26,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:26,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:33:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:26,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:33:26,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:26,010 INFO L87 Difference]: Start difference. First operand 1648 states and 2279 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2025-03-04 09:33:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:26,106 INFO L93 Difference]: Finished difference Result 1447 states and 1970 transitions. [2025-03-04 09:33:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:33:26,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-03-04 09:33:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:26,110 INFO L225 Difference]: With dead ends: 1447 [2025-03-04 09:33:26,110 INFO L226 Difference]: Without dead ends: 1447 [2025-03-04 09:33:26,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:26,111 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 60 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:26,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1839 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:33:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-04 09:33:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2025-03-04 09:33:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1150 states have (on average 1.7043478260869565) internal successors, (1960), 1440 states have internal predecessors, (1960), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1970 transitions. [2025-03-04 09:33:26,131 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1970 transitions. Word has length 13 [2025-03-04 09:33:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:26,131 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1970 transitions. [2025-03-04 09:33:26,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2025-03-04 09:33:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1970 transitions. [2025-03-04 09:33:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 09:33:26,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:26,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:26,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:33:26,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:26,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:26,132 INFO L85 PathProgramCache]: Analyzing trace with hash 966072339, now seen corresponding path program 1 times [2025-03-04 09:33:26,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:26,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190896548] [2025-03-04 09:33:26,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:26,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:26,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:33:26,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:33:26,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:26,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:26,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190896548] [2025-03-04 09:33:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190896548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:26,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:33:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368204942] [2025-03-04 09:33:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:26,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:26,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:26,187 INFO L87 Difference]: Start difference. First operand 1447 states and 1970 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 09:33:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:26,281 INFO L93 Difference]: Finished difference Result 1416 states and 1904 transitions. [2025-03-04 09:33:26,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:33:26,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-04 09:33:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:26,286 INFO L225 Difference]: With dead ends: 1416 [2025-03-04 09:33:26,286 INFO L226 Difference]: Without dead ends: 1416 [2025-03-04 09:33:26,286 INFO L434 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 [2025-03-04 09:33:26,287 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 45 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:26,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2701 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:33:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-04 09:33:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2025-03-04 09:33:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1126 states have (on average 1.6820603907637655) internal successors, (1894), 1409 states have internal predecessors, (1894), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1904 transitions. [2025-03-04 09:33:26,310 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1904 transitions. Word has length 14 [2025-03-04 09:33:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:26,310 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1904 transitions. [2025-03-04 09:33:26,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 09:33:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1904 transitions. [2025-03-04 09:33:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:33:26,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:26,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:26,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:33:26,311 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:26,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2127185868, now seen corresponding path program 1 times [2025-03-04 09:33:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389929642] [2025-03-04 09:33:26,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:26,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:33:26,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:33:26,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:26,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:26,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:26,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389929642] [2025-03-04 09:33:26,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389929642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:26,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:26,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:33:26,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469536633] [2025-03-04 09:33:26,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:26,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:26,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:26,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:26,363 INFO L87 Difference]: Start difference. First operand 1416 states and 1904 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:26,857 INFO L93 Difference]: Finished difference Result 1534 states and 2012 transitions. [2025-03-04 09:33:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:33:26,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:33:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:26,865 INFO L225 Difference]: With dead ends: 1534 [2025-03-04 09:33:26,865 INFO L226 Difference]: Without dead ends: 1534 [2025-03-04 09:33:26,865 INFO L434 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 [2025-03-04 09:33:26,867 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 1177 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:26,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1565 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:33:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-03-04 09:33:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1393. [2025-03-04 09:33:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1126 states have (on average 1.641207815275311) internal successors, (1848), 1386 states have internal predecessors, (1848), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1858 transitions. [2025-03-04 09:33:26,895 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1858 transitions. Word has length 18 [2025-03-04 09:33:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:26,896 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1858 transitions. [2025-03-04 09:33:26,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1858 transitions. [2025-03-04 09:33:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:33:26,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:26,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:26,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:33:26,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:26,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2127185869, now seen corresponding path program 1 times [2025-03-04 09:33:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483615307] [2025-03-04 09:33:26,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:26,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:33:26,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:33:26,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:26,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:26,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:26,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483615307] [2025-03-04 09:33:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483615307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:26,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:33:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371795279] [2025-03-04 09:33:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:26,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:33:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:26,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:33:26,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:26,961 INFO L87 Difference]: Start difference. First operand 1393 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:27,004 INFO L93 Difference]: Finished difference Result 1255 states and 1652 transitions. [2025-03-04 09:33:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:33:27,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:33:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:27,009 INFO L225 Difference]: With dead ends: 1255 [2025-03-04 09:33:27,009 INFO L226 Difference]: Without dead ends: 1255 [2025-03-04 09:33:27,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:27,010 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 60 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:27,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1549 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:33:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-04 09:33:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-04 09:33:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1000 states have (on average 1.642) internal successors, (1642), 1248 states have internal predecessors, (1642), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1652 transitions. [2025-03-04 09:33:27,029 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1652 transitions. Word has length 18 [2025-03-04 09:33:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:27,029 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1652 transitions. [2025-03-04 09:33:27,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1652 transitions. [2025-03-04 09:33:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 09:33:27,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:27,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:27,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:33:27,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1518128626, now seen corresponding path program 1 times [2025-03-04 09:33:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141355804] [2025-03-04 09:33:27,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:27,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:33:27,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:33:27,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:27,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:27,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:27,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141355804] [2025-03-04 09:33:27,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141355804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:27,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:27,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:33:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511428062] [2025-03-04 09:33:27,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:27,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:27,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:27,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:27,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:27,074 INFO L87 Difference]: Start difference. First operand 1255 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2025-03-04 09:33:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:27,144 INFO L93 Difference]: Finished difference Result 1226 states and 1602 transitions. [2025-03-04 09:33:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:33:27,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 09:33:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:27,147 INFO L225 Difference]: With dead ends: 1226 [2025-03-04 09:33:27,147 INFO L226 Difference]: Without dead ends: 1226 [2025-03-04 09:33:27,148 INFO L434 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 [2025-03-04 09:33:27,148 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 41 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:27,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2270 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:33:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-04 09:33:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1220. [2025-03-04 09:33:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 972 states have (on average 1.631687242798354) internal successors, (1586), 1213 states have internal predecessors, (1586), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1596 transitions. [2025-03-04 09:33:27,163 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1596 transitions. Word has length 19 [2025-03-04 09:33:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:27,163 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1596 transitions. [2025-03-04 09:33:27,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2025-03-04 09:33:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1596 transitions. [2025-03-04 09:33:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 09:33:27,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:27,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:27,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:33:27,164 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:27,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:27,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2055582743, now seen corresponding path program 1 times [2025-03-04 09:33:27,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:27,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306683331] [2025-03-04 09:33:27,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:27,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:33:27,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:33:27,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:27,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:27,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306683331] [2025-03-04 09:33:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306683331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:27,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:27,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:33:27,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616892411] [2025-03-04 09:33:27,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:27,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:27,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:27,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:27,268 INFO L87 Difference]: Start difference. First operand 1220 states and 1596 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:27,877 INFO L93 Difference]: Finished difference Result 1442 states and 1749 transitions. [2025-03-04 09:33:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:33:27,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 09:33:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:27,880 INFO L225 Difference]: With dead ends: 1442 [2025-03-04 09:33:27,881 INFO L226 Difference]: Without dead ends: 1442 [2025-03-04 09:33:27,881 INFO L434 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 [2025-03-04 09:33:27,881 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 697 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:27,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1547 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:33:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-04 09:33:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1220. [2025-03-04 09:33:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 972 states have (on average 1.623456790123457) internal successors, (1578), 1213 states have internal predecessors, (1578), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1588 transitions. [2025-03-04 09:33:27,894 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1588 transitions. Word has length 28 [2025-03-04 09:33:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:27,894 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1588 transitions. [2025-03-04 09:33:27,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1588 transitions. [2025-03-04 09:33:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 09:33:27,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:27,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:27,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:33:27,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:27,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash 312594952, now seen corresponding path program 1 times [2025-03-04 09:33:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:27,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530571557] [2025-03-04 09:33:27,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:27,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 09:33:27,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 09:33:27,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:27,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:28,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530571557] [2025-03-04 09:33:28,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530571557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:28,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:28,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:33:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62964555] [2025-03-04 09:33:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:28,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:28,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:28,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:28,017 INFO L87 Difference]: Start difference. First operand 1220 states and 1588 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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) [2025-03-04 09:33:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:28,607 INFO L93 Difference]: Finished difference Result 1798 states and 2380 transitions. [2025-03-04 09:33:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:33:28,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2025-03-04 09:33:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:28,612 INFO L225 Difference]: With dead ends: 1798 [2025-03-04 09:33:28,612 INFO L226 Difference]: Without dead ends: 1798 [2025-03-04 09:33:28,612 INFO L434 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 [2025-03-04 09:33:28,614 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 655 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:28,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1809 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:33:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2025-03-04 09:33:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1216. [2025-03-04 09:33:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 972 states have (on average 1.6152263374485596) internal successors, (1570), 1209 states have internal predecessors, (1570), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1580 transitions. [2025-03-04 09:33:28,634 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1580 transitions. Word has length 33 [2025-03-04 09:33:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:28,635 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1580 transitions. [2025-03-04 09:33:28,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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) [2025-03-04 09:33:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1580 transitions. [2025-03-04 09:33:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 09:33:28,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:28,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:28,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:33:28,636 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:28,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1634634434, now seen corresponding path program 1 times [2025-03-04 09:33:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893204171] [2025-03-04 09:33:28,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:28,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:28,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 09:33:28,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 09:33:28,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:28,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:28,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:28,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893204171] [2025-03-04 09:33:28,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893204171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:28,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:33:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962817208] [2025-03-04 09:33:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:28,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:28,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:28,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:28,709 INFO L87 Difference]: Start difference. First operand 1216 states and 1580 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:28,771 INFO L93 Difference]: Finished difference Result 1198 states and 1550 transitions. [2025-03-04 09:33:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:33:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-04 09:33:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:28,774 INFO L225 Difference]: With dead ends: 1198 [2025-03-04 09:33:28,774 INFO L226 Difference]: Without dead ends: 1198 [2025-03-04 09:33:28,774 INFO L434 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 [2025-03-04 09:33:28,774 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 27 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:28,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2246 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:33:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-04 09:33:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-04 09:33:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 954 states have (on average 1.6142557651991614) internal successors, (1540), 1191 states have internal predecessors, (1540), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1550 transitions. [2025-03-04 09:33:28,785 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1550 transitions. Word has length 60 [2025-03-04 09:33:28,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:28,785 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1550 transitions. [2025-03-04 09:33:28,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1550 transitions. [2025-03-04 09:33:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 09:33:28,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:28,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:28,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:33:28,786 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:28,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash 30579484, now seen corresponding path program 1 times [2025-03-04 09:33:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:28,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364876989] [2025-03-04 09:33:28,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 09:33:28,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 09:33:28,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:28,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:28,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364876989] [2025-03-04 09:33:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364876989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:28,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:28,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:33:28,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393700052] [2025-03-04 09:33:28,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:28,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:33:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:28,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:33:28,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:33:28,863 INFO L87 Difference]: Start difference. First operand 1198 states and 1550 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:28,925 INFO L93 Difference]: Finished difference Result 1198 states and 1542 transitions. [2025-03-04 09:33:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:33:28,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-04 09:33:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:28,928 INFO L225 Difference]: With dead ends: 1198 [2025-03-04 09:33:28,928 INFO L226 Difference]: Without dead ends: 1198 [2025-03-04 09:33:28,928 INFO L434 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 [2025-03-04 09:33:28,928 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 21 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:28,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2240 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:33:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-04 09:33:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-04 09:33:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 954 states have (on average 1.6058700209643606) internal successors, (1532), 1191 states have internal predecessors, (1532), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1542 transitions. [2025-03-04 09:33:28,940 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1542 transitions. Word has length 67 [2025-03-04 09:33:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:28,940 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1542 transitions. [2025-03-04 09:33:28,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1542 transitions. [2025-03-04 09:33:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 09:33:28,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:28,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:28,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:33:28,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:28,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:28,941 INFO L85 PathProgramCache]: Analyzing trace with hash -593930742, now seen corresponding path program 1 times [2025-03-04 09:33:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:28,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962898583] [2025-03-04 09:33:28,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:28,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 09:33:28,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 09:33:28,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:28,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:29,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962898583] [2025-03-04 09:33:29,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962898583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:29,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:29,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:33:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669607064] [2025-03-04 09:33:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:29,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:33:29,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:29,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:33:29,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:29,014 INFO L87 Difference]: Start difference. First operand 1198 states and 1542 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:29,094 INFO L93 Difference]: Finished difference Result 1457 states and 1839 transitions. [2025-03-04 09:33:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:33:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-04 09:33:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:29,101 INFO L225 Difference]: With dead ends: 1457 [2025-03-04 09:33:29,101 INFO L226 Difference]: Without dead ends: 1457 [2025-03-04 09:33:29,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:33:29,102 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 199 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:29,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1503 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:33:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-04 09:33:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1444. [2025-03-04 09:33:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1200 states have (on average 1.5208333333333333) internal successors, (1825), 1437 states have internal predecessors, (1825), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1835 transitions. [2025-03-04 09:33:29,120 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1835 transitions. Word has length 68 [2025-03-04 09:33:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:29,120 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1835 transitions. [2025-03-04 09:33:29,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1835 transitions. [2025-03-04 09:33:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 09:33:29,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:29,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:29,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:33:29,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:29,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1205711771, now seen corresponding path program 1 times [2025-03-04 09:33:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:29,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375192674] [2025-03-04 09:33:29,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:29,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:29,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 09:33:29,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 09:33:29,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:29,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:29,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:29,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375192674] [2025-03-04 09:33:29,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375192674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:29,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:29,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:33:29,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123239785] [2025-03-04 09:33:29,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:29,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:33:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:29,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:33:29,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:33:29,431 INFO L87 Difference]: Start difference. First operand 1444 states and 1835 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2025-03-04 09:33:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:29,620 INFO L93 Difference]: Finished difference Result 2061 states and 2565 transitions. [2025-03-04 09:33:29,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:33:29,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 74 [2025-03-04 09:33:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:29,624 INFO L225 Difference]: With dead ends: 2061 [2025-03-04 09:33:29,624 INFO L226 Difference]: Without dead ends: 2058 [2025-03-04 09:33:29,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:33:29,625 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 722 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 4602 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:29,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 4602 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:33:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2025-03-04 09:33:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1347. [2025-03-04 09:33:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1103 states have (on average 1.540344514959202) internal successors, (1699), 1340 states have internal predecessors, (1699), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1709 transitions. [2025-03-04 09:33:29,640 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1709 transitions. Word has length 74 [2025-03-04 09:33:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:29,640 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1709 transitions. [2025-03-04 09:33:29,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2025-03-04 09:33:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1709 transitions. [2025-03-04 09:33:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 09:33:29,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:29,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:29,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:33:29,641 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:29,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash -935803664, now seen corresponding path program 1 times [2025-03-04 09:33:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:29,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708114208] [2025-03-04 09:33:29,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:29,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 09:33:29,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 09:33:29,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:29,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708114208] [2025-03-04 09:33:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708114208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:33:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755814852] [2025-03-04 09:33:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:29,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:33:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:29,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:33:29,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:33:29,822 INFO L87 Difference]: Start difference. First operand 1347 states and 1709 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:30,318 INFO L93 Difference]: Finished difference Result 1346 states and 1707 transitions. [2025-03-04 09:33:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:33:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-04 09:33:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:30,323 INFO L225 Difference]: With dead ends: 1346 [2025-03-04 09:33:30,323 INFO L226 Difference]: Without dead ends: 1346 [2025-03-04 09:33:30,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:33:30,323 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 2 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:30,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2215 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:33:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-04 09:33:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2025-03-04 09:33:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1103 states have (on average 1.5385312783318223) internal successors, (1697), 1339 states have internal predecessors, (1697), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1707 transitions. [2025-03-04 09:33:30,339 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1707 transitions. Word has length 83 [2025-03-04 09:33:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:30,339 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1707 transitions. [2025-03-04 09:33:30,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1707 transitions. [2025-03-04 09:33:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 09:33:30,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:30,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:30,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:33:30,341 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:30,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash -935803663, now seen corresponding path program 1 times [2025-03-04 09:33:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765398492] [2025-03-04 09:33:30,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:30,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 09:33:30,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 09:33:30,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:30,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765398492] [2025-03-04 09:33:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765398492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:33:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937845728] [2025-03-04 09:33:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:30,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:33:30,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:30,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:33:30,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:33:30,659 INFO L87 Difference]: Start difference. First operand 1346 states and 1707 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:31,227 INFO L93 Difference]: Finished difference Result 1345 states and 1705 transitions. [2025-03-04 09:33:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:33:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-04 09:33:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:31,234 INFO L225 Difference]: With dead ends: 1345 [2025-03-04 09:33:31,234 INFO L226 Difference]: Without dead ends: 1345 [2025-03-04 09:33:31,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:33:31,238 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:31,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2141 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:33:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-04 09:33:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2025-03-04 09:33:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1101 states have (on average 1.5395095367847411) internal successors, (1695), 1338 states have internal predecessors, (1695), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1705 transitions. [2025-03-04 09:33:31,273 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1705 transitions. Word has length 83 [2025-03-04 09:33:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:31,273 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1705 transitions. [2025-03-04 09:33:31,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:33:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1705 transitions. [2025-03-04 09:33:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:33:31,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:31,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:31,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:33:31,275 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:31,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 853525101, now seen corresponding path program 1 times [2025-03-04 09:33:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:31,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924757175] [2025-03-04 09:33:31,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:31,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:33:31,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:33:31,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:31,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:31,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924757175] [2025-03-04 09:33:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924757175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:31,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:31,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:33:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117918815] [2025-03-04 09:33:31,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:31,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:33:31,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:31,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:33:31,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:33:31,449 INFO L87 Difference]: Start difference. First operand 1345 states and 1705 transitions. Second operand has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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) [2025-03-04 09:33:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:32,091 INFO L93 Difference]: Finished difference Result 1363 states and 1731 transitions. [2025-03-04 09:33:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:33:32,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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 91 [2025-03-04 09:33:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:32,102 INFO L225 Difference]: With dead ends: 1363 [2025-03-04 09:33:32,102 INFO L226 Difference]: Without dead ends: 1363 [2025-03-04 09:33:32,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:33:32,103 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 6 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:32,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2983 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:33:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-04 09:33:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1354. [2025-03-04 09:33:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1109 states have (on average 1.5383228133453561) internal successors, (1706), 1345 states have internal predecessors, (1706), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 09:33:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1721 transitions. [2025-03-04 09:33:32,128 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1721 transitions. Word has length 91 [2025-03-04 09:33:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:32,128 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1721 transitions. [2025-03-04 09:33:32,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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) [2025-03-04 09:33:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1721 transitions. [2025-03-04 09:33:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:33:32,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:32,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:32,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:33:32,131 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:32,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 853525102, now seen corresponding path program 1 times [2025-03-04 09:33:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109095543] [2025-03-04 09:33:32,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:32,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:33:32,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:33:32,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:32,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109095543] [2025-03-04 09:33:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109095543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:33:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89833099] [2025-03-04 09:33:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:32,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:33:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:32,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:33:32,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:33:32,587 INFO L87 Difference]: Start difference. First operand 1354 states and 1721 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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) [2025-03-04 09:33:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:33,195 INFO L93 Difference]: Finished difference Result 1354 states and 1719 transitions. [2025-03-04 09:33:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:33:33,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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 91 [2025-03-04 09:33:33,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:33,198 INFO L225 Difference]: With dead ends: 1354 [2025-03-04 09:33:33,198 INFO L226 Difference]: Without dead ends: 1354 [2025-03-04 09:33:33,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:33:33,199 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 1 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:33,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2784 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:33:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-04 09:33:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2025-03-04 09:33:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1109 states have (on average 1.5365193868349865) internal successors, (1704), 1345 states have internal predecessors, (1704), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 09:33:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1719 transitions. [2025-03-04 09:33:33,214 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1719 transitions. Word has length 91 [2025-03-04 09:33:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:33,214 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1719 transitions. [2025-03-04 09:33:33,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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) [2025-03-04 09:33:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1719 transitions. [2025-03-04 09:33:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 09:33:33,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:33,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:33,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:33:33,215 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:33,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1492265685, now seen corresponding path program 1 times [2025-03-04 09:33:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:33,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695422046] [2025-03-04 09:33:33,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:33,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:33,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:33:33,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:33:33,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:33,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:33,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:33,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695422046] [2025-03-04 09:33:33,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695422046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:33,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157400871] [2025-03-04 09:33:33,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:33,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:33,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:33:33,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:33:33,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:33:33,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:33:33,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:33:33,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:33,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:33,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 09:33:33,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:33:33,846 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:33:33,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:33:33,883 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 [2025-03-04 09:33:33,953 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 22 treesize of output 10 [2025-03-04 09:33:34,119 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:34,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:33:34,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:33:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:34,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:33:34,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157400871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:34,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:33:34,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-03-04 09:33:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49689963] [2025-03-04 09:33:34,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:33:34,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:33:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:34,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:33:34,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=316, Unknown=8, NotChecked=0, Total=380 [2025-03-04 09:33:34,228 INFO L87 Difference]: Start difference. First operand 1354 states and 1719 transitions. Second operand has 19 states, 16 states have (on average 7.3125) internal successors, (117), 18 states have internal predecessors, (117), 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) [2025-03-04 09:33:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:35,897 INFO L93 Difference]: Finished difference Result 1361 states and 1725 transitions. [2025-03-04 09:33:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:33:35,900 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.3125) internal successors, (117), 18 states have internal predecessors, (117), 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 92 [2025-03-04 09:33:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:35,902 INFO L225 Difference]: With dead ends: 1361 [2025-03-04 09:33:35,902 INFO L226 Difference]: Without dead ends: 1361 [2025-03-04 09:33:35,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=460, Unknown=9, NotChecked=0, Total=552 [2025-03-04 09:33:35,905 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 714 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 3648 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 5045 SdHoareTripleChecker+Invalid, 3664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:35,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 5045 Invalid, 3664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3648 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 09:33:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-04 09:33:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1358. [2025-03-04 09:33:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1113 states have (on average 1.5336927223719676) internal successors, (1707), 1348 states have internal predecessors, (1707), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:33:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1719 transitions. [2025-03-04 09:33:35,920 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1719 transitions. Word has length 92 [2025-03-04 09:33:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:35,920 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1719 transitions. [2025-03-04 09:33:35,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.3125) internal successors, (117), 18 states have internal predecessors, (117), 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) [2025-03-04 09:33:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1719 transitions. [2025-03-04 09:33:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 09:33:35,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:35,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:35,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:33:36,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 09:33:36,124 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:36,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1492265684, now seen corresponding path program 1 times [2025-03-04 09:33:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633631911] [2025-03-04 09:33:36,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:36,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:33:36,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:33:36,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:36,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633631911] [2025-03-04 09:33:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633631911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192707334] [2025-03-04 09:33:36,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:36,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:36,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:33:36,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:33:36,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:33:36,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:33:36,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:33:36,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:36,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:36,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 09:33:36,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:33:36,940 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:33:36,941 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 [2025-03-04 09:33:36,946 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 [2025-03-04 09:33:36,969 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 [2025-03-04 09:33:36,972 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 13 treesize of output 9 [2025-03-04 09:33:37,041 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 22 treesize of output 10 [2025-03-04 09:33:37,044 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 9 treesize of output 3 [2025-03-04 09:33:37,141 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:37,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:33:37,145 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 30 treesize of output 13 [2025-03-04 09:33:37,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:33:37,182 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 9 treesize of output 3 [2025-03-04 09:33:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:37,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:33:37,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_774 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:33:37,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192707334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:37,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:33:37,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-03-04 09:33:37,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546930996] [2025-03-04 09:33:37,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:33:37,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:33:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:37,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:33:37,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-03-04 09:33:37,285 INFO L87 Difference]: Start difference. First operand 1358 states and 1719 transitions. Second operand has 18 states, 15 states have (on average 7.8) internal successors, (117), 18 states have internal predecessors, (117), 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) [2025-03-04 09:33:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:39,678 INFO L93 Difference]: Finished difference Result 1360 states and 1723 transitions. [2025-03-04 09:33:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:33:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.8) internal successors, (117), 18 states have internal predecessors, (117), 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 92 [2025-03-04 09:33:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:39,681 INFO L225 Difference]: With dead ends: 1360 [2025-03-04 09:33:39,681 INFO L226 Difference]: Without dead ends: 1360 [2025-03-04 09:33:39,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-03-04 09:33:39,682 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 726 mSDsluCounter, 4600 mSDsCounter, 0 mSdLazyCounter, 5139 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 5157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:39,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 5075 Invalid, 5157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5139 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 09:33:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-03-04 09:33:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2025-03-04 09:33:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1105 states have (on average 1.5348416289592761) internal successors, (1696), 1340 states have internal predecessors, (1696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1706 transitions. [2025-03-04 09:33:39,694 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1706 transitions. Word has length 92 [2025-03-04 09:33:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:39,694 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1706 transitions. [2025-03-04 09:33:39,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.8) internal successors, (117), 18 states have internal predecessors, (117), 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) [2025-03-04 09:33:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1706 transitions. [2025-03-04 09:33:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:33:39,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:39,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:39,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:33:39,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 09:33:39,896 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:39,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1160753396, now seen corresponding path program 1 times [2025-03-04 09:33:39,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:39,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224852702] [2025-03-04 09:33:39,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:39,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:39,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:33:39,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:33:39,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:40,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:40,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224852702] [2025-03-04 09:33:40,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224852702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:40,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:40,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 09:33:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697450185] [2025-03-04 09:33:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:40,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:33:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:40,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:33:40,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:33:40,296 INFO L87 Difference]: Start difference. First operand 1348 states and 1706 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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) [2025-03-04 09:33:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:41,398 INFO L93 Difference]: Finished difference Result 1367 states and 1731 transitions. [2025-03-04 09:33:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:33:41,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2025-03-04 09:33:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:41,400 INFO L225 Difference]: With dead ends: 1367 [2025-03-04 09:33:41,400 INFO L226 Difference]: Without dead ends: 1367 [2025-03-04 09:33:41,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-04 09:33:41,401 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 731 mSDsluCounter, 3683 mSDsCounter, 0 mSdLazyCounter, 2995 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:41,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4155 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2995 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:33:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-03-04 09:33:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1363. [2025-03-04 09:33:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5308310991957104) internal successors, (1713), 1353 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:33:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1725 transitions. [2025-03-04 09:33:41,411 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1725 transitions. Word has length 94 [2025-03-04 09:33:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:41,411 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1725 transitions. [2025-03-04 09:33:41,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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) [2025-03-04 09:33:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1725 transitions. [2025-03-04 09:33:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:33:41,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:41,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:41,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 09:33:41,414 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:41,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1160753397, now seen corresponding path program 1 times [2025-03-04 09:33:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:41,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098501011] [2025-03-04 09:33:41,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:41,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:33:41,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:33:41,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:41,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:41,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:41,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098501011] [2025-03-04 09:33:41,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098501011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:41,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:41,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:33:41,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731116179] [2025-03-04 09:33:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:41,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:33:41,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:41,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:33:41,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:33:41,837 INFO L87 Difference]: Start difference. First operand 1363 states and 1725 transitions. Second operand has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 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) [2025-03-04 09:33:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:43,106 INFO L93 Difference]: Finished difference Result 1366 states and 1729 transitions. [2025-03-04 09:33:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:33:43,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 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 94 [2025-03-04 09:33:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:43,112 INFO L225 Difference]: With dead ends: 1366 [2025-03-04 09:33:43,112 INFO L226 Difference]: Without dead ends: 1366 [2025-03-04 09:33:43,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:33:43,112 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 708 mSDsluCounter, 2661 mSDsCounter, 0 mSdLazyCounter, 3202 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:43,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 3137 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3202 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:33:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-04 09:33:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1363. [2025-03-04 09:33:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5290437890974085) internal successors, (1711), 1353 states have internal predecessors, (1711), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:33:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1723 transitions. [2025-03-04 09:33:43,123 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1723 transitions. Word has length 94 [2025-03-04 09:33:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:43,123 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1723 transitions. [2025-03-04 09:33:43,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 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) [2025-03-04 09:33:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1723 transitions. [2025-03-04 09:33:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 09:33:43,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:43,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:43,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 09:33:43,124 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1120320886, now seen corresponding path program 1 times [2025-03-04 09:33:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636192915] [2025-03-04 09:33:43,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:43,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:33:43,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:33:43,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:43,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:43,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636192915] [2025-03-04 09:33:43,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636192915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744799266] [2025-03-04 09:33:43,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:43,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:33:43,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:33:43,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:33:43,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:33:43,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:33:43,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:43,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:43,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:33:43,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:33:43,665 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 [2025-03-04 09:33:43,761 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:33:43,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:33:43,782 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 [2025-03-04 09:33:43,851 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 22 treesize of output 10 [2025-03-04 09:33:43,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:43,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:33:44,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:44,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:33:44,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:33:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:44,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:33:44,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1055 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1055) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:33:44,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1058))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1055)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:33:44,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744799266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:44,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:33:44,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-04 09:33:44,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283087783] [2025-03-04 09:33:44,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:33:44,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:33:44,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:44,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:33:44,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=9, NotChecked=86, Total=600 [2025-03-04 09:33:44,109 INFO L87 Difference]: Start difference. First operand 1363 states and 1723 transitions. Second operand has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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) [2025-03-04 09:33:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:45,695 INFO L93 Difference]: Finished difference Result 1365 states and 1727 transitions. [2025-03-04 09:33:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:33:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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 95 [2025-03-04 09:33:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:45,697 INFO L225 Difference]: With dead ends: 1365 [2025-03-04 09:33:45,698 INFO L226 Difference]: Without dead ends: 1365 [2025-03-04 09:33:45,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=546, Unknown=10, NotChecked=98, Total=756 [2025-03-04 09:33:45,698 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 698 mSDsluCounter, 5019 mSDsCounter, 0 mSdLazyCounter, 3915 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 5490 SdHoareTripleChecker+Invalid, 3930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:45,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 5490 Invalid, 3930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3915 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:33:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-04 09:33:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1362. [2025-03-04 09:33:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1119 states have (on average 1.5272564789991063) internal successors, (1709), 1352 states have internal predecessors, (1709), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:33:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1721 transitions. [2025-03-04 09:33:45,709 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1721 transitions. Word has length 95 [2025-03-04 09:33:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:45,709 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1721 transitions. [2025-03-04 09:33:45,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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) [2025-03-04 09:33:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1721 transitions. [2025-03-04 09:33:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 09:33:45,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:45,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:45,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:33:45,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:45,914 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:45,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1120320887, now seen corresponding path program 1 times [2025-03-04 09:33:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:45,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159346001] [2025-03-04 09:33:45,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:45,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:33:45,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:33:45,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:45,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159346001] [2025-03-04 09:33:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159346001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973137568] [2025-03-04 09:33:46,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:33:46,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:33:46,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:33:46,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:33:46,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:33:46,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:46,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:46,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 09:33:46,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:33:46,597 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 [2025-03-04 09:33:46,681 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 [2025-03-04 09:33:46,689 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:33:46,689 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 [2025-03-04 09:33:46,713 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 [2025-03-04 09:33:46,718 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 13 treesize of output 9 [2025-03-04 09:33:46,786 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 22 treesize of output 10 [2025-03-04 09:33:46,790 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 9 treesize of output 3 [2025-03-04 09:33:46,872 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:46,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:33:46,876 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 30 treesize of output 13 [2025-03-04 09:33:46,936 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:46,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:33:46,943 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 30 treesize of output 13 [2025-03-04 09:33:46,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:33:46,958 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 9 treesize of output 3 [2025-03-04 09:33:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:46,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:33:47,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1209 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1209 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-03-04 09:33:47,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1209 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1209 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:33:47,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1209 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1216) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1209 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1215))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1216) .cse1 v_ArrVal_1209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-04 09:33:47,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973137568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:47,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:33:47,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-04 09:33:47,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809325879] [2025-03-04 09:33:47,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:33:47,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 09:33:47,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:47,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 09:33:47,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2025-03-04 09:33:47,071 INFO L87 Difference]: Start difference. First operand 1362 states and 1721 transitions. Second operand has 20 states, 17 states have (on average 8.823529411764707) internal successors, (150), 20 states have internal predecessors, (150), 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) [2025-03-04 09:33:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:48,633 INFO L93 Difference]: Finished difference Result 1364 states and 1725 transitions. [2025-03-04 09:33:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:33:48,634 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.823529411764707) internal successors, (150), 20 states have internal predecessors, (150), 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 95 [2025-03-04 09:33:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:48,636 INFO L225 Difference]: With dead ends: 1364 [2025-03-04 09:33:48,636 INFO L226 Difference]: Without dead ends: 1364 [2025-03-04 09:33:48,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2025-03-04 09:33:48,636 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 697 mSDsluCounter, 3566 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 4040 SdHoareTripleChecker+Invalid, 3872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:48,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 4040 Invalid, 3872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3855 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:33:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-04 09:33:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1346. [2025-03-04 09:33:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1105 states have (on average 1.5312217194570135) internal successors, (1692), 1338 states have internal predecessors, (1692), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:48,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1702 transitions. [2025-03-04 09:33:48,646 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1702 transitions. Word has length 95 [2025-03-04 09:33:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:48,646 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1702 transitions. [2025-03-04 09:33:48,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.823529411764707) internal successors, (150), 20 states have internal predecessors, (150), 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) [2025-03-04 09:33:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1702 transitions. [2025-03-04 09:33:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:33:48,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:48,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:48,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:33:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 09:33:48,851 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:48,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1223575014, now seen corresponding path program 1 times [2025-03-04 09:33:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677432889] [2025-03-04 09:33:48,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:48,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:33:48,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:33:48,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:48,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677432889] [2025-03-04 09:33:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677432889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:49,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:49,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:33:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91241364] [2025-03-04 09:33:49,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:49,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:33:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:49,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:33:49,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:33:49,143 INFO L87 Difference]: Start difference. First operand 1346 states and 1702 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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) [2025-03-04 09:33:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:50,077 INFO L93 Difference]: Finished difference Result 1371 states and 1733 transitions. [2025-03-04 09:33:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:33:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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 97 [2025-03-04 09:33:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:50,080 INFO L225 Difference]: With dead ends: 1371 [2025-03-04 09:33:50,080 INFO L226 Difference]: Without dead ends: 1371 [2025-03-04 09:33:50,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:33:50,080 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 712 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 2322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:50,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 3243 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2322 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:33:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-03-04 09:33:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1367. [2025-03-04 09:33:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1125 states have (on average 1.5244444444444445) internal successors, (1715), 1357 states have internal predecessors, (1715), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:33:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1727 transitions. [2025-03-04 09:33:50,089 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1727 transitions. Word has length 97 [2025-03-04 09:33:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:50,090 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1727 transitions. [2025-03-04 09:33:50,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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) [2025-03-04 09:33:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1727 transitions. [2025-03-04 09:33:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:33:50,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:50,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:50,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 09:33:50,091 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:50,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1223575015, now seen corresponding path program 1 times [2025-03-04 09:33:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:50,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352363016] [2025-03-04 09:33:50,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:50,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:50,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:33:50,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:33:50,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:50,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352363016] [2025-03-04 09:33:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352363016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:50,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:33:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031527177] [2025-03-04 09:33:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:50,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:33:50,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:50,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:33:50,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:33:50,548 INFO L87 Difference]: Start difference. First operand 1367 states and 1727 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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) [2025-03-04 09:33:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:51,702 INFO L93 Difference]: Finished difference Result 1370 states and 1731 transitions. [2025-03-04 09:33:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:33:51,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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 97 [2025-03-04 09:33:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:51,705 INFO L225 Difference]: With dead ends: 1370 [2025-03-04 09:33:51,705 INFO L226 Difference]: Without dead ends: 1370 [2025-03-04 09:33:51,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:33:51,705 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 710 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:51,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 2879 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 09:33:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-04 09:33:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1367. [2025-03-04 09:33:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1125 states have (on average 1.5226666666666666) internal successors, (1713), 1357 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:33:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1725 transitions. [2025-03-04 09:33:51,717 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1725 transitions. Word has length 97 [2025-03-04 09:33:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:51,718 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1725 transitions. [2025-03-04 09:33:51,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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) [2025-03-04 09:33:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1725 transitions. [2025-03-04 09:33:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 09:33:51,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:51,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:51,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 09:33:51,718 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:51,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash -710487516, now seen corresponding path program 1 times [2025-03-04 09:33:51,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:51,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589718389] [2025-03-04 09:33:51,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:51,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:33:51,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:33:51,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:51,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589718389] [2025-03-04 09:33:52,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589718389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305466882] [2025-03-04 09:33:52,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:52,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:52,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:33:52,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:33:52,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:33:52,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:33:52,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:33:52,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:52,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:52,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:33:52,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:33:52,445 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 [2025-03-04 09:33:52,551 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:33:52,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:33:52,572 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 [2025-03-04 09:33:52,628 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 22 treesize of output 10 [2025-03-04 09:33:52,734 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:52,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:33:52,800 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:52,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:33:52,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:52,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:33:52,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:33:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:52,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:33:52,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1522 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:33:52,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1521))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1522)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:33:52,933 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1521))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1522)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:33:52,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305466882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:52,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:33:52,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-04 09:33:52,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892603741] [2025-03-04 09:33:52,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:33:52,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:33:52,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:52,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:33:52,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=536, Unknown=26, NotChecked=150, Total=812 [2025-03-04 09:33:52,987 INFO L87 Difference]: Start difference. First operand 1367 states and 1725 transitions. Second operand has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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) [2025-03-04 09:33:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:55,025 INFO L93 Difference]: Finished difference Result 1369 states and 1729 transitions. [2025-03-04 09:33:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:33:55,026 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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 98 [2025-03-04 09:33:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:55,027 INFO L225 Difference]: With dead ends: 1369 [2025-03-04 09:33:55,027 INFO L226 Difference]: Without dead ends: 1369 [2025-03-04 09:33:55,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=675, Unknown=27, NotChecked=168, Total=992 [2025-03-04 09:33:55,028 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 681 mSDsluCounter, 7296 mSDsCounter, 0 mSdLazyCounter, 5592 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 7766 SdHoareTripleChecker+Invalid, 5606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:55,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 7766 Invalid, 5606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5592 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:33:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-03-04 09:33:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1366. [2025-03-04 09:33:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1125 states have (on average 1.520888888888889) internal successors, (1711), 1356 states have internal predecessors, (1711), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:33:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1723 transitions. [2025-03-04 09:33:55,043 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1723 transitions. Word has length 98 [2025-03-04 09:33:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:55,043 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1723 transitions. [2025-03-04 09:33:55,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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) [2025-03-04 09:33:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1723 transitions. [2025-03-04 09:33:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 09:33:55,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:55,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:55,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:33:55,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:55,248 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:55,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash -710487515, now seen corresponding path program 1 times [2025-03-04 09:33:55,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:55,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128457864] [2025-03-04 09:33:55,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:55,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:55,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:33:55,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:33:55,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:55,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:56,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128457864] [2025-03-04 09:33:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128457864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441910701] [2025-03-04 09:33:56,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:56,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:33:56,023 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:33:56,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:33:56,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:33:56,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:33:56,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:56,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:56,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 09:33:56,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:33:56,235 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 [2025-03-04 09:33:56,313 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 [2025-03-04 09:33:56,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:33:56,321 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 [2025-03-04 09:33:56,345 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 [2025-03-04 09:33:56,350 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 [2025-03-04 09:33:56,414 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 22 treesize of output 10 [2025-03-04 09:33:56,417 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 9 treesize of output 3 [2025-03-04 09:33:56,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:56,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:33:56,498 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 30 treesize of output 13 [2025-03-04 09:33:56,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:56,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:33:56,560 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 30 treesize of output 13 [2025-03-04 09:33:56,612 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:33:56,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:33:56,617 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 41 treesize of output 22 [2025-03-04 09:33:56,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:33:56,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-04 09:33:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:56,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:33:56,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1688))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1689))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1688))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (<= 0 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))) is different from false [2025-03-04 09:33:56,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1688))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1689))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1688 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1688))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))))))) is different from false [2025-03-04 09:33:56,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1697))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1696) .cse5 v_ArrVal_1688))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1689))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse0 .cse2 v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1697))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1696) .cse8 v_ArrVal_1688))) (or (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (< (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0)))))))) is different from false [2025-03-04 09:33:56,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441910701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:33:56,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:33:56,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2025-03-04 09:33:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355497368] [2025-03-04 09:33:56,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:33:56,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 09:33:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:56,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 09:33:56,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=611, Unknown=3, NotChecked=156, Total=870 [2025-03-04 09:33:56,975 INFO L87 Difference]: Start difference. First operand 1366 states and 1723 transitions. Second operand has 23 states, 20 states have (on average 7.8) internal successors, (156), 23 states have internal predecessors, (156), 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) [2025-03-04 09:33:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:33:59,178 INFO L93 Difference]: Finished difference Result 1368 states and 1727 transitions. [2025-03-04 09:33:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:33:59,179 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.8) internal successors, (156), 23 states have internal predecessors, (156), 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 98 [2025-03-04 09:33:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:33:59,181 INFO L225 Difference]: With dead ends: 1368 [2025-03-04 09:33:59,181 INFO L226 Difference]: Without dead ends: 1368 [2025-03-04 09:33:59,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=901, Unknown=3, NotChecked=192, Total=1260 [2025-03-04 09:33:59,182 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 696 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 4942 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 4961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:33:59,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 4528 Invalid, 4961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4942 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 09:33:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-03-04 09:33:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1344. [2025-03-04 09:33:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1105 states have (on average 1.527601809954751) internal successors, (1688), 1336 states have internal predecessors, (1688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:33:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1698 transitions. [2025-03-04 09:33:59,194 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1698 transitions. Word has length 98 [2025-03-04 09:33:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:33:59,195 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1698 transitions. [2025-03-04 09:33:59,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.8) internal successors, (156), 23 states have internal predecessors, (156), 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) [2025-03-04 09:33:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1698 transitions. [2025-03-04 09:33:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:33:59,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:33:59,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:33:59,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:33:59,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:33:59,396 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:33:59,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:33:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash 136648846, now seen corresponding path program 1 times [2025-03-04 09:33:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:33:59,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441041723] [2025-03-04 09:33:59,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:33:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:33:59,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:33:59,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:33:59,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:33:59,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:33:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:33:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:33:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441041723] [2025-03-04 09:33:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441041723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:33:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:33:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:33:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200241411] [2025-03-04 09:33:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:33:59,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:33:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:33:59,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:33:59,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:33:59,984 INFO L87 Difference]: Start difference. First operand 1344 states and 1698 transitions. Second operand has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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) [2025-03-04 09:34:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:34:01,578 INFO L93 Difference]: Finished difference Result 1375 states and 1735 transitions. [2025-03-04 09:34:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:34:01,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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 100 [2025-03-04 09:34:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:34:01,581 INFO L225 Difference]: With dead ends: 1375 [2025-03-04 09:34:01,581 INFO L226 Difference]: Without dead ends: 1375 [2025-03-04 09:34:01,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:34:01,581 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 712 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:34:01,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 3574 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3527 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:34:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-04 09:34:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1371. [2025-03-04 09:34:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1131 states have (on average 1.5181255526083113) internal successors, (1717), 1361 states have internal predecessors, (1717), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:34:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1729 transitions. [2025-03-04 09:34:01,601 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1729 transitions. Word has length 100 [2025-03-04 09:34:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:34:01,601 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1729 transitions. [2025-03-04 09:34:01,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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) [2025-03-04 09:34:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1729 transitions. [2025-03-04 09:34:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:34:01,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:34:01,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:34:01,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 09:34:01,602 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:34:01,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:34:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 136648845, now seen corresponding path program 1 times [2025-03-04 09:34:01,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:34:01,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700030067] [2025-03-04 09:34:01,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:34:01,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:34:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:34:01,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:01,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:34:02,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700030067] [2025-03-04 09:34:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700030067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:34:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:34:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 09:34:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241104365] [2025-03-04 09:34:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:34:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 09:34:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:34:02,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 09:34:02,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:34:02,125 INFO L87 Difference]: Start difference. First operand 1371 states and 1729 transitions. Second operand has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 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) [2025-03-04 09:34:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:34:03,507 INFO L93 Difference]: Finished difference Result 1374 states and 1733 transitions. [2025-03-04 09:34:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:34:03,507 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 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 100 [2025-03-04 09:34:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:34:03,510 INFO L225 Difference]: With dead ends: 1374 [2025-03-04 09:34:03,511 INFO L226 Difference]: Without dead ends: 1374 [2025-03-04 09:34:03,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:34:03,511 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 727 mSDsluCounter, 4570 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:34:03,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 5041 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3599 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:34:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-04 09:34:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1371. [2025-03-04 09:34:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1131 states have (on average 1.5163572060123784) internal successors, (1715), 1361 states have internal predecessors, (1715), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:34:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1727 transitions. [2025-03-04 09:34:03,522 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1727 transitions. Word has length 100 [2025-03-04 09:34:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:34:03,522 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1727 transitions. [2025-03-04 09:34:03,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 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) [2025-03-04 09:34:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1727 transitions. [2025-03-04 09:34:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:34:03,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:34:03,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:34:03,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 09:34:03,523 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:34:03,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:34:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash -533906544, now seen corresponding path program 1 times [2025-03-04 09:34:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:34:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211053598] [2025-03-04 09:34:03,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:34:03,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:34:03,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:34:03,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:03,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:04,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:34:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211053598] [2025-03-04 09:34:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211053598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:34:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245667854] [2025-03-04 09:34:04,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:04,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:34:04,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:34:04,190 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:34:04,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:34:04,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:34:04,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:34:04,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:04,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:04,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 09:34:04,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:34:04,397 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 [2025-03-04 09:34:04,475 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:34:04,476 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 [2025-03-04 09:34:04,479 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 [2025-03-04 09:34:04,499 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 13 treesize of output 9 [2025-03-04 09:34:04,508 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 [2025-03-04 09:34:04,585 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 22 treesize of output 10 [2025-03-04 09:34:04,589 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 9 treesize of output 3 [2025-03-04 09:34:04,681 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:04,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:34:04,685 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 30 treesize of output 13 [2025-03-04 09:34:04,748 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:04,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:34:04,754 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 30 treesize of output 13 [2025-03-04 09:34:04,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:04,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:34:04,808 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 30 treesize of output 13 [2025-03-04 09:34:04,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:04,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:34:04,856 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 30 treesize of output 13 [2025-03-04 09:34:04,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:34:04,872 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 9 treesize of output 3 [2025-03-04 09:34:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:04,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:34:04,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2032 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2032) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2032) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:34:04,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2030))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2031) .cse0 v_ArrVal_2032) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2031) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2032) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-03-04 09:34:05,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2029))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2030))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2028) .cse0 v_ArrVal_2031) .cse1 v_ArrVal_2032) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2029))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2028) .cse5 v_ArrVal_2031) (select (select (store .cse6 .cse5 v_ArrVal_2030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2032))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-03-04 09:34:05,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2038))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2029))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2030))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2039) .cse0 v_ArrVal_2028) .cse1 v_ArrVal_2031) .cse2 v_ArrVal_2032) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2038))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2029))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2039) .cse7 v_ArrVal_2028) .cse8 v_ArrVal_2031) (select (select (store .cse9 .cse8 v_ArrVal_2030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2032))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-03-04 09:34:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245667854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:34:05,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:34:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-04 09:34:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897075091] [2025-03-04 09:34:05,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:34:05,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:34:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:34:05,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:34:05,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=675, Unknown=32, NotChecked=228, Total=1056 [2025-03-04 09:34:05,699 INFO L87 Difference]: Start difference. First operand 1371 states and 1727 transitions. Second operand has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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) [2025-03-04 09:34:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:34:08,729 INFO L93 Difference]: Finished difference Result 1373 states and 1731 transitions. [2025-03-04 09:34:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:34:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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 101 [2025-03-04 09:34:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:34:08,732 INFO L225 Difference]: With dead ends: 1373 [2025-03-04 09:34:08,732 INFO L226 Difference]: Without dead ends: 1373 [2025-03-04 09:34:08,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=1045, Unknown=34, NotChecked=284, Total=1560 [2025-03-04 09:34:08,733 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 695 mSDsluCounter, 5651 mSDsCounter, 0 mSdLazyCounter, 6458 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 6123 SdHoareTripleChecker+Invalid, 6474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:34:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 6123 Invalid, 6474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 6458 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 09:34:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-03-04 09:34:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1370. [2025-03-04 09:34:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1131 states have (on average 1.5145888594164456) internal successors, (1713), 1360 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:34:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1725 transitions. [2025-03-04 09:34:08,756 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1725 transitions. Word has length 101 [2025-03-04 09:34:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:34:08,756 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1725 transitions. [2025-03-04 09:34:08,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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) [2025-03-04 09:34:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1725 transitions. [2025-03-04 09:34:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:34:08,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:34:08,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:34:08,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:34:08,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:34:08,959 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:34:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:34:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -533906545, now seen corresponding path program 1 times [2025-03-04 09:34:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:34:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056959622] [2025-03-04 09:34:08,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:34:08,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:34:08,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:34:08,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:08,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:09,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:34:09,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056959622] [2025-03-04 09:34:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056959622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:34:09,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317350030] [2025-03-04 09:34:09,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:09,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:34:09,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:34:09,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:34:09,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:34:09,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:34:09,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:34:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:09,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 09:34:09,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:34:09,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:34:09,668 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:34:09,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:34:09,689 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 [2025-03-04 09:34:09,750 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 22 treesize of output 10 [2025-03-04 09:34:09,852 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:09,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34:09,915 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:09,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34:09,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:09,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34:10,030 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:10,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34:10,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:34:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:10,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:34:10,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2214 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:34:10,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2213))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:34:10,160 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2212))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2213)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:34:10,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2217))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2212)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2213)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:34:10,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317350030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:34:10,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:34:10,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-03-04 09:34:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615925489] [2025-03-04 09:34:10,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:34:10,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 09:34:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:34:10,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 09:34:10,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=16, NotChecked=228, Total=1056 [2025-03-04 09:34:10,216 INFO L87 Difference]: Start difference. First operand 1370 states and 1725 transitions. Second operand has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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) [2025-03-04 09:34:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:34:12,140 INFO L93 Difference]: Finished difference Result 1372 states and 1729 transitions. [2025-03-04 09:34:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:34:12,141 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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 101 [2025-03-04 09:34:12,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:34:12,143 INFO L225 Difference]: With dead ends: 1372 [2025-03-04 09:34:12,143 INFO L226 Difference]: Without dead ends: 1372 [2025-03-04 09:34:12,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=16, NotChecked=252, Total=1260 [2025-03-04 09:34:12,144 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 676 mSDsluCounter, 5478 mSDsCounter, 0 mSdLazyCounter, 4259 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 5947 SdHoareTripleChecker+Invalid, 4274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:34:12,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 5947 Invalid, 4274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4259 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:34:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-03-04 09:34:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1342. [2025-03-04 09:34:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1105 states have (on average 1.5239819004524886) internal successors, (1684), 1334 states have internal predecessors, (1684), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:34:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1694 transitions. [2025-03-04 09:34:12,157 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1694 transitions. Word has length 101 [2025-03-04 09:34:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:34:12,157 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1694 transitions. [2025-03-04 09:34:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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) [2025-03-04 09:34:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1694 transitions. [2025-03-04 09:34:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:34:12,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:34:12,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:34:12,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:34:12,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 09:34:12,359 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:34:12,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:34:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -920004089, now seen corresponding path program 1 times [2025-03-04 09:34:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:34:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844249437] [2025-03-04 09:34:12,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:34:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:34:12,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:34:12,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:12,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:34:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844249437] [2025-03-04 09:34:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844249437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:34:12,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:34:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 09:34:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227180255] [2025-03-04 09:34:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:34:12,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:34:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:34:12,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:34:12,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:34:12,874 INFO L87 Difference]: Start difference. First operand 1342 states and 1694 transitions. Second operand has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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) [2025-03-04 09:34:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:34:14,223 INFO L93 Difference]: Finished difference Result 1381 states and 1739 transitions. [2025-03-04 09:34:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:34:14,224 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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 104 [2025-03-04 09:34:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:34:14,226 INFO L225 Difference]: With dead ends: 1381 [2025-03-04 09:34:14,226 INFO L226 Difference]: Without dead ends: 1381 [2025-03-04 09:34:14,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-04 09:34:14,227 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 732 mSDsluCounter, 4128 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:34:14,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 4597 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:34:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-04 09:34:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1377. [2025-03-04 09:34:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1139 states have (on average 1.5109745390693592) internal successors, (1721), 1367 states have internal predecessors, (1721), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:34:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1733 transitions. [2025-03-04 09:34:14,240 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1733 transitions. Word has length 104 [2025-03-04 09:34:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:34:14,240 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1733 transitions. [2025-03-04 09:34:14,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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) [2025-03-04 09:34:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1733 transitions. [2025-03-04 09:34:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:34:14,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:34:14,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:34:14,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 09:34:14,241 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:34:14,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:34:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash -920004088, now seen corresponding path program 1 times [2025-03-04 09:34:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:34:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925360586] [2025-03-04 09:34:14,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:34:14,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:34:14,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:34:14,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:14,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:15,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:34:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925360586] [2025-03-04 09:34:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925360586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:34:15,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:34:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 09:34:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677888715] [2025-03-04 09:34:15,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:34:15,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:34:15,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:34:15,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:34:15,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:34:15,040 INFO L87 Difference]: Start difference. First operand 1377 states and 1733 transitions. Second operand has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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) [2025-03-04 09:34:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:34:16,626 INFO L93 Difference]: Finished difference Result 1380 states and 1737 transitions. [2025-03-04 09:34:16,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:34:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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 104 [2025-03-04 09:34:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:34:16,628 INFO L225 Difference]: With dead ends: 1380 [2025-03-04 09:34:16,629 INFO L226 Difference]: Without dead ends: 1380 [2025-03-04 09:34:16,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-04 09:34:16,629 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 715 mSDsluCounter, 3095 mSDsCounter, 0 mSdLazyCounter, 3566 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 3565 SdHoareTripleChecker+Invalid, 3584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:34:16,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 3565 Invalid, 3584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3566 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:34:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-04 09:34:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2025-03-04 09:34:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1139 states have (on average 1.5092186128182616) internal successors, (1719), 1367 states have internal predecessors, (1719), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:34:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1731 transitions. [2025-03-04 09:34:16,637 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1731 transitions. Word has length 104 [2025-03-04 09:34:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:34:16,638 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1731 transitions. [2025-03-04 09:34:16,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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) [2025-03-04 09:34:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1731 transitions. [2025-03-04 09:34:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 09:34:16,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:34:16,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:34:16,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 09:34:16,638 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:34:16,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:34:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1250208777, now seen corresponding path program 1 times [2025-03-04 09:34:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:34:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160347274] [2025-03-04 09:34:16,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:34:16,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:34:16,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:34:16,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:16,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:34:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160347274] [2025-03-04 09:34:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160347274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:34:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088395168] [2025-03-04 09:34:17,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:17,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:34:17,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:34:17,189 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:34:17,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:34:17,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:34:17,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:34:17,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:17,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:17,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 09:34:17,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:34:17,439 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 [2025-03-04 09:34:17,528 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:34:17,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:34:17,555 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 [2025-03-04 09:34:17,613 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 22 treesize of output 10 [2025-03-04 09:34:17,707 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:17,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34:17,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34:17,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:17,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34:17,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:17,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34:17,892 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:17,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:34: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 31 treesize of output 13 [2025-03-04 09:34:17,949 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 09:34:17,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-04 09:34:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:17,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:34:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088395168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:34:18,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:34:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2025-03-04 09:34:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70789030] [2025-03-04 09:34:18,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:34:18,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 09:34:18,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:34:18,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 09:34:18,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1232, Unknown=55, NotChecked=0, Total=1482 [2025-03-04 09:34:18,547 INFO L87 Difference]: Start difference. First operand 1377 states and 1731 transitions. Second operand has 28 states, 25 states have (on average 6.8) internal successors, (170), 27 states have internal predecessors, (170), 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) [2025-03-04 09:34:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:34:20,428 INFO L93 Difference]: Finished difference Result 1379 states and 1735 transitions. [2025-03-04 09:34:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:34:20,428 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.8) internal successors, (170), 27 states have internal predecessors, (170), 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 105 [2025-03-04 09:34:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:34:20,430 INFO L225 Difference]: With dead ends: 1379 [2025-03-04 09:34:20,430 INFO L226 Difference]: Without dead ends: 1379 [2025-03-04 09:34:20,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=1445, Unknown=55, NotChecked=0, Total=1722 [2025-03-04 09:34:20,431 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 680 mSDsluCounter, 5483 mSDsCounter, 0 mSdLazyCounter, 4360 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 5951 SdHoareTripleChecker+Invalid, 4373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:34:20,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 5951 Invalid, 4373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4360 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:34:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-03-04 09:34:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2025-03-04 09:34:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1139 states have (on average 1.507462686567164) internal successors, (1717), 1366 states have internal predecessors, (1717), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:34:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1729 transitions. [2025-03-04 09:34:20,442 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1729 transitions. Word has length 105 [2025-03-04 09:34:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:34:20,443 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1729 transitions. [2025-03-04 09:34:20,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.8) internal successors, (170), 27 states have internal predecessors, (170), 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) [2025-03-04 09:34:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1729 transitions. [2025-03-04 09:34:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 09:34:20,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:34:20,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:34:20,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:34:20,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 09:34:20,644 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:34:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:34:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1250208778, now seen corresponding path program 1 times [2025-03-04 09:34:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:34:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200592552] [2025-03-04 09:34:20,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:34:20,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:34:20,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:34:20,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:20,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:34:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200592552] [2025-03-04 09:34:21,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200592552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:34:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305441831] [2025-03-04 09:34:21,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:34:21,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:34:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:34:21,667 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:34:21,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 09:34:21,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:34:21,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:34:21,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:34:21,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:34:21,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 09:34:21,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:34:21,912 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 [2025-03-04 09:34:21,992 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 [2025-03-04 09:34:22,005 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:34:22,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:34:22,036 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 13 treesize of output 9 [2025-03-04 09:34:22,041 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 [2025-03-04 09:34:22,126 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 15 [2025-03-04 09:34:22,136 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 9 treesize of output 3 [2025-03-04 09:34:22,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:22,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:34:22,277 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 30 treesize of output 13 [2025-03-04 09:34:22,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:22,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:34:22,368 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 30 treesize of output 13 [2025-03-04 09:34:22,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:22,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:34:22,453 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 30 treesize of output 13 [2025-03-04 09:34:22,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:22,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:34:22,521 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 30 treesize of output 13 [2025-03-04 09:34:22,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:34:22,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:34:22,609 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 30 treesize of output 13 [2025-03-04 09:34:22,625 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 42 treesize of output 18 [2025-03-04 09:34:22,627 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 9 treesize of output 3 [2025-03-04 09:34:22,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:34:22,673 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 [2025-03-04 09:34:22,687 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:34:22,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 09:34:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:34:22,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:34:23,045 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (or (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2781) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2785 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2782))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2781) .cse2 v_ArrVal_2784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2785) (select (select (store .cse3 .cse2 v_ArrVal_2783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2025-03-04 09:34:23,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (v_ArrVal_2780 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2779))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2780) .cse1 v_ArrVal_2781) (select (select (store .cse2 .cse1 v_ArrVal_2782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2784))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2785 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2779))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2782))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2780) .cse4 v_ArrVal_2781) .cse5 v_ArrVal_2784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2785) (select (select (store .cse6 .cse5 v_ArrVal_2783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-03-04 09:34:38,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2778 (Array Int Int)) (v_ArrVal_2777 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2791))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2778))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2779))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2790) .cse0 v_ArrVal_2777) .cse1 v_ArrVal_2780) .cse2 v_ArrVal_2781) (select (select (store .cse3 .cse2 v_ArrVal_2782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2784))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2778 (Array Int Int)) (v_ArrVal_2777 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2785 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2791))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2778))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2779))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2782))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2790) .cse7 v_ArrVal_2777) .cse8 v_ArrVal_2780) .cse9 v_ArrVal_2781) .cse10 v_ArrVal_2784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2785) (select (select (store .cse11 .cse10 v_ArrVal_2783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2025-03-04 09:34:38,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305441831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:34:38,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:34:38,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 31 [2025-03-04 09:34:38,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139215819] [2025-03-04 09:34:38,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:34:38,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 09:34:38,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:34:38,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 09:34:38,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1438, Unknown=43, NotChecked=240, Total=1892 [2025-03-04 09:34:38,216 INFO L87 Difference]: Start difference. First operand 1376 states and 1729 transitions. Second operand has 32 states, 29 states have (on average 6.931034482758621) internal successors, (201), 31 states have internal predecessors, (201), 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)