./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 12:07:45,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:07:45,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:07:45,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:07:45,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:07:45,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:07:45,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:07:45,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:07:45,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:07:45,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:07:45,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:07:45,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:07:45,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:07:45,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:07:45,737 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:07:45,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:07:45,738 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:07:45,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:07:45,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:07:45,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:07:45,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:07:45,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:07:45,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:07:45,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:07:45,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:07:45,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:07:45,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:07:45,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:07:45,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:07:45,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:07:45,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:07:45,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:07:45,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:07:45,741 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-jdk21/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-02-06 12:07:46,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:07:46,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:07:46,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:07:46,094 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:07:46,095 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:07:46,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2025-02-06 12:07:47,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24f713a49/22a2f5f135474613b068c78effad3486/FLAGe19816536 [2025-02-06 12:07:48,052 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:07:48,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2025-02-06 12:07:48,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24f713a49/22a2f5f135474613b068c78effad3486/FLAGe19816536 [2025-02-06 12:07:48,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24f713a49/22a2f5f135474613b068c78effad3486 [2025-02-06 12:07:48,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:07:48,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:07:48,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:07:48,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:07:48,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:07:48,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:07:48" (1/1) ... [2025-02-06 12:07:48,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6626b782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:48, skipping insertion in model container [2025-02-06 12:07:48,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:07:48" (1/1) ... [2025-02-06 12:07:48,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:07:48,706 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:07:48,755 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:07:48,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-02-06 12:07:48,772 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:07:48,783 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:07:48,827 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:07:48,828 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:07:48,830 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:07:48,831 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:07:48,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:07:48,856 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:07:48,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:07:49,005 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:07:49,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49 WrapperNode [2025-02-06 12:07:49,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:07:49,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:07:49,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:07:49,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:07:49,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,107 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1251 [2025-02-06 12:07:49,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:07:49,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:07:49,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:07:49,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:07:49,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,206 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-02-06 12:07:49,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:07:49,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:07:49,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:07:49,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:07:49,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (1/1) ... [2025-02-06 12:07:49,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:07:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:07:49,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:07:49,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 12:07:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:07:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:07:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:07:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:07:49,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:07:49,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:07:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:07:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:07:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:07:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:07:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:07:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:07:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:07:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:07:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:07:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:07:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:07:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:07:49,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:07:49,609 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:07:49,612 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:07:51,868 INFO L1309 $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-02-06 12:07:52,004 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2025-02-06 12:07:52,004 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:07:52,089 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:07:52,089 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 12:07:52,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:07:52 BoogieIcfgContainer [2025-02-06 12:07:52,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:07:52,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:07:52,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:07:52,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:07:52,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:07:48" (1/3) ... [2025-02-06 12:07:52,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77321aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:07:52, skipping insertion in model container [2025-02-06 12:07:52,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:07:49" (2/3) ... [2025-02-06 12:07:52,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77321aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:07:52, skipping insertion in model container [2025-02-06 12:07:52,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:07:52" (3/3) ... [2025-02-06 12:07:52,102 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-1.i [2025-02-06 12:07:52,118 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:07:52,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test2-1.i that has 4 procedures, 1072 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2025-02-06 12:07:52,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:07:52,205 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;@77c088b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:07:52,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2025-02-06 12:07:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 1062 states, 640 states have (on average 1.99375) internal successors, (1276), 1057 states have internal predecessors, (1276), 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-02-06 12:07:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 12:07:52,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:52,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 12:07:52,222 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-02-06 12:07:52,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 41956222, now seen corresponding path program 1 times [2025-02-06 12:07:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609913603] [2025-02-06 12:07:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:52,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:07:52,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:07:52,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:52,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:52,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:52,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609913603] [2025-02-06 12:07:52,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609913603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:52,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:52,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:07:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196902726] [2025-02-06 12:07:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:52,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:07:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:52,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:07:52,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:07:52,570 INFO L87 Difference]: Start difference. First operand has 1062 states, 640 states have (on average 1.99375) internal successors, (1276), 1057 states have internal predecessors, (1276), 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-02-06 12:07:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:07:53,853 INFO L93 Difference]: Finished difference Result 1363 states and 1616 transitions. [2025-02-06 12:07:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:07:53,856 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-02-06 12:07:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:07:53,875 INFO L225 Difference]: With dead ends: 1363 [2025-02-06 12:07:53,876 INFO L226 Difference]: Without dead ends: 1359 [2025-02-06 12:07:53,878 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-02-06 12:07:53,881 INFO L435 NwaCegarLoop]: 1066 mSDtfsCounter, 387 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:07:53,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2552 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:07:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-06 12:07:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1274. [2025-02-06 12:07:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 858 states have (on average 1.867132867132867) internal successors, (1602), 1269 states have internal predecessors, (1602), 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-02-06 12:07:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1608 transitions. [2025-02-06 12:07:54,012 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1608 transitions. Word has length 4 [2025-02-06 12:07:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:07:54,013 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1608 transitions. [2025-02-06 12:07:54,013 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-02-06 12:07:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1608 transitions. [2025-02-06 12:07:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 12:07:54,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:54,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 12:07:54,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:07:54,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:07:54,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 41957565, now seen corresponding path program 1 times [2025-02-06 12:07:54,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:54,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135206571] [2025-02-06 12:07:54,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:54,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:54,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:07:54,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:07:54,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:54,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:54,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:54,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135206571] [2025-02-06 12:07:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135206571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:54,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:54,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:07:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668132991] [2025-02-06 12:07:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:07:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:54,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:07:54,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:07:54,136 INFO L87 Difference]: Start difference. First operand 1274 states and 1608 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-02-06 12:07:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:07:54,950 INFO L93 Difference]: Finished difference Result 1358 states and 1603 transitions. [2025-02-06 12:07:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:07:54,951 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-02-06 12:07:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:07:54,959 INFO L225 Difference]: With dead ends: 1358 [2025-02-06 12:07:54,963 INFO L226 Difference]: Without dead ends: 1358 [2025-02-06 12:07:54,963 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-02-06 12:07:54,965 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 385 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:07:54,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1814 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:07:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-02-06 12:07:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1273. [2025-02-06 12:07:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 858 states have (on average 1.858974358974359) internal successors, (1595), 1268 states have internal predecessors, (1595), 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-02-06 12:07:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1601 transitions. [2025-02-06 12:07:55,020 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1601 transitions. Word has length 4 [2025-02-06 12:07:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:07:55,020 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1601 transitions. [2025-02-06 12:07:55,020 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-02-06 12:07:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1601 transitions. [2025-02-06 12:07:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 12:07:55,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:55,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 12:07:55,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:07:55,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:07:55,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash 41957564, now seen corresponding path program 1 times [2025-02-06 12:07:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:55,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59010631] [2025-02-06 12:07:55,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:55,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:07:55,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:07:55,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:55,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:55,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59010631] [2025-02-06 12:07:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59010631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:07:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340283792] [2025-02-06 12:07:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:55,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:07:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:55,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:07:55,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:07:55,103 INFO L87 Difference]: Start difference. First operand 1273 states and 1601 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-02-06 12:07:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:07:55,711 INFO L93 Difference]: Finished difference Result 1270 states and 1593 transitions. [2025-02-06 12:07:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:07:55,712 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-02-06 12:07:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:07:55,718 INFO L225 Difference]: With dead ends: 1270 [2025-02-06 12:07:55,719 INFO L226 Difference]: Without dead ends: 1270 [2025-02-06 12:07:55,719 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-02-06 12:07:55,720 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1095 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:07:55,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 829 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:07:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-02-06 12:07:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2025-02-06 12:07:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 866 states have (on average 1.8325635103926097) internal successors, (1587), 1265 states have internal predecessors, (1587), 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-02-06 12:07:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1593 transitions. [2025-02-06 12:07:55,758 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1593 transitions. Word has length 4 [2025-02-06 12:07:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:07:55,758 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1593 transitions. [2025-02-06 12:07:55,758 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-02-06 12:07:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1593 transitions. [2025-02-06 12:07:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:07:55,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:55,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:07:55,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:07:55,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:07:55,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1488252626, now seen corresponding path program 1 times [2025-02-06 12:07:55,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:55,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205554108] [2025-02-06 12:07:55,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:55,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:07:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:07:55,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:55,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205554108] [2025-02-06 12:07:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205554108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:07:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786405067] [2025-02-06 12:07:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:56,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:07:56,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:56,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:07:56,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:07:56,031 INFO L87 Difference]: Start difference. First operand 1270 states and 1593 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-02-06 12:07:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:07:57,192 INFO L93 Difference]: Finished difference Result 1344 states and 1583 transitions. [2025-02-06 12:07:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:07:57,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-02-06 12:07:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:07:57,199 INFO L225 Difference]: With dead ends: 1344 [2025-02-06 12:07:57,199 INFO L226 Difference]: Without dead ends: 1344 [2025-02-06 12:07:57,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:07:57,200 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 3346 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3346 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:07:57,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3346 Valid, 1050 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:07:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2025-02-06 12:07:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1259. [2025-02-06 12:07:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 866 states have (on average 1.8187066974595842) internal successors, (1575), 1254 states have internal predecessors, (1575), 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-02-06 12:07:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1581 transitions. [2025-02-06 12:07:57,233 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1581 transitions. Word has length 9 [2025-02-06 12:07:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:07:57,233 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1581 transitions. [2025-02-06 12:07:57,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-02-06 12:07:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1581 transitions. [2025-02-06 12:07:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 12:07:57,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:57,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:07:57,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:07:57,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:07:57,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1108810098, now seen corresponding path program 1 times [2025-02-06 12:07:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398946243] [2025-02-06 12:07:57,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:57,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:07:57,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:07:57,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:57,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:57,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398946243] [2025-02-06 12:07:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398946243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:07:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494698416] [2025-02-06 12:07:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:57,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:07:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:57,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:07:57,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:07:57,306 INFO L87 Difference]: Start difference. First operand 1259 states and 1581 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:07:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:07:58,010 INFO L93 Difference]: Finished difference Result 1297 states and 1536 transitions. [2025-02-06 12:07:58,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:07:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 12:07:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:07:58,017 INFO L225 Difference]: With dead ends: 1297 [2025-02-06 12:07:58,017 INFO L226 Difference]: Without dead ends: 1297 [2025-02-06 12:07:58,018 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-02-06 12:07:58,018 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 1069 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1347 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:07:58,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1347 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:07:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-02-06 12:07:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1212. [2025-02-06 12:07:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 866 states have (on average 1.7644341801385681) internal successors, (1528), 1207 states have internal predecessors, (1528), 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-02-06 12:07:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1534 transitions. [2025-02-06 12:07:58,050 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1534 transitions. Word has length 10 [2025-02-06 12:07:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:07:58,050 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1534 transitions. [2025-02-06 12:07:58,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:07:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1534 transitions. [2025-02-06 12:07:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 12:07:58,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:58,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:07:58,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:07:58,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:07:58,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1108810099, now seen corresponding path program 1 times [2025-02-06 12:07:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507486984] [2025-02-06 12:07:58,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:58,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:07:58,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:07:58,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:58,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:58,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507486984] [2025-02-06 12:07:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507486984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:07:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994854947] [2025-02-06 12:07:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:58,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:07:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:58,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:07:58,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:07:58,202 INFO L87 Difference]: Start difference. First operand 1212 states and 1534 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:07:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:07:58,903 INFO L93 Difference]: Finished difference Result 1502 states and 1900 transitions. [2025-02-06 12:07:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:07:58,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 12:07:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:07:58,909 INFO L225 Difference]: With dead ends: 1502 [2025-02-06 12:07:58,910 INFO L226 Difference]: Without dead ends: 1502 [2025-02-06 12:07:58,910 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-02-06 12:07:58,911 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 860 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:07:58,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1596 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:07:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-02-06 12:07:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1187. [2025-02-06 12:07:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 866 states have (on average 1.7355658198614319) internal successors, (1503), 1182 states have internal predecessors, (1503), 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-02-06 12:07:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1509 transitions. [2025-02-06 12:07:58,943 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1509 transitions. Word has length 10 [2025-02-06 12:07:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:07:58,943 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1509 transitions. [2025-02-06 12:07:58,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:07:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1509 transitions. [2025-02-06 12:07:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 12:07:58,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:58,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:07:58,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:07:58,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:07:58,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:58,946 INFO L85 PathProgramCache]: Analyzing trace with hash -353540371, now seen corresponding path program 1 times [2025-02-06 12:07:58,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:58,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550445029] [2025-02-06 12:07:58,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:58,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:58,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:07:58,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:07:58,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:58,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550445029] [2025-02-06 12:07:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550445029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:59,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:07:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024281971] [2025-02-06 12:07:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:59,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:07:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:59,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:07:59,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:07:59,027 INFO L87 Difference]: Start difference. First operand 1187 states and 1509 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-02-06 12:07:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:07:59,693 INFO L93 Difference]: Finished difference Result 1262 states and 1615 transitions. [2025-02-06 12:07:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:07:59,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-02-06 12:07:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:07:59,699 INFO L225 Difference]: With dead ends: 1262 [2025-02-06 12:07:59,699 INFO L226 Difference]: Without dead ends: 1262 [2025-02-06 12:07:59,700 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-02-06 12:07:59,700 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1292 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:07:59,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1344 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:07:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2025-02-06 12:07:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1164. [2025-02-06 12:07:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 866 states have (on average 1.6824480369515011) internal successors, (1457), 1159 states have internal predecessors, (1457), 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-02-06 12:07:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1463 transitions. [2025-02-06 12:07:59,728 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1463 transitions. Word has length 16 [2025-02-06 12:07:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:07:59,728 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1463 transitions. [2025-02-06 12:07:59,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-02-06 12:07:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1463 transitions. [2025-02-06 12:07:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 12:07:59,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:59,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:07:59,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:07:59,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:07:59,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash -353540370, now seen corresponding path program 1 times [2025-02-06 12:07:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99789527] [2025-02-06 12:07:59,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:59,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:07:59,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:07:59,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:59,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:59,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99789527] [2025-02-06 12:07:59,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99789527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:59,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:59,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:07:59,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080736490] [2025-02-06 12:07:59,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:59,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:07:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:59,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:07:59,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:07:59,798 INFO L87 Difference]: Start difference. First operand 1164 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 12:07:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:07:59,873 INFO L93 Difference]: Finished difference Result 1026 states and 1257 transitions. [2025-02-06 12:07:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:07:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-02-06 12:07:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:07:59,878 INFO L225 Difference]: With dead ends: 1026 [2025-02-06 12:07:59,878 INFO L226 Difference]: Without dead ends: 1026 [2025-02-06 12:07:59,878 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-02-06 12:07:59,879 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 60 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1845 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-02-06 12:07:59,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1845 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:07:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-02-06 12:07:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2025-02-06 12:07:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 740 states have (on average 1.6905405405405405) internal successors, (1251), 1021 states have internal predecessors, (1251), 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-02-06 12:07:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1257 transitions. [2025-02-06 12:07:59,901 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1257 transitions. Word has length 16 [2025-02-06 12:07:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:07:59,901 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1257 transitions. [2025-02-06 12:07:59,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 12:07:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1257 transitions. [2025-02-06 12:07:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 12:07:59,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:07:59,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:07:59,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:07:59,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:07:59,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:07:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1925025705, now seen corresponding path program 1 times [2025-02-06 12:07:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:07:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724307898] [2025-02-06 12:07:59,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:07:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:07:59,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:07:59,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:07:59,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:07:59,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:07:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:07:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:07:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724307898] [2025-02-06 12:07:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724307898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:07:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:07:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:07:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348271331] [2025-02-06 12:07:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:07:59,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:07:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:07:59,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:07:59,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:07:59,989 INFO L87 Difference]: Start difference. First operand 1026 states and 1257 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:00,107 INFO L93 Difference]: Finished difference Result 997 states and 1207 transitions. [2025-02-06 12:08:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:08:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 12:08:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:00,111 INFO L225 Difference]: With dead ends: 997 [2025-02-06 12:08:00,111 INFO L226 Difference]: Without dead ends: 997 [2025-02-06 12:08:00,111 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-02-06 12:08:00,112 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 41 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:00,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2714 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:08:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-02-06 12:08:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 991. [2025-02-06 12:08:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 712 states have (on average 1.678370786516854) internal successors, (1195), 986 states have internal predecessors, (1195), 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-02-06 12:08:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1201 transitions. [2025-02-06 12:08:00,155 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1201 transitions. Word has length 17 [2025-02-06 12:08:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:00,155 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1201 transitions. [2025-02-06 12:08:00,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1201 transitions. [2025-02-06 12:08:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 12:08:00,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:00,156 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] [2025-02-06 12:08:00,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:08:00,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:00,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2013751675, now seen corresponding path program 1 times [2025-02-06 12:08:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100047635] [2025-02-06 12:08:00,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:00,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:08:00,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:08:00,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:00,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:00,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:00,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100047635] [2025-02-06 12:08:00,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100047635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:00,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:00,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:00,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899813922] [2025-02-06 12:08:00,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:00,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:00,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:00,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:00,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:00,236 INFO L87 Difference]: Start difference. First operand 991 states and 1201 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-02-06 12:08:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:00,942 INFO L93 Difference]: Finished difference Result 1060 states and 1256 transitions. [2025-02-06 12:08:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:08:00,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-02-06 12:08:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:00,946 INFO L225 Difference]: With dead ends: 1060 [2025-02-06 12:08:00,946 INFO L226 Difference]: Without dead ends: 1060 [2025-02-06 12:08:00,946 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-02-06 12:08:00,947 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 1179 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1592 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:00,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1592 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:08:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-02-06 12:08:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 968. [2025-02-06 12:08:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 712 states have (on average 1.646067415730337) internal successors, (1172), 963 states have internal predecessors, (1172), 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-02-06 12:08:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1178 transitions. [2025-02-06 12:08:00,963 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1178 transitions. Word has length 20 [2025-02-06 12:08:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:00,964 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1178 transitions. [2025-02-06 12:08:00,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-02-06 12:08:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1178 transitions. [2025-02-06 12:08:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 12:08:00,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:00,964 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] [2025-02-06 12:08:00,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:08:00,965 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:00,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2013751674, now seen corresponding path program 1 times [2025-02-06 12:08:00,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:00,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361427121] [2025-02-06 12:08:00,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:00,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:00,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:08:00,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:08:00,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:00,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:01,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:01,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361427121] [2025-02-06 12:08:01,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361427121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:01,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:01,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:01,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552635805] [2025-02-06 12:08:01,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:01,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:08:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:01,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:08:01,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:01,018 INFO L87 Difference]: Start difference. First operand 968 states and 1178 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-06 12:08:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:01,071 INFO L93 Difference]: Finished difference Result 893 states and 1075 transitions. [2025-02-06 12:08:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:08:01,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-02-06 12:08:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:01,074 INFO L225 Difference]: With dead ends: 893 [2025-02-06 12:08:01,075 INFO L226 Difference]: Without dead ends: 893 [2025-02-06 12:08:01,075 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-02-06 12:08:01,075 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 60 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1555 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-02-06 12:08:01,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1555 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:08:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-02-06 12:08:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2025-02-06 12:08:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 649 states have (on average 1.6471494607087827) internal successors, (1069), 888 states have internal predecessors, (1069), 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-02-06 12:08:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1075 transitions. [2025-02-06 12:08:01,090 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1075 transitions. Word has length 20 [2025-02-06 12:08:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1075 transitions. [2025-02-06 12:08:01,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-06 12:08:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1075 transitions. [2025-02-06 12:08:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:08:01,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:01,091 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] [2025-02-06 12:08:01,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:08:01,092 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:01,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1998083685, now seen corresponding path program 1 times [2025-02-06 12:08:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:01,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127100247] [2025-02-06 12:08:01,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:01,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:08:01,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:08:01,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:01,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:01,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:01,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127100247] [2025-02-06 12:08:01,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127100247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:01,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:01,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661478055] [2025-02-06 12:08:01,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:01,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:01,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:01,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:01,153 INFO L87 Difference]: Start difference. First operand 893 states and 1075 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-02-06 12:08:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:01,250 INFO L93 Difference]: Finished difference Result 878 states and 1053 transitions. [2025-02-06 12:08:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:08:01,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2025-02-06 12:08:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:01,254 INFO L225 Difference]: With dead ends: 878 [2025-02-06 12:08:01,254 INFO L226 Difference]: Without dead ends: 878 [2025-02-06 12:08:01,255 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-02-06 12:08:01,255 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 45 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:01,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2275 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:08:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-02-06 12:08:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2025-02-06 12:08:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 641 states have (on average 1.6333853354134165) internal successors, (1047), 873 states have internal predecessors, (1047), 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-02-06 12:08:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1053 transitions. [2025-02-06 12:08:01,271 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1053 transitions. Word has length 21 [2025-02-06 12:08:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1053 transitions. [2025-02-06 12:08:01,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-02-06 12:08:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1053 transitions. [2025-02-06 12:08:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 12:08:01,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:01,272 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] [2025-02-06 12:08:01,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:08:01,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:01,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1915344769, now seen corresponding path program 1 times [2025-02-06 12:08:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:01,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478532172] [2025-02-06 12:08:01,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:01,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:08:01,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:08:01,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:01,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:01,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:01,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478532172] [2025-02-06 12:08:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478532172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:01,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:01,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590458166] [2025-02-06 12:08:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:01,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:01,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:01,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:01,455 INFO L87 Difference]: Start difference. First operand 878 states and 1053 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-02-06 12:08:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:02,090 INFO L93 Difference]: Finished difference Result 966 states and 1127 transitions. [2025-02-06 12:08:02,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:08:02,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2025-02-06 12:08:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:02,093 INFO L225 Difference]: With dead ends: 966 [2025-02-06 12:08:02,093 INFO L226 Difference]: Without dead ends: 966 [2025-02-06 12:08:02,094 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-02-06 12:08:02,094 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 384 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:02,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1701 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:08:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-02-06 12:08:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 878. [2025-02-06 12:08:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 641 states have (on average 1.6271450858034322) internal successors, (1043), 873 states have internal predecessors, (1043), 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-02-06 12:08:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1049 transitions. [2025-02-06 12:08:02,108 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1049 transitions. Word has length 31 [2025-02-06 12:08:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:02,108 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1049 transitions. [2025-02-06 12:08:02,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-02-06 12:08:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1049 transitions. [2025-02-06 12:08:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 12:08:02,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:02,109 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] [2025-02-06 12:08:02,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:08:02,109 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:02,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1656635323, now seen corresponding path program 1 times [2025-02-06 12:08:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:02,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106657585] [2025-02-06 12:08:02,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:02,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 12:08:02,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 12:08:02,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:02,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:02,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:02,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106657585] [2025-02-06 12:08:02,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106657585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:02,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:02,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:02,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525968889] [2025-02-06 12:08:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:02,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:02,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:02,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:02,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:02,302 INFO L87 Difference]: Start difference. First operand 878 states and 1049 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:02,952 INFO L93 Difference]: Finished difference Result 1119 states and 1358 transitions. [2025-02-06 12:08:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:08:02,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 12:08:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:02,956 INFO L225 Difference]: With dead ends: 1119 [2025-02-06 12:08:02,956 INFO L226 Difference]: Without dead ends: 1119 [2025-02-06 12:08:02,957 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-02-06 12:08:02,957 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 707 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:02,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1745 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:08:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-02-06 12:08:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 874. [2025-02-06 12:08:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 641 states have (on average 1.6209048361934477) internal successors, (1039), 869 states have internal predecessors, (1039), 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-02-06 12:08:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1045 transitions. [2025-02-06 12:08:02,975 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1045 transitions. Word has length 35 [2025-02-06 12:08:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:02,975 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1045 transitions. [2025-02-06 12:08:02,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1045 transitions. [2025-02-06 12:08:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 12:08:02,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:02,977 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] [2025-02-06 12:08:02,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:08:02,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash 978277457, now seen corresponding path program 1 times [2025-02-06 12:08:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237745771] [2025-02-06 12:08:02,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:02,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 12:08:02,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 12:08:02,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:02,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237745771] [2025-02-06 12:08:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237745771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:03,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:03,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808576101] [2025-02-06 12:08:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:03,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:03,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:03,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:03,073 INFO L87 Difference]: Start difference. First operand 874 states and 1045 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:03,162 INFO L93 Difference]: Finished difference Result 874 states and 1037 transitions. [2025-02-06 12:08:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:08:03,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-06 12:08:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:03,165 INFO L225 Difference]: With dead ends: 874 [2025-02-06 12:08:03,165 INFO L226 Difference]: Without dead ends: 874 [2025-02-06 12:08:03,166 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-02-06 12:08:03,166 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 27 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2255 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-02-06 12:08:03,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2255 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:08:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-02-06 12:08:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-02-06 12:08:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 641 states have (on average 1.608424336973479) internal successors, (1031), 869 states have internal predecessors, (1031), 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-02-06 12:08:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1037 transitions. [2025-02-06 12:08:03,181 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1037 transitions. Word has length 64 [2025-02-06 12:08:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:03,181 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1037 transitions. [2025-02-06 12:08:03,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1037 transitions. [2025-02-06 12:08:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 12:08:03,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:03,182 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] [2025-02-06 12:08:03,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:08:03,182 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:03,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:03,183 INFO L85 PathProgramCache]: Analyzing trace with hash -561608348, now seen corresponding path program 1 times [2025-02-06 12:08:03,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:03,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261732106] [2025-02-06 12:08:03,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:03,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:03,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 12:08:03,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 12:08:03,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:03,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:03,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:03,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261732106] [2025-02-06 12:08:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261732106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:03,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989471238] [2025-02-06 12:08:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:03,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:03,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:03,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:03,327 INFO L87 Difference]: Start difference. First operand 874 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:03,412 INFO L93 Difference]: Finished difference Result 868 states and 1027 transitions. [2025-02-06 12:08:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:08:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 12:08:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:03,415 INFO L225 Difference]: With dead ends: 868 [2025-02-06 12:08:03,416 INFO L226 Difference]: Without dead ends: 868 [2025-02-06 12:08:03,416 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-02-06 12:08:03,416 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 21 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2249 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-02-06 12:08:03,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2249 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:08:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-02-06 12:08:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2025-02-06 12:08:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 635 states have (on average 1.6078740157480316) internal successors, (1021), 863 states have internal predecessors, (1021), 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-02-06 12:08:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1027 transitions. [2025-02-06 12:08:03,429 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1027 transitions. Word has length 70 [2025-02-06 12:08:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:03,430 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1027 transitions. [2025-02-06 12:08:03,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1027 transitions. [2025-02-06 12:08:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 12:08:03,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:03,430 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] [2025-02-06 12:08:03,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:08:03,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1762600457, now seen corresponding path program 1 times [2025-02-06 12:08:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:03,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31272220] [2025-02-06 12:08:03,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:03,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:03,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 12:08:03,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 12:08:03,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:03,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:03,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:03,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31272220] [2025-02-06 12:08:03,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31272220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:03,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:03,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:03,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372248697] [2025-02-06 12:08:03,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:03,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:08:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:03,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:08:03,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:03,558 INFO L87 Difference]: Start difference. First operand 868 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:03,662 INFO L93 Difference]: Finished difference Result 1028 states and 1196 transitions. [2025-02-06 12:08:03,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:08:03,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 12:08:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:03,666 INFO L225 Difference]: With dead ends: 1028 [2025-02-06 12:08:03,666 INFO L226 Difference]: Without dead ends: 1028 [2025-02-06 12:08:03,667 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-02-06 12:08:03,667 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 198 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1508 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-02-06 12:08:03,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1508 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:08:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-02-06 12:08:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1018. [2025-02-06 12:08:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 785 states have (on average 1.5108280254777071) internal successors, (1186), 1013 states have internal predecessors, (1186), 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-02-06 12:08:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1192 transitions. [2025-02-06 12:08:03,686 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1192 transitions. Word has length 72 [2025-02-06 12:08:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:03,686 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1192 transitions. [2025-02-06 12:08:03,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1192 transitions. [2025-02-06 12:08:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:08:03,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:03,688 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] [2025-02-06 12:08:03,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:08:03,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:03,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -449089673, now seen corresponding path program 1 times [2025-02-06 12:08:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:03,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436346656] [2025-02-06 12:08:03,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:03,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:08:03,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:08:03,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:03,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:04,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:04,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436346656] [2025-02-06 12:08:04,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436346656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:04,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:04,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:08:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439863671] [2025-02-06 12:08:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:04,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:08:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:04,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:08:04,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:08:04,089 INFO L87 Difference]: Start difference. First operand 1018 states and 1192 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:04,302 INFO L93 Difference]: Finished difference Result 1498 states and 1702 transitions. [2025-02-06 12:08:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:08:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-06 12:08:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:04,307 INFO L225 Difference]: With dead ends: 1498 [2025-02-06 12:08:04,307 INFO L226 Difference]: Without dead ends: 1494 [2025-02-06 12:08:04,307 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-02-06 12:08:04,308 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 734 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:04,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 3010 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:08:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2025-02-06 12:08:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 919. [2025-02-06 12:08:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 686 states have (on average 1.5422740524781342) internal successors, (1058), 914 states have internal predecessors, (1058), 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-02-06 12:08:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1064 transitions. [2025-02-06 12:08:04,327 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1064 transitions. Word has length 77 [2025-02-06 12:08:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:04,327 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1064 transitions. [2025-02-06 12:08:04,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1064 transitions. [2025-02-06 12:08:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:08:04,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:04,328 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] [2025-02-06 12:08:04,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:08:04,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1820432039, now seen corresponding path program 1 times [2025-02-06 12:08:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190602084] [2025-02-06 12:08:04,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:04,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:08:04,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:08:04,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:04,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:04,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:04,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190602084] [2025-02-06 12:08:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190602084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:04,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303249923] [2025-02-06 12:08:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:08:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:04,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:08:04,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:08:04,606 INFO L87 Difference]: Start difference. First operand 919 states and 1064 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-02-06 12:08:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:05,236 INFO L93 Difference]: Finished difference Result 918 states and 1063 transitions. [2025-02-06 12:08:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:08:05,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2025-02-06 12:08:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:05,240 INFO L225 Difference]: With dead ends: 918 [2025-02-06 12:08:05,241 INFO L226 Difference]: Without dead ends: 918 [2025-02-06 12:08:05,241 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-02-06 12:08:05,241 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 2 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2227 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:05,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2227 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:08:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-02-06 12:08:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2025-02-06 12:08:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 686 states have (on average 1.5408163265306123) internal successors, (1057), 913 states have internal predecessors, (1057), 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-02-06 12:08:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1063 transitions. [2025-02-06 12:08:05,258 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1063 transitions. Word has length 86 [2025-02-06 12:08:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:05,259 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1063 transitions. [2025-02-06 12:08:05,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-02-06 12:08:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1063 transitions. [2025-02-06 12:08:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:08:05,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:05,262 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] [2025-02-06 12:08:05,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:08:05,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:05,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1820432040, now seen corresponding path program 1 times [2025-02-06 12:08:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236856385] [2025-02-06 12:08:05,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:05,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:05,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:08:05,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:08:05,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:05,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236856385] [2025-02-06 12:08:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236856385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74085461] [2025-02-06 12:08:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:05,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:08:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:05,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:08:05,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:08:05,757 INFO L87 Difference]: Start difference. First operand 918 states and 1063 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-02-06 12:08:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:06,473 INFO L93 Difference]: Finished difference Result 917 states and 1062 transitions. [2025-02-06 12:08:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:08:06,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2025-02-06 12:08:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:06,477 INFO L225 Difference]: With dead ends: 917 [2025-02-06 12:08:06,477 INFO L226 Difference]: Without dead ends: 917 [2025-02-06 12:08:06,478 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-02-06 12:08:06,478 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 1 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:06,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2186 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:08:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-02-06 12:08:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2025-02-06 12:08:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 685 states have (on average 1.5416058394160583) internal successors, (1056), 912 states have internal predecessors, (1056), 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-02-06 12:08:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1062 transitions. [2025-02-06 12:08:06,493 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1062 transitions. Word has length 86 [2025-02-06 12:08:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:06,494 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1062 transitions. [2025-02-06 12:08:06,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-02-06 12:08:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1062 transitions. [2025-02-06 12:08:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:08:06,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:06,495 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-02-06 12:08:06,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:08:06,495 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1003171108, now seen corresponding path program 1 times [2025-02-06 12:08:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:06,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377167043] [2025-02-06 12:08:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:06,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:08:06,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:08:06,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377167043] [2025-02-06 12:08:06,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377167043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:06,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:06,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:08:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064122074] [2025-02-06 12:08:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:06,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:08:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:06,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:08:06,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:08:06,767 INFO L87 Difference]: Start difference. First operand 917 states and 1062 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-02-06 12:08:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:07,471 INFO L93 Difference]: Finished difference Result 929 states and 1077 transitions. [2025-02-06 12:08:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:08:07,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-02-06 12:08:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:07,478 INFO L225 Difference]: With dead ends: 929 [2025-02-06 12:08:07,478 INFO L226 Difference]: Without dead ends: 929 [2025-02-06 12:08:07,478 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-02-06 12:08:07,482 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 6 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2998 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:07,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2998 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:08:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-02-06 12:08:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2025-02-06 12:08:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 690 states have (on average 1.5405797101449274) internal successors, (1063), 917 states have internal predecessors, (1063), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 12:08:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1072 transitions. [2025-02-06 12:08:07,503 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1072 transitions. Word has length 94 [2025-02-06 12:08:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:07,503 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1072 transitions. [2025-02-06 12:08:07,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-02-06 12:08:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1072 transitions. [2025-02-06 12:08:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:08:07,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:07,504 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-02-06 12:08:07,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:08:07,504 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:07,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:07,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1003171109, now seen corresponding path program 1 times [2025-02-06 12:08:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:07,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494705751] [2025-02-06 12:08:07,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:08:07,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:08:07,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:07,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:08,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:08,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494705751] [2025-02-06 12:08:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494705751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:08,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:08:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037600260] [2025-02-06 12:08:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:08,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:08:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:08,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:08:08,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:08:08,067 INFO L87 Difference]: Start difference. First operand 923 states and 1072 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 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-02-06 12:08:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:08,890 INFO L93 Difference]: Finished difference Result 923 states and 1071 transitions. [2025-02-06 12:08:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:08:08,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 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-02-06 12:08:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:08,895 INFO L225 Difference]: With dead ends: 923 [2025-02-06 12:08:08,896 INFO L226 Difference]: Without dead ends: 923 [2025-02-06 12:08:08,897 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-02-06 12:08:08,898 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 1 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:08,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2832 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:08:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-02-06 12:08:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2025-02-06 12:08:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 690 states have (on average 1.5391304347826087) internal successors, (1062), 917 states have internal predecessors, (1062), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 12:08:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1071 transitions. [2025-02-06 12:08:08,918 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1071 transitions. Word has length 94 [2025-02-06 12:08:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:08,918 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1071 transitions. [2025-02-06 12:08:08,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 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-02-06 12:08:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1071 transitions. [2025-02-06 12:08:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:08:08,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:08,919 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-02-06 12:08:08,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:08:08,919 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:08,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1161016884, now seen corresponding path program 1 times [2025-02-06 12:08:08,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:08,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82429445] [2025-02-06 12:08:08,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:08,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:08,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:08:08,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:08:08,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:08,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82429445] [2025-02-06 12:08:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82429445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686364329] [2025-02-06 12:08:09,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:09,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:09,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:09,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:09,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:08:09,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:08:09,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:08:09,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:09,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:09,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 12:08:09,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:09,784 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:08:09,785 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-02-06 12:08:09,822 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-02-06 12:08:09,913 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-02-06 12:08:10,118 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:10,118 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-02-06 12:08:10,164 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-02-06 12:08:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:10,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:10,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686364329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:10,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:10,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-02-06 12:08:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500245905] [2025-02-06 12:08:10,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:10,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:08:10,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:10,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:08:10,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=314, Unknown=10, NotChecked=0, Total=380 [2025-02-06 12:08:10,287 INFO L87 Difference]: Start difference. First operand 923 states and 1071 transitions. Second operand has 19 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 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-02-06 12:08:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:12,818 INFO L93 Difference]: Finished difference Result 930 states and 1078 transitions. [2025-02-06 12:08:12,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:08:12,819 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 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-02-06 12:08:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:12,823 INFO L225 Difference]: With dead ends: 930 [2025-02-06 12:08:12,823 INFO L226 Difference]: Without dead ends: 930 [2025-02-06 12:08:12,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=458, Unknown=11, NotChecked=0, Total=552 [2025-02-06 12:08:12,824 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 708 mSDsluCounter, 5541 mSDsCounter, 0 mSdLazyCounter, 4308 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 6017 SdHoareTripleChecker+Invalid, 4323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:12,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 6017 Invalid, 4323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4308 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 12:08:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-06 12:08:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 927. [2025-02-06 12:08:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 694 states have (on average 1.5360230547550433) internal successors, (1066), 920 states have internal predecessors, (1066), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1073 transitions. [2025-02-06 12:08:12,843 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1073 transitions. Word has length 95 [2025-02-06 12:08:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:12,843 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1073 transitions. [2025-02-06 12:08:12,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 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-02-06 12:08:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1073 transitions. [2025-02-06 12:08:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:08:12,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:12,844 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-02-06 12:08:12,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 12:08:13,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 12:08:13,048 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:13,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:13,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1161016883, now seen corresponding path program 1 times [2025-02-06 12:08:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088030482] [2025-02-06 12:08:13,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:13,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:13,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:08:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:08:13,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088030482] [2025-02-06 12:08:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088030482] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224596408] [2025-02-06 12:08:13,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:13,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:13,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:13,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:13,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:08:13,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:08:14,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:08:14,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:14,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:14,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 12:08:14,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:14,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:08:14,149 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-02-06 12:08:14,155 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-02-06 12:08:14,165 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-02-06 12:08:14,169 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-02-06 12:08:14,230 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-02-06 12:08:14,235 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-02-06 12:08:14,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:14,341 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-02-06 12:08:14,346 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-02-06 12:08:14,376 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-02-06 12:08:14,384 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-02-06 12:08:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:14,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:14,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_784 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2025-02-06 12:08:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224596408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:14,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-02-06 12:08:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923367555] [2025-02-06 12:08:14,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:08:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:14,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:08:14,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-06 12:08:14,511 INFO L87 Difference]: Start difference. First operand 927 states and 1073 transitions. Second operand has 15 states, 12 states have (on average 9.5) internal successors, (114), 15 states have internal predecessors, (114), 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-02-06 12:08:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:16,483 INFO L93 Difference]: Finished difference Result 929 states and 1077 transitions. [2025-02-06 12:08:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:08:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.5) internal successors, (114), 15 states have internal predecessors, (114), 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-02-06 12:08:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:16,488 INFO L225 Difference]: With dead ends: 929 [2025-02-06 12:08:16,488 INFO L226 Difference]: Without dead ends: 929 [2025-02-06 12:08:16,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-06 12:08:16,492 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 706 mSDsluCounter, 3578 mSDsCounter, 0 mSdLazyCounter, 3900 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 4057 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:16,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 4057 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3900 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:08:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-02-06 12:08:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 920. [2025-02-06 12:08:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 689 states have (on average 1.537010159651669) internal successors, (1059), 914 states have internal predecessors, (1059), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:08:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1065 transitions. [2025-02-06 12:08:16,510 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1065 transitions. Word has length 95 [2025-02-06 12:08:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:16,510 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1065 transitions. [2025-02-06 12:08:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.5) internal successors, (114), 15 states have internal predecessors, (114), 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-02-06 12:08:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1065 transitions. [2025-02-06 12:08:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 12:08:16,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:16,511 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-02-06 12:08:16,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:08:16,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:16,712 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:16,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1088904615, now seen corresponding path program 1 times [2025-02-06 12:08:16,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:16,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286178014] [2025-02-06 12:08:16,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:16,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:16,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:08:16,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:08:16,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:16,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286178014] [2025-02-06 12:08:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286178014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:08:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629340032] [2025-02-06 12:08:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:08:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:17,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:08:17,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:08:17,195 INFO L87 Difference]: Start difference. First operand 920 states and 1065 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 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-02-06 12:08:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:18,683 INFO L93 Difference]: Finished difference Result 933 states and 1081 transitions. [2025-02-06 12:08:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:08:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 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-02-06 12:08:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:18,687 INFO L225 Difference]: With dead ends: 933 [2025-02-06 12:08:18,687 INFO L226 Difference]: Without dead ends: 933 [2025-02-06 12:08:18,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:08:18,688 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 718 mSDsluCounter, 3693 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 4169 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:18,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 4169 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2984 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 12:08:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-06 12:08:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 929. [2025-02-06 12:08:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 697 states have (on average 1.533715925394548) internal successors, (1069), 922 states have internal predecessors, (1069), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1076 transitions. [2025-02-06 12:08:18,703 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1076 transitions. Word has length 97 [2025-02-06 12:08:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:18,703 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1076 transitions. [2025-02-06 12:08:18,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 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-02-06 12:08:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1076 transitions. [2025-02-06 12:08:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 12:08:18,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:18,705 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-02-06 12:08:18,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 12:08:18,705 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:18,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1088904616, now seen corresponding path program 1 times [2025-02-06 12:08:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978234750] [2025-02-06 12:08:18,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:18,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:08:18,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:08:18,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:18,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:19,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:19,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978234750] [2025-02-06 12:08:19,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978234750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:19,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:19,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:08:19,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189838329] [2025-02-06 12:08:19,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:19,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:08:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:19,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:08:19,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:08:19,321 INFO L87 Difference]: Start difference. First operand 929 states and 1076 transitions. Second operand has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 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-02-06 12:08:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:20,777 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-06 12:08:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:08:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 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-02-06 12:08:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:20,779 INFO L225 Difference]: With dead ends: 932 [2025-02-06 12:08:20,779 INFO L226 Difference]: Without dead ends: 932 [2025-02-06 12:08:20,780 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-02-06 12:08:20,780 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 710 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 3147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 3225 SdHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:20,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 3225 Invalid, 3158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3147 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 12:08:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-06 12:08:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2025-02-06 12:08:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 697 states have (on average 1.5322812051649928) internal successors, (1068), 922 states have internal predecessors, (1068), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1075 transitions. [2025-02-06 12:08:20,792 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1075 transitions. Word has length 97 [2025-02-06 12:08:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:20,793 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1075 transitions. [2025-02-06 12:08:20,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 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-02-06 12:08:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1075 transitions. [2025-02-06 12:08:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:08:20,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:20,794 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-02-06 12:08:20,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 12:08:20,794 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:20,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash -481484801, now seen corresponding path program 1 times [2025-02-06 12:08:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:20,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596069983] [2025-02-06 12:08:20,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:20,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:20,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:08:20,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:08:20,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:20,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:21,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:21,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596069983] [2025-02-06 12:08:21,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596069983] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:21,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846725003] [2025-02-06 12:08:21,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:21,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:21,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:21,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:21,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:08:21,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:08:21,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:08:21,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:21,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:21,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:08:21,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:21,586 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-02-06 12:08:21,718 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:08:21,719 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-02-06 12:08:21,752 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-02-06 12:08:21,829 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-02-06 12:08:21,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:21,952 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-02-06 12:08:22,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:22,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:08:22,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 31 treesize of output 13 [2025-02-06 12:08:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:22,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:22,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1065 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:08:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846725003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:22,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-06 12:08:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165705343] [2025-02-06 12:08:22,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:22,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:08:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:22,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:08:22,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=457, Unknown=18, NotChecked=44, Total=600 [2025-02-06 12:08:22,163 INFO L87 Difference]: Start difference. First operand 929 states and 1075 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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-02-06 12:08:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:24,104 INFO L93 Difference]: Finished difference Result 931 states and 1079 transitions. [2025-02-06 12:08:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:08:24,104 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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-02-06 12:08:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:24,106 INFO L225 Difference]: With dead ends: 931 [2025-02-06 12:08:24,106 INFO L226 Difference]: Without dead ends: 931 [2025-02-06 12:08:24,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=584, Unknown=19, NotChecked=50, Total=756 [2025-02-06 12:08:24,107 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 693 mSDsluCounter, 5558 mSDsCounter, 0 mSdLazyCounter, 4305 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 4317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:24,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 6033 Invalid, 4317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4305 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 12:08:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-06 12:08:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 928. [2025-02-06 12:08:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 697 states have (on average 1.5308464849354375) internal successors, (1067), 921 states have internal predecessors, (1067), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1074 transitions. [2025-02-06 12:08:24,119 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1074 transitions. Word has length 98 [2025-02-06 12:08:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:24,119 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1074 transitions. [2025-02-06 12:08:24,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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-02-06 12:08:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1074 transitions. [2025-02-06 12:08:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:08:24,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:24,120 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-02-06 12:08:24,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:08:24,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:24,324 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:24,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash -481484800, now seen corresponding path program 1 times [2025-02-06 12:08:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:24,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604953134] [2025-02-06 12:08:24,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:24,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:08:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:08:24,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:24,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:25,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:25,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604953134] [2025-02-06 12:08:25,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604953134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:25,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806315389] [2025-02-06 12:08:25,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:25,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:25,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:25,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:08:25,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:08:25,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:08:25,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:25,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:25,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 12:08:25,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:25,255 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-02-06 12:08:25,350 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-02-06 12:08:25,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:08:25,359 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-02-06 12:08:25,370 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-02-06 12:08:25,375 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-02-06 12:08:25,432 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-02-06 12:08:25,436 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-02-06 12:08:25,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:25,530 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-02-06 12:08:25,534 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-02-06 12:08:25,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:25,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:08:25,603 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-02-06 12:08:25,617 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-02-06 12:08:25,621 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-02-06 12:08:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:25,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:25,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1219 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-02-06 12:08:25,688 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_1219 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1219 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-02-06 12:08:25,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1225) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1226))) (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_1225) .cse1 v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:08:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806315389] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:25,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-02-06 12:08:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643909953] [2025-02-06 12:08:25,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:25,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 12:08:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:25,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 12:08:25,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-02-06 12:08:25,739 INFO L87 Difference]: Start difference. First operand 928 states and 1074 transitions. Second operand has 17 states, 14 states have (on average 10.5) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:08:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:27,185 INFO L93 Difference]: Finished difference Result 930 states and 1078 transitions. [2025-02-06 12:08:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:08:27,185 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.5) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2025-02-06 12:08:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:27,188 INFO L225 Difference]: With dead ends: 930 [2025-02-06 12:08:27,188 INFO L226 Difference]: Without dead ends: 930 [2025-02-06 12:08:27,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-02-06 12:08:27,189 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 697 mSDsluCounter, 2859 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:27,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 3337 Invalid, 3063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:08:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-06 12:08:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 918. [2025-02-06 12:08:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 912 states have internal predecessors, (1057), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:08:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1063 transitions. [2025-02-06 12:08:27,200 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1063 transitions. Word has length 98 [2025-02-06 12:08:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:27,201 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1063 transitions. [2025-02-06 12:08:27,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.5) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:08:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1063 transitions. [2025-02-06 12:08:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 12:08:27,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:27,202 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-02-06 12:08:27,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:08:27,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 12:08:27,406 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:27,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash -329736419, now seen corresponding path program 1 times [2025-02-06 12:08:27,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:27,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466887076] [2025-02-06 12:08:27,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:27,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:27,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 12:08:27,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 12:08:27,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:27,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:27,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:27,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466887076] [2025-02-06 12:08:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466887076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:27,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 12:08:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843928415] [2025-02-06 12:08:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:08:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:27,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:08:27,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:08:27,812 INFO L87 Difference]: Start difference. First operand 918 states and 1063 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 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-02-06 12:08:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:29,176 INFO L93 Difference]: Finished difference Result 934 states and 1082 transitions. [2025-02-06 12:08:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:08:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 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-02-06 12:08:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:29,178 INFO L225 Difference]: With dead ends: 934 [2025-02-06 12:08:29,178 INFO L226 Difference]: Without dead ends: 934 [2025-02-06 12:08:29,178 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-02-06 12:08:29,179 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 731 mSDsluCounter, 3724 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4202 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:29,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4202 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:08:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-06 12:08:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2025-02-06 12:08:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 700 states have (on average 1.5285714285714285) internal successors, (1070), 923 states have internal predecessors, (1070), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1077 transitions. [2025-02-06 12:08:29,190 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1077 transitions. Word has length 100 [2025-02-06 12:08:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1077 transitions. [2025-02-06 12:08:29,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 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-02-06 12:08:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1077 transitions. [2025-02-06 12:08:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 12:08:29,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:29,191 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-02-06 12:08:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 12:08:29,191 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:29,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash -329736418, now seen corresponding path program 1 times [2025-02-06 12:08:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:29,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730303506] [2025-02-06 12:08:29,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:29,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:29,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 12:08:29,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 12:08:29,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:29,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:29,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:29,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730303506] [2025-02-06 12:08:29,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730303506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:29,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:29,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 12:08:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43835392] [2025-02-06 12:08:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:29,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:08:29,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:29,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:08:29,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:08:29,786 INFO L87 Difference]: Start difference. First operand 930 states and 1077 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 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-02-06 12:08:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:31,007 INFO L93 Difference]: Finished difference Result 933 states and 1081 transitions. [2025-02-06 12:08:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:08:31,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 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-02-06 12:08:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:31,010 INFO L225 Difference]: With dead ends: 933 [2025-02-06 12:08:31,010 INFO L226 Difference]: Without dead ends: 933 [2025-02-06 12:08:31,010 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-02-06 12:08:31,010 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 712 mSDsluCounter, 2384 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2863 SdHoareTripleChecker+Invalid, 2727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:31,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2863 Invalid, 2727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:08:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-06 12:08:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 930. [2025-02-06 12:08:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 700 states have (on average 1.5271428571428571) internal successors, (1069), 923 states have internal predecessors, (1069), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1076 transitions. [2025-02-06 12:08:31,024 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1076 transitions. Word has length 100 [2025-02-06 12:08:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:31,025 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1076 transitions. [2025-02-06 12:08:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 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-02-06 12:08:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1076 transitions. [2025-02-06 12:08:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 12:08:31,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:31,026 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-02-06 12:08:31,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 12:08:31,027 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:31,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1277926853, now seen corresponding path program 1 times [2025-02-06 12:08:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479367316] [2025-02-06 12:08:31,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:31,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 12:08:31,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 12:08:31,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:31,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:31,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:31,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479367316] [2025-02-06 12:08:31,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479367316] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:31,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076659148] [2025-02-06 12:08:31,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:31,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:31,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:31,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:31,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:08:31,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 12:08:31,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 12:08:31,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:31,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:31,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 12:08:31,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:31,811 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-02-06 12:08:31,900 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:08:31,900 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-02-06 12:08:31,927 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-02-06 12:08:31,995 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-02-06 12:08:32,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:32,113 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-02-06 12:08:32,199 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:32,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:08:32,259 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:32,259 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-02-06 12:08:32,272 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-02-06 12:08:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:32,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:32,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (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_1531))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1532)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:08:32,424 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (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_1531))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1532)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:08:32,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (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~mem54#1.base| v_ArrVal_1535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1531)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1532)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:08:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076659148] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:32,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:32,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-06 12:08:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748401783] [2025-02-06 12:08:32,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:32,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:08:32,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:32,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:08:32,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=540, Unknown=21, NotChecked=150, Total=812 [2025-02-06 12:08:32,448 INFO L87 Difference]: Start difference. First operand 930 states and 1076 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-02-06 12:08:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:34,023 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-06 12:08:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:08:34,023 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-02-06 12:08:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:34,025 INFO L225 Difference]: With dead ends: 932 [2025-02-06 12:08:34,025 INFO L226 Difference]: Without dead ends: 932 [2025-02-06 12:08:34,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=680, Unknown=21, NotChecked=168, Total=992 [2025-02-06 12:08:34,026 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 690 mSDsluCounter, 4601 mSDsCounter, 0 mSdLazyCounter, 3624 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:34,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 5075 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3624 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:08:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-06 12:08:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2025-02-06 12:08:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 700 states have (on average 1.5257142857142858) internal successors, (1068), 922 states have internal predecessors, (1068), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1075 transitions. [2025-02-06 12:08:34,037 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1075 transitions. Word has length 101 [2025-02-06 12:08:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:34,037 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1075 transitions. [2025-02-06 12:08:34,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-02-06 12:08:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1075 transitions. [2025-02-06 12:08:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 12:08:34,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:34,038 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-02-06 12:08:34,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:08:34,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:34,239 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:34,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:34,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1277926854, now seen corresponding path program 1 times [2025-02-06 12:08:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:34,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439071451] [2025-02-06 12:08:34,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:34,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:34,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 12:08:34,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 12:08:34,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:34,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439071451] [2025-02-06 12:08:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439071451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393239611] [2025-02-06 12:08:35,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:35,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:35,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:35,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:35,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:08:35,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 12:08:35,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 12:08:35,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:35,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:35,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 12:08:35,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:35,264 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-02-06 12:08:35,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:08:35,354 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-02-06 12:08:35,370 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-02-06 12:08:35,455 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:35,455 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 31 treesize of output 32 [2025-02-06 12:08:35,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:35,494 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 70 treesize of output 65 [2025-02-06 12:08:35,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2025-02-06 12:08:35,565 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:35,565 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 70 treesize of output 65 [2025-02-06 12:08:35,568 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 51 treesize of output 32 [2025-02-06 12:08:35,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-02-06 12:08:35,630 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 34 treesize of output 16 [2025-02-06 12:08:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:35,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:35,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:08:35,795 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 84 treesize of output 88 [2025-02-06 12:08:35,888 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1695 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1695))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< 0 (+ 9 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (or (forall ((v_ArrVal_1695 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)) (forall ((v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem56#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1696))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1697)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1695 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1695))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1696 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_7) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 9)))))))) is different from false [2025-02-06 12:08:35,913 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 601 treesize of output 559 [2025-02-06 12:08:35,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 375 [2025-02-06 12:08:35,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 367 [2025-02-06 12:08:35,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 359 [2025-02-06 12:08:35,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 351 [2025-02-06 12:08:35,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 351 treesize of output 347 [2025-02-06 12:08:36,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393239611] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:36,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:36,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2025-02-06 12:08:36,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585535783] [2025-02-06 12:08:36,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:36,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:08:36,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:36,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:08:36,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=702, Unknown=8, NotChecked=54, Total=870 [2025-02-06 12:08:36,097 INFO L87 Difference]: Start difference. First operand 929 states and 1075 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 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-02-06 12:08:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:38,439 INFO L93 Difference]: Finished difference Result 931 states and 1079 transitions. [2025-02-06 12:08:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:08:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 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-02-06 12:08:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:38,441 INFO L225 Difference]: With dead ends: 931 [2025-02-06 12:08:38,441 INFO L226 Difference]: Without dead ends: 931 [2025-02-06 12:08:38,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1010, Unknown=8, NotChecked=66, Total=1260 [2025-02-06 12:08:38,442 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 696 mSDsluCounter, 5555 mSDsCounter, 0 mSdLazyCounter, 5049 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 5068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:38,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 6033 Invalid, 5068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5049 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 12:08:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-06 12:08:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 916. [2025-02-06 12:08:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 689 states have (on average 1.5312046444121916) internal successors, (1055), 910 states have internal predecessors, (1055), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:08:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1061 transitions. [2025-02-06 12:08:38,453 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1061 transitions. Word has length 101 [2025-02-06 12:08:38,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:38,453 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1061 transitions. [2025-02-06 12:08:38,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 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-02-06 12:08:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1061 transitions. [2025-02-06 12:08:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 12:08:38,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:38,455 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] [2025-02-06 12:08:38,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:08:38,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-02-06 12:08:38,655 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-02-06 12:08:38,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash -586594624, now seen corresponding path program 1 times [2025-02-06 12:08:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418167860] [2025-02-06 12:08:38,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:38,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 12:08:38,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 12:08:38,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:38,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:39,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:39,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418167860] [2025-02-06 12:08:39,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418167860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:39,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:39,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 12:08:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591061938] [2025-02-06 12:08:39,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:39,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:08:39,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:39,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:08:39,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:08:39,157 INFO L87 Difference]: Start difference. First operand 916 states and 1061 transitions. Second operand has 16 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 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-02-06 12:08:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:40,549 INFO L93 Difference]: Finished difference Result 935 states and 1083 transitions. [2025-02-06 12:08:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:08:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 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 103 [2025-02-06 12:08:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:40,551 INFO L225 Difference]: With dead ends: 935 [2025-02-06 12:08:40,551 INFO L226 Difference]: Without dead ends: 935 [2025-02-06 12:08:40,552 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-02-06 12:08:40,552 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 720 mSDsluCounter, 4168 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 4642 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:40,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 4642 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:08:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-06 12:08:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 931. [2025-02-06 12:08:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 703 states have (on average 1.523470839260313) internal successors, (1071), 924 states have internal predecessors, (1071), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1078 transitions. [2025-02-06 12:08:40,562 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1078 transitions. Word has length 103 [2025-02-06 12:08:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:40,562 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1078 transitions. [2025-02-06 12:08:40,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 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-02-06 12:08:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1078 transitions. [2025-02-06 12:08:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 12:08:40,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:40,564 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] [2025-02-06 12:08:40,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 12:08:40,564 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-02-06 12:08:40,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash -586594623, now seen corresponding path program 1 times [2025-02-06 12:08:40,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:40,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552344505] [2025-02-06 12:08:40,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:40,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:40,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 12:08:40,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 12:08:40,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:40,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552344505] [2025-02-06 12:08:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552344505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:41,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:08:41,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231333508] [2025-02-06 12:08:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:41,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:08:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:41,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:08:41,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:08:41,348 INFO L87 Difference]: Start difference. First operand 931 states and 1078 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 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-02-06 12:08:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:43,291 INFO L93 Difference]: Finished difference Result 934 states and 1082 transitions. [2025-02-06 12:08:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:08:43,292 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 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 103 [2025-02-06 12:08:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:43,293 INFO L225 Difference]: With dead ends: 934 [2025-02-06 12:08:43,293 INFO L226 Difference]: Without dead ends: 934 [2025-02-06 12:08:43,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:08:43,294 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 729 mSDsluCounter, 3901 mSDsCounter, 0 mSdLazyCounter, 4270 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:43,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 4379 Invalid, 4281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4270 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 12:08:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-06 12:08:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 931. [2025-02-06 12:08:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 703 states have (on average 1.5220483641536273) internal successors, (1070), 924 states have internal predecessors, (1070), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1077 transitions. [2025-02-06 12:08:43,301 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1077 transitions. Word has length 103 [2025-02-06 12:08:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:43,301 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1077 transitions. [2025-02-06 12:08:43,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 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-02-06 12:08:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1077 transitions. [2025-02-06 12:08:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 12:08:43,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:43,302 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-02-06 12:08:43,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 12:08:43,302 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-02-06 12:08:43,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 129623832, now seen corresponding path program 1 times [2025-02-06 12:08:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:43,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230124854] [2025-02-06 12:08:43,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:43,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:43,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 12:08:43,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 12:08:43,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230124854] [2025-02-06 12:08:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230124854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849618115] [2025-02-06 12:08:43,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:43,930 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:43,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:08:44,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 12:08:44,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 12:08:44,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:44,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:44,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 12:08:44,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:44,172 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-02-06 12:08:44,252 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:08:44,253 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-02-06 12:08:44,273 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-02-06 12:08:44,330 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-02-06 12:08:44,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:44,426 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-02-06 12:08:44,497 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:44,497 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-02-06 12:08:44,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:44,553 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-02-06 12:08:44,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:44,611 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-02-06 12:08:44,624 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-02-06 12:08:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:44,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:44,735 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (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_2031))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2032)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:08:44,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (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_2031))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2032)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:08:44,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (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_2030))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2031)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2032)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:08:44,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2030))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2031)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2032)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:08:44,780 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (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_2035))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2030)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2031)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2032)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:08:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849618115] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:44,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-02-06 12:08:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535015111] [2025-02-06 12:08:44,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 12:08:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:44,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 12:08:44,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=20, NotChecked=280, Total=1056 [2025-02-06 12:08:44,784 INFO L87 Difference]: Start difference. First operand 931 states and 1077 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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-02-06 12:08:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:46,898 INFO L93 Difference]: Finished difference Result 933 states and 1081 transitions. [2025-02-06 12:08:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:08:46,898 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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 104 [2025-02-06 12:08:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:46,900 INFO L225 Difference]: With dead ends: 933 [2025-02-06 12:08:46,900 INFO L226 Difference]: Without dead ends: 933 [2025-02-06 12:08:46,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=20, NotChecked=310, Total=1260 [2025-02-06 12:08:46,901 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 685 mSDsluCounter, 5985 mSDsCounter, 0 mSdLazyCounter, 4631 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 6458 SdHoareTripleChecker+Invalid, 4646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:46,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 6458 Invalid, 4646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4631 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 12:08:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-06 12:08:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 930. [2025-02-06 12:08:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 703 states have (on average 1.5206258890469417) internal successors, (1069), 923 states have internal predecessors, (1069), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1076 transitions. [2025-02-06 12:08:46,909 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1076 transitions. Word has length 104 [2025-02-06 12:08:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:46,909 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1076 transitions. [2025-02-06 12:08:46,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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-02-06 12:08:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1076 transitions. [2025-02-06 12:08:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 12:08:46,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:46,910 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-02-06 12:08:46,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:08:47,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:47,111 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:47,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash 129623833, now seen corresponding path program 1 times [2025-02-06 12:08:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:47,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841042909] [2025-02-06 12:08:47,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:47,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 12:08:47,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 12:08:47,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:47,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841042909] [2025-02-06 12:08:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841042909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:47,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946828953] [2025-02-06 12:08:47,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:47,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:47,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:47,924 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:47,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:08:48,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 12:08:48,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 12:08:48,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:48,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:48,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 12:08:48,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:48,164 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-02-06 12:08:48,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:08:48,254 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-02-06 12:08:48,258 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-02-06 12:08:48,283 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-02-06 12:08:48,291 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-02-06 12:08:48,356 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-02-06 12:08:48,359 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-02-06 12:08:48,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:48,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:08:48,450 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-02-06 12:08:48,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:48,522 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-02-06 12:08:48,528 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-02-06 12:08:48,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:48,583 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-02-06 12:08:48,587 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-02-06 12:08:48,643 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:48,644 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-02-06 12:08:48,649 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-02-06 12:08:48,660 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-02-06 12:08:48,664 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-02-06 12:08:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:48,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:48,781 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_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2214 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2025-02-06 12:08:48,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2213))) (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_2212) .cse0 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2212) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-02-06 12:08:48,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2211))) (let ((.cse0 (select (select .cse1 |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_2210) .cse0 v_ArrVal_2212) (select (select (store .cse1 .cse0 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2214))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2211))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2213))) (let ((.cse4 (select (select .cse5 |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_2210) .cse3 v_ArrVal_2212) .cse4 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-06 12:08:48,909 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 (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2211))) (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_2210) .cse1 v_ArrVal_2212) (select (select (store .cse2 .cse1 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2214))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2211))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2213))) (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_2210) .cse4 v_ArrVal_2212) .cse5 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2025-02-06 12:08:48,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2220))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2211))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2213))) (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_2221) .cse0 v_ArrVal_2210) .cse1 v_ArrVal_2212) .cse2 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2220))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2211))) (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_2221) .cse7 v_ArrVal_2210) .cse8 v_ArrVal_2212) (select (select (store .cse9 .cse8 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2214))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2025-02-06 12:08:48,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946828953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:48,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:48,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-02-06 12:08:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042882337] [2025-02-06 12:08:48,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:48,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:08:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:48,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:08:48,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=639, Unknown=25, NotChecked=280, Total=1056 [2025-02-06 12:08:48,979 INFO L87 Difference]: Start difference. First operand 930 states and 1076 transitions. Second operand has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 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-02-06 12:08:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:51,280 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-06 12:08:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:08:51,280 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 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 104 [2025-02-06 12:08:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:51,282 INFO L225 Difference]: With dead ends: 932 [2025-02-06 12:08:51,282 INFO L226 Difference]: Without dead ends: 932 [2025-02-06 12:08:51,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1002, Unknown=26, NotChecked=350, Total=1560 [2025-02-06 12:08:51,283 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 692 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 4760 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 4764 SdHoareTripleChecker+Invalid, 4779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:51,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 4764 Invalid, 4779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4760 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 12:08:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-06 12:08:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 914. [2025-02-06 12:08:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 689 states have (on average 1.528301886792453) internal successors, (1053), 908 states have internal predecessors, (1053), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:08:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1059 transitions. [2025-02-06 12:08:51,291 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1059 transitions. Word has length 104 [2025-02-06 12:08:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:51,291 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1059 transitions. [2025-02-06 12:08:51,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 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-02-06 12:08:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1059 transitions. [2025-02-06 12:08:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 12:08:51,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:51,292 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, 1, 1] [2025-02-06 12:08:51,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:08:51,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:51,493 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:51,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash 387606842, now seen corresponding path program 1 times [2025-02-06 12:08:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92689581] [2025-02-06 12:08:51,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:51,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:08:51,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:08:51,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:51,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:52,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:52,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92689581] [2025-02-06 12:08:52,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92689581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:52,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:52,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:08:52,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932966889] [2025-02-06 12:08:52,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:52,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:08:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:52,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:08:52,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:08:52,007 INFO L87 Difference]: Start difference. First operand 914 states and 1059 transitions. Second operand has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 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-02-06 12:08:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:52,934 INFO L93 Difference]: Finished difference Result 937 states and 1085 transitions. [2025-02-06 12:08:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:08:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 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 107 [2025-02-06 12:08:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:52,936 INFO L225 Difference]: With dead ends: 937 [2025-02-06 12:08:52,936 INFO L226 Difference]: Without dead ends: 937 [2025-02-06 12:08:52,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:08:52,937 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 733 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:52,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 2797 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:08:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-06 12:08:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 933. [2025-02-06 12:08:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 707 states have (on average 1.5176803394625178) internal successors, (1073), 926 states have internal predecessors, (1073), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1080 transitions. [2025-02-06 12:08:52,945 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1080 transitions. Word has length 107 [2025-02-06 12:08:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:52,946 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1080 transitions. [2025-02-06 12:08:52,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 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-02-06 12:08:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1080 transitions. [2025-02-06 12:08:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 12:08:52,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:52,947 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, 1, 1] [2025-02-06 12:08:52,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 12:08:52,947 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:52,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash 387606843, now seen corresponding path program 1 times [2025-02-06 12:08:52,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:52,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978578132] [2025-02-06 12:08:52,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:52,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:08:52,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:08:52,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:52,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:53,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978578132] [2025-02-06 12:08:53,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978578132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:53,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:53,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 12:08:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699328854] [2025-02-06 12:08:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:53,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:08:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:53,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:08:53,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 12:08:53,766 INFO L87 Difference]: Start difference. First operand 933 states and 1080 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 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-02-06 12:08:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:55,966 INFO L93 Difference]: Finished difference Result 936 states and 1084 transitions. [2025-02-06 12:08:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:08:55,966 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 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 107 [2025-02-06 12:08:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:55,968 INFO L225 Difference]: With dead ends: 936 [2025-02-06 12:08:55,968 INFO L226 Difference]: Without dead ends: 936 [2025-02-06 12:08:55,969 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-02-06 12:08:55,969 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 717 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 4675 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 4831 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:55,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 4831 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4675 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 12:08:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-02-06 12:08:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 933. [2025-02-06 12:08:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 707 states have (on average 1.5162659123055162) internal successors, (1072), 926 states have internal predecessors, (1072), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:08:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1079 transitions. [2025-02-06 12:08:55,980 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1079 transitions. Word has length 107 [2025-02-06 12:08:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:55,980 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1079 transitions. [2025-02-06 12:08:55,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 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-02-06 12:08:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1079 transitions. [2025-02-06 12:08:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 12:08:55,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:55,981 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, 1, 1, 1] [2025-02-06 12:08:55,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 12:08:55,981 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:08:55,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1028857234, now seen corresponding path program 1 times [2025-02-06 12:08:55,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:55,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755771777] [2025-02-06 12:08:55,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:56,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:08:56,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:08:56,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:56,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:56,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755771777] [2025-02-06 12:08:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755771777] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874265786] [2025-02-06 12:08:56,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:56,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:56,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:56,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:08:56,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:08:56,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:08:56,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:56,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:56,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 12:08:56,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:56,869 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-02-06 12:08:56,953 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:08:56,953 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-02-06 12:08:56,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1