./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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_SFH_test9-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 f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:08:12,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:08:13,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:08:13,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:08:13,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:08:13,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:08:13,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:08:13,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:08:13,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:08:13,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:08:13,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:08:13,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:08:13,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:08:13,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:08:13,098 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:08:13,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:08:13,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:08:13,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:08:13,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:08:13,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:08:13,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:08:13,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:08:13,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:08:13,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:08:13,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:08:13,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:08:13,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:08:13,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:08:13,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:08:13,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:08:13,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:08:13,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:08:13,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:08:13,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:08:13,101 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 -> f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 [2025-02-08 08:08:13,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:08:13,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:08:13,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:08:13,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:08:13,373 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:08:13,375 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_SFH_test9-1.i [2025-02-08 08:08:14,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbe9d3d7b/4bea81b91d954cacb5dd494273bac73a/FLAGaff8de784 [2025-02-08 08:08:15,058 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:08:15,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2025-02-08 08:08:15,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbe9d3d7b/4bea81b91d954cacb5dd494273bac73a/FLAGaff8de784 [2025-02-08 08:08:15,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbe9d3d7b/4bea81b91d954cacb5dd494273bac73a [2025-02-08 08:08:15,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:08:15,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:08:15,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:08:15,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:08:15,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:08:15,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:15,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15, skipping insertion in model container [2025-02-08 08:08:15,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:15,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:08:15,618 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-08 08:08:15,645 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-08 08:08:15,648 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-08 08:08:15,651 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-08 08:08:15,657 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-08 08:08:15,681 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-08 08:08:15,682 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-08 08:08:15,683 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-08 08:08:15,684 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-08 08:08:15,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:08:15,700 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:08:15,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:08:15,879 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:08:15,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15 WrapperNode [2025-02-08 08:08:15,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:08:15,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:08:15,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:08:15,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:08:15,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:15,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,052 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3254 [2025-02-08 08:08:16,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:08:16,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:08:16,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:08:16,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:08:16,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,187 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 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-08 08:08:16,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:08:16,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:08:16,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:08:16,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:08:16,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (1/1) ... [2025-02-08 08:08:16,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:08:16,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:08:16,354 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-08 08:08:16,356 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-08 08:08:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 08:08:16,379 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 08:08:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:08:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:08:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:08:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 08:08:16,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 08:08:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:08:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:08:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:08:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 08:08:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 08:08:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 08:08:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:08:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:08:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:08:16,596 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:08:16,598 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:08:19,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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-08 08:08:19,941 INFO L? ?]: Removed 1536 outVars from TransFormulas that were not future-live. [2025-02-08 08:08:19,941 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:08:20,042 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:08:20,047 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 08:08:20,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:08:20 BoogieIcfgContainer [2025-02-08 08:08:20,047 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:08:20,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:08:20,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:08:20,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:08:20,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:08:15" (1/3) ... [2025-02-08 08:08:20,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a83d5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:08:20, skipping insertion in model container [2025-02-08 08:08:20,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:08:15" (2/3) ... [2025-02-08 08:08:20,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a83d5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:08:20, skipping insertion in model container [2025-02-08 08:08:20,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:08:20" (3/3) ... [2025-02-08 08:08:20,058 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-1.i [2025-02-08 08:08:20,073 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:08:20,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test9-1.i that has 6 procedures, 2083 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-02-08 08:08:20,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:08:20,186 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;@4c49dcb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:08:20,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-02-08 08:08:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 2073 states, 1142 states have (on average 1.998248686514886) internal successors, (2282), 2065 states have internal predecessors, (2282), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-08 08:08:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 08:08:20,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:20,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 08:08:20,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:20,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash 139679, now seen corresponding path program 1 times [2025-02-08 08:08:20,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026438611] [2025-02-08 08:08:20,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:20,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:08:20,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:08:20,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:20,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:20,408 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-08 08:08:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026438611] [2025-02-08 08:08:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026438611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:20,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:20,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:08:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003922594] [2025-02-08 08:08:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:20,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:08:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:20,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:08:20,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:08:20,447 INFO L87 Difference]: Start difference. First operand has 2073 states, 1142 states have (on average 1.998248686514886) internal successors, (2282), 2065 states have internal predecessors, (2282), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 08:08:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:21,801 INFO L93 Difference]: Finished difference Result 2059 states and 3222 transitions. [2025-02-08 08:08:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:08:21,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 08:08:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:21,830 INFO L225 Difference]: With dead ends: 2059 [2025-02-08 08:08:21,831 INFO L226 Difference]: Without dead ends: 2054 [2025-02-08 08:08:21,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:08:21,834 INFO L435 NwaCegarLoop]: 2792 mSDtfsCounter, 2098 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:21,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 2844 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 08:08:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2025-02-08 08:08:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2025-02-08 08:08:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1143 states have (on average 1.9335083114610674) internal successors, (2210), 2047 states have internal predecessors, (2210), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2718 transitions. [2025-02-08 08:08:21,974 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2718 transitions. Word has length 2 [2025-02-08 08:08:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:21,974 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2718 transitions. [2025-02-08 08:08:21,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 08:08:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2718 transitions. [2025-02-08 08:08:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 08:08:21,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:21,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 08:08:21,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:08:21,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:21,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:21,976 INFO L85 PathProgramCache]: Analyzing trace with hash 139680, now seen corresponding path program 1 times [2025-02-08 08:08:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:21,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149310813] [2025-02-08 08:08:21,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:21,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:08:21,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:08:21,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:21,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:22,050 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-08 08:08:22,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149310813] [2025-02-08 08:08:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149310813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:08:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230865224] [2025-02-08 08:08:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:22,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:08:22,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:22,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:08:22,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:08:22,052 INFO L87 Difference]: Start difference. First operand 2054 states and 2718 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 08:08:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:23,247 INFO L93 Difference]: Finished difference Result 2140 states and 2809 transitions. [2025-02-08 08:08:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:08:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 08:08:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:23,257 INFO L225 Difference]: With dead ends: 2140 [2025-02-08 08:08:23,257 INFO L226 Difference]: Without dead ends: 2140 [2025-02-08 08:08:23,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:08:23,260 INFO L435 NwaCegarLoop]: 2425 mSDtfsCounter, 1838 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:23,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 2654 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 08:08:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-02-08 08:08:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2092. [2025-02-08 08:08:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1191 states have (on average 1.9252728799328296) internal successors, (2293), 2085 states have internal predecessors, (2293), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2801 transitions. [2025-02-08 08:08:23,324 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2801 transitions. Word has length 2 [2025-02-08 08:08:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:23,324 INFO L471 AbstractCegarLoop]: Abstraction has 2092 states and 2801 transitions. [2025-02-08 08:08:23,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 08:08:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2801 transitions. [2025-02-08 08:08:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:08:23,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:23,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:23,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:08:23,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:23,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash 85080681, now seen corresponding path program 1 times [2025-02-08 08:08:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:23,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331283231] [2025-02-08 08:08:23,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:23,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:08:23,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:08:23,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:23,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:23,547 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-08 08:08:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331283231] [2025-02-08 08:08:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331283231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:23,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:23,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:08:23,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967508685] [2025-02-08 08:08:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:23,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:08:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:23,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:08:23,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:08:23,550 INFO L87 Difference]: Start difference. First operand 2092 states and 2801 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:25,921 INFO L93 Difference]: Finished difference Result 3403 states and 4689 transitions. [2025-02-08 08:08:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:08:25,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:08:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:25,935 INFO L225 Difference]: With dead ends: 3403 [2025-02-08 08:08:25,936 INFO L226 Difference]: Without dead ends: 3403 [2025-02-08 08:08:25,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:08:25,939 INFO L435 NwaCegarLoop]: 3791 mSDtfsCounter, 6355 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6355 SdHoareTripleChecker+Valid, 6068 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:25,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6355 Valid, 6068 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 08:08:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2025-02-08 08:08:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 2042. [2025-02-08 08:08:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1143 states have (on average 1.9221347331583551) internal successors, (2197), 2035 states have internal predecessors, (2197), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2705 transitions. [2025-02-08 08:08:25,995 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2705 transitions. Word has length 7 [2025-02-08 08:08:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:25,995 INFO L471 AbstractCegarLoop]: Abstraction has 2042 states and 2705 transitions. [2025-02-08 08:08:25,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2705 transitions. [2025-02-08 08:08:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:08:25,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:25,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:08:25,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:25,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1657461931, now seen corresponding path program 1 times [2025-02-08 08:08:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:25,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355518757] [2025-02-08 08:08:25,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:26,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:08:26,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:08:26,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:26,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:26,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-08 08:08:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355518757] [2025-02-08 08:08:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355518757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:26,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:08:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141741934] [2025-02-08 08:08:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:26,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:08:26,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:26,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:08:26,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:08:26,066 INFO L87 Difference]: Start difference. First operand 2042 states and 2705 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:27,213 INFO L93 Difference]: Finished difference Result 3308 states and 4549 transitions. [2025-02-08 08:08:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:08:27,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:08:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:27,227 INFO L225 Difference]: With dead ends: 3308 [2025-02-08 08:08:27,227 INFO L226 Difference]: Without dead ends: 3308 [2025-02-08 08:08:27,227 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-08 08:08:27,228 INFO L435 NwaCegarLoop]: 4074 mSDtfsCounter, 2072 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 5861 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:27,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 5861 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 08:08:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2025-02-08 08:08:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 1995. [2025-02-08 08:08:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1143 states have (on average 1.8810148731408574) internal successors, (2150), 1988 states have internal predecessors, (2150), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2658 transitions. [2025-02-08 08:08:27,301 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2658 transitions. Word has length 8 [2025-02-08 08:08:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:27,301 INFO L471 AbstractCegarLoop]: Abstraction has 1995 states and 2658 transitions. [2025-02-08 08:08:27,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2658 transitions. [2025-02-08 08:08:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:08:27,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:27,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:27,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:08:27,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:27,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1657461930, now seen corresponding path program 1 times [2025-02-08 08:08:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334796558] [2025-02-08 08:08:27,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:27,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:08:27,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:08:27,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:27,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:27,395 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-08 08:08:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334796558] [2025-02-08 08:08:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334796558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:08:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214732576] [2025-02-08 08:08:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:08:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:27,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:08:27,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:08:27,397 INFO L87 Difference]: Start difference. First operand 1995 states and 2658 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:28,469 INFO L93 Difference]: Finished difference Result 3288 states and 4528 transitions. [2025-02-08 08:08:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:08:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:08:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:28,481 INFO L225 Difference]: With dead ends: 3288 [2025-02-08 08:08:28,481 INFO L226 Difference]: Without dead ends: 3288 [2025-02-08 08:08:28,482 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-08 08:08:28,482 INFO L435 NwaCegarLoop]: 4208 mSDtfsCounter, 1863 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 6110 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:28,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 6110 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 08:08:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-02-08 08:08:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 1970. [2025-02-08 08:08:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1143 states have (on average 1.8591426071741033) internal successors, (2125), 1963 states have internal predecessors, (2125), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2633 transitions. [2025-02-08 08:08:28,537 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2633 transitions. Word has length 8 [2025-02-08 08:08:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:28,538 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2633 transitions. [2025-02-08 08:08:28,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2633 transitions. [2025-02-08 08:08:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:08:28,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:28,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:28,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:08:28,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:28,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1148446148, now seen corresponding path program 1 times [2025-02-08 08:08:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439226959] [2025-02-08 08:08:28,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:28,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:08:28,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:08:28,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:28,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:28,620 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-08 08:08:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439226959] [2025-02-08 08:08:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439226959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:28,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:28,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:08:28,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076012843] [2025-02-08 08:08:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:28,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:08:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:28,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:08:28,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:08:28,622 INFO L87 Difference]: Start difference. First operand 1970 states and 2633 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 08:08:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:29,318 INFO L93 Difference]: Finished difference Result 3921 states and 5249 transitions. [2025-02-08 08:08:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:08:29,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-02-08 08:08:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:29,330 INFO L225 Difference]: With dead ends: 3921 [2025-02-08 08:08:29,331 INFO L226 Difference]: Without dead ends: 3921 [2025-02-08 08:08:29,331 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-08 08:08:29,332 INFO L435 NwaCegarLoop]: 2546 mSDtfsCounter, 2096 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 7130 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:29,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 7130 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:08:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2025-02-08 08:08:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 1973. [2025-02-08 08:08:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1146 states have (on average 1.8568935427574171) internal successors, (2128), 1966 states have internal predecessors, (2128), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 2636 transitions. [2025-02-08 08:08:29,380 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 2636 transitions. Word has length 11 [2025-02-08 08:08:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:29,380 INFO L471 AbstractCegarLoop]: Abstraction has 1973 states and 2636 transitions. [2025-02-08 08:08:29,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 08:08:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2636 transitions. [2025-02-08 08:08:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 08:08:29,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:29,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:29,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:08:29,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:29,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash 982767464, now seen corresponding path program 1 times [2025-02-08 08:08:29,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:29,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528192501] [2025-02-08 08:08:29,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:29,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:08:29,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:08:29,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:29,471 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-08 08:08:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528192501] [2025-02-08 08:08:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528192501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:29,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:29,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:08:29,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213030082] [2025-02-08 08:08:29,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:29,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:08:29,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:29,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:08:29,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:08:29,473 INFO L87 Difference]: Start difference. First operand 1973 states and 2636 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:30,675 INFO L93 Difference]: Finished difference Result 1999 states and 2689 transitions. [2025-02-08 08:08:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:08:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 08:08:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:30,680 INFO L225 Difference]: With dead ends: 1999 [2025-02-08 08:08:30,680 INFO L226 Difference]: Without dead ends: 1999 [2025-02-08 08:08:30,680 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-08 08:08:30,681 INFO L435 NwaCegarLoop]: 2181 mSDtfsCounter, 2336 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:30,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2339 Valid, 3744 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 08:08:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2025-02-08 08:08:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1950. [2025-02-08 08:08:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1146 states have (on average 1.8368237347294938) internal successors, (2105), 1943 states have internal predecessors, (2105), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2613 transitions. [2025-02-08 08:08:30,714 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2613 transitions. Word has length 18 [2025-02-08 08:08:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:30,714 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2613 transitions. [2025-02-08 08:08:30,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2613 transitions. [2025-02-08 08:08:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 08:08:30,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:30,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:30,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:08:30,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 982767465, now seen corresponding path program 1 times [2025-02-08 08:08:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:30,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248395589] [2025-02-08 08:08:30,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:30,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:08:30,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:08:30,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:30,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:30,779 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-08 08:08:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:30,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248395589] [2025-02-08 08:08:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248395589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:30,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:08:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248669886] [2025-02-08 08:08:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:08:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:30,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:08:30,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:08:30,781 INFO L87 Difference]: Start difference. First operand 1950 states and 2613 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:30,857 INFO L93 Difference]: Finished difference Result 1875 states and 2510 transitions. [2025-02-08 08:08:30,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:08:30,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 08:08:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:30,864 INFO L225 Difference]: With dead ends: 1875 [2025-02-08 08:08:30,864 INFO L226 Difference]: Without dead ends: 1875 [2025-02-08 08:08:30,864 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-08 08:08:30,865 INFO L435 NwaCegarLoop]: 2456 mSDtfsCounter, 60 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4859 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-08 08:08:30,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 4859 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:08:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-02-08 08:08:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2025-02-08 08:08:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1083 states have (on average 1.8485687903970451) internal successors, (2002), 1868 states have internal predecessors, (2002), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2510 transitions. [2025-02-08 08:08:30,910 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2510 transitions. Word has length 18 [2025-02-08 08:08:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:30,910 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2510 transitions. [2025-02-08 08:08:30,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2510 transitions. [2025-02-08 08:08:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:08:30,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:30,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:30,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:08:30,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:30,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 400899488, now seen corresponding path program 1 times [2025-02-08 08:08:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850795861] [2025-02-08 08:08:30,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:30,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:08:30,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:08:30,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:30,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:30,993 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-08 08:08:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:30,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850795861] [2025-02-08 08:08:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850795861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:08:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922139298] [2025-02-08 08:08:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:30,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:08:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:30,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:08:30,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:08:30,996 INFO L87 Difference]: Start difference. First operand 1875 states and 2510 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:31,133 INFO L93 Difference]: Finished difference Result 1857 states and 2485 transitions. [2025-02-08 08:08:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:08:31,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 08:08:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:31,140 INFO L225 Difference]: With dead ends: 1857 [2025-02-08 08:08:31,141 INFO L226 Difference]: Without dead ends: 1857 [2025-02-08 08:08:31,141 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-08 08:08:31,142 INFO L435 NwaCegarLoop]: 2421 mSDtfsCounter, 41 mSDsluCounter, 4814 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 7235 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-08 08:08:31,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 7235 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:08:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-02-08 08:08:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1854. [2025-02-08 08:08:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1069 states have (on average 1.8465855940130964) internal successors, (1974), 1847 states have internal predecessors, (1974), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2482 transitions. [2025-02-08 08:08:31,182 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2482 transitions. Word has length 19 [2025-02-08 08:08:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:31,183 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2482 transitions. [2025-02-08 08:08:31,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2482 transitions. [2025-02-08 08:08:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 08:08:31,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:31,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:31,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:08:31,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:31,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash -216991242, now seen corresponding path program 1 times [2025-02-08 08:08:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:31,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992927413] [2025-02-08 08:08:31,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:31,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:31,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:08:31,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:08:31,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:31,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:31,406 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-08 08:08:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:31,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992927413] [2025-02-08 08:08:31,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992927413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:31,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:31,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:08:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126120768] [2025-02-08 08:08:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:31,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:08:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:31,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:08:31,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:08:31,408 INFO L87 Difference]: Start difference. First operand 1854 states and 2482 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:32,809 INFO L93 Difference]: Finished difference Result 3217 states and 4449 transitions. [2025-02-08 08:08:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:08:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 08:08:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:32,828 INFO L225 Difference]: With dead ends: 3217 [2025-02-08 08:08:32,829 INFO L226 Difference]: Without dead ends: 3217 [2025-02-08 08:08:32,829 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-08 08:08:32,833 INFO L435 NwaCegarLoop]: 2231 mSDtfsCounter, 1864 mSDsluCounter, 2961 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 5192 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:32,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 5192 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 08:08:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2025-02-08 08:08:32,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 1850. [2025-02-08 08:08:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1069 states have (on average 1.842843779232928) internal successors, (1970), 1843 states have internal predecessors, (1970), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2478 transitions. [2025-02-08 08:08:32,880 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2478 transitions. Word has length 33 [2025-02-08 08:08:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:32,881 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2478 transitions. [2025-02-08 08:08:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2478 transitions. [2025-02-08 08:08:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 08:08:32,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:32,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:32,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:08:32,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -912220857, now seen corresponding path program 1 times [2025-02-08 08:08:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737836938] [2025-02-08 08:08:32,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:32,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 08:08:32,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 08:08:32,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:32,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:33,012 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-08 08:08:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737836938] [2025-02-08 08:08:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737836938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:33,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:08:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898474789] [2025-02-08 08:08:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:33,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:08:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:33,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:08:33,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:08:33,015 INFO L87 Difference]: Start difference. First operand 1850 states and 2478 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:33,140 INFO L93 Difference]: Finished difference Result 1850 states and 2474 transitions. [2025-02-08 08:08:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:08:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-08 08:08:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:33,147 INFO L225 Difference]: With dead ends: 1850 [2025-02-08 08:08:33,147 INFO L226 Difference]: Without dead ends: 1850 [2025-02-08 08:08:33,147 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-08 08:08:33,148 INFO L435 NwaCegarLoop]: 2416 mSDtfsCounter, 21 mSDsluCounter, 4801 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7217 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:33,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7217 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:08:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-02-08 08:08:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1850. [2025-02-08 08:08:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1069 states have (on average 1.8391019644527595) internal successors, (1966), 1843 states have internal predecessors, (1966), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2474 transitions. [2025-02-08 08:08:33,180 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2474 transitions. Word has length 68 [2025-02-08 08:08:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:33,180 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2474 transitions. [2025-02-08 08:08:33,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2474 transitions. [2025-02-08 08:08:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 08:08:33,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:33,183 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] [2025-02-08 08:08:33,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:08:33,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -553459969, now seen corresponding path program 1 times [2025-02-08 08:08:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714416902] [2025-02-08 08:08:33,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:33,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 08:08:33,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 08:08:33,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:33,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:33,347 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-08 08:08:33,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:33,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714416902] [2025-02-08 08:08:33,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714416902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:33,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:33,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:08:33,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187452496] [2025-02-08 08:08:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:33,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:08:33,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:33,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:08:33,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:08:33,349 INFO L87 Difference]: Start difference. First operand 1850 states and 2474 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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-08 08:08:33,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:33,502 INFO L93 Difference]: Finished difference Result 3177 states and 4395 transitions. [2025-02-08 08:08:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:08:33,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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 76 [2025-02-08 08:08:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:33,509 INFO L225 Difference]: With dead ends: 3177 [2025-02-08 08:08:33,509 INFO L226 Difference]: Without dead ends: 3177 [2025-02-08 08:08:33,509 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-08 08:08:33,510 INFO L435 NwaCegarLoop]: 2692 mSDtfsCounter, 1349 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 5077 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:33,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 5077 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:08:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2025-02-08 08:08:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2623. [2025-02-08 08:08:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1842 states have (on average 1.8371335504885993) internal successors, (3384), 2616 states have internal predecessors, (3384), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 3892 transitions. [2025-02-08 08:08:33,550 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 3892 transitions. Word has length 76 [2025-02-08 08:08:33,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:33,551 INFO L471 AbstractCegarLoop]: Abstraction has 2623 states and 3892 transitions. [2025-02-08 08:08:33,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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-08 08:08:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3892 transitions. [2025-02-08 08:08:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 08:08:33,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:33,552 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] [2025-02-08 08:08:33,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:08:33,552 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:33,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:33,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1694433930, now seen corresponding path program 1 times [2025-02-08 08:08:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:33,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345769034] [2025-02-08 08:08:33,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:33,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:33,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 08:08:33,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 08:08:33,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:33,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:33,876 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-08 08:08:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345769034] [2025-02-08 08:08:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345769034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:33,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:33,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:08:33,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135554431] [2025-02-08 08:08:33,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:33,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:08:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:33,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:08:33,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:08:33,880 INFO L87 Difference]: Start difference. First operand 2623 states and 3892 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:34,520 INFO L93 Difference]: Finished difference Result 2622 states and 3891 transitions. [2025-02-08 08:08:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:08:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 08:08:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:34,524 INFO L225 Difference]: With dead ends: 2622 [2025-02-08 08:08:34,524 INFO L226 Difference]: Without dead ends: 2622 [2025-02-08 08:08:34,524 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-08 08:08:34,525 INFO L435 NwaCegarLoop]: 2426 mSDtfsCounter, 2 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8716 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:34,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8716 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:08:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2025-02-08 08:08:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2622. [2025-02-08 08:08:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 1842 states have (on average 1.8365906623235613) internal successors, (3383), 2615 states have internal predecessors, (3383), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3891 transitions. [2025-02-08 08:08:34,559 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3891 transitions. Word has length 84 [2025-02-08 08:08:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:34,559 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 3891 transitions. [2025-02-08 08:08:34,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3891 transitions. [2025-02-08 08:08:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 08:08:34,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:34,561 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] [2025-02-08 08:08:34,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:08:34,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:34,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1694433931, now seen corresponding path program 1 times [2025-02-08 08:08:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684865672] [2025-02-08 08:08:34,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:34,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 08:08:34,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 08:08:34,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:34,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:35,033 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-08 08:08:35,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:35,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684865672] [2025-02-08 08:08:35,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684865672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:35,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:35,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:08:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822520900] [2025-02-08 08:08:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:08:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:35,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:08:35,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:08:35,036 INFO L87 Difference]: Start difference. First operand 2622 states and 3891 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:35,781 INFO L93 Difference]: Finished difference Result 2621 states and 3890 transitions. [2025-02-08 08:08:35,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:08:35,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 08:08:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:35,784 INFO L225 Difference]: With dead ends: 2621 [2025-02-08 08:08:35,784 INFO L226 Difference]: Without dead ends: 2621 [2025-02-08 08:08:35,785 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-08 08:08:35,785 INFO L435 NwaCegarLoop]: 2426 mSDtfsCounter, 1 mSDsluCounter, 6261 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8687 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:35,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8687 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 08:08:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2025-02-08 08:08:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2621. [2025-02-08 08:08:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 1841 states have (on average 1.8370450841933732) internal successors, (3382), 2614 states have internal predecessors, (3382), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 3890 transitions. [2025-02-08 08:08:35,819 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 3890 transitions. Word has length 84 [2025-02-08 08:08:35,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:35,819 INFO L471 AbstractCegarLoop]: Abstraction has 2621 states and 3890 transitions. [2025-02-08 08:08:35,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:08:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 3890 transitions. [2025-02-08 08:08:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 08:08:35,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:35,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:08:35,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:08:35,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:35,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2105894937, now seen corresponding path program 1 times [2025-02-08 08:08:35,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:35,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374305311] [2025-02-08 08:08:35,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:35,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 08:08:35,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 08:08:35,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:35,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:36,061 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-08 08:08:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374305311] [2025-02-08 08:08:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374305311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:08:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156444600] [2025-02-08 08:08:36,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:36,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:08:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:36,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:08:36,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:08:36,063 INFO L87 Difference]: Start difference. First operand 2621 states and 3890 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-08 08:08:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:37,505 INFO L93 Difference]: Finished difference Result 2633 states and 3905 transitions. [2025-02-08 08:08:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:08:37,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2025-02-08 08:08:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:37,515 INFO L225 Difference]: With dead ends: 2633 [2025-02-08 08:08:37,516 INFO L226 Difference]: Without dead ends: 2633 [2025-02-08 08:08:37,517 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-08 08:08:37,518 INFO L435 NwaCegarLoop]: 2413 mSDtfsCounter, 11 mSDsluCounter, 8249 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10662 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:37,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10662 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 08:08:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-02-08 08:08:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2627. [2025-02-08 08:08:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 1846 states have (on average 1.8358613217768147) internal successors, (3389), 2619 states have internal predecessors, (3389), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:08:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3900 transitions. [2025-02-08 08:08:37,562 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3900 transitions. Word has length 92 [2025-02-08 08:08:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:37,562 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 3900 transitions. [2025-02-08 08:08:37,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-08 08:08:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3900 transitions. [2025-02-08 08:08:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 08:08:37,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:37,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] [2025-02-08 08:08:37,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:08:37,564 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:37,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2105894936, now seen corresponding path program 1 times [2025-02-08 08:08:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:37,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590975964] [2025-02-08 08:08:37,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:37,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 08:08:37,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 08:08:37,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:38,079 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-08 08:08:38,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:38,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590975964] [2025-02-08 08:08:38,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590975964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:38,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:38,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:08:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977041459] [2025-02-08 08:08:38,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:38,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:08:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:38,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:08:38,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:08:38,081 INFO L87 Difference]: Start difference. First operand 2627 states and 3900 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-08 08:08:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:39,463 INFO L93 Difference]: Finished difference Result 2627 states and 3899 transitions. [2025-02-08 08:08:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:08:39,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2025-02-08 08:08:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:39,470 INFO L225 Difference]: With dead ends: 2627 [2025-02-08 08:08:39,470 INFO L226 Difference]: Without dead ends: 2627 [2025-02-08 08:08:39,471 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-08 08:08:39,471 INFO L435 NwaCegarLoop]: 2417 mSDtfsCounter, 6 mSDsluCounter, 8046 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10463 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:39,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10463 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 08:08:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2025-02-08 08:08:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2627. [2025-02-08 08:08:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 1846 states have (on average 1.8353196099674973) internal successors, (3388), 2619 states have internal predecessors, (3388), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:08:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3899 transitions. [2025-02-08 08:08:39,504 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3899 transitions. Word has length 92 [2025-02-08 08:08:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:39,504 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 3899 transitions. [2025-02-08 08:08:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-08 08:08:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3899 transitions. [2025-02-08 08:08:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:08:39,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:39,505 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] [2025-02-08 08:08:39,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:08:39,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:39,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1869256120, now seen corresponding path program 1 times [2025-02-08 08:08:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:39,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018968957] [2025-02-08 08:08:39,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:39,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:08:39,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:08:39,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:39,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:39,992 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-08 08:08:39,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:39,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018968957] [2025-02-08 08:08:39,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018968957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:08:39,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004936462] [2025-02-08 08:08:39,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:39,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:08:39,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:08:39,997 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-08 08:08:39,998 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-08 08:08:40,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:08:40,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:08:40,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:40,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:40,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:08:40,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:08:40,356 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:08:40,356 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-08 08:08:40,392 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-08 08:08:40,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 08:08:40,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:08:40,736 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-08 08:08:40,779 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-08 08:08:40,813 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-08 08:08:40,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:08:40,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 08:08:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004936462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:08:40,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:08:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-02-08 08:08:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689097605] [2025-02-08 08:08:40,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:08:40,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:08:40,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:40,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:08:40,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-02-08 08:08:40,852 INFO L87 Difference]: Start difference. First operand 2627 states and 3899 transitions. Second operand has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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-08 08:08:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:45,127 INFO L93 Difference]: Finished difference Result 2634 states and 3906 transitions. [2025-02-08 08:08:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:08:45,127 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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 93 [2025-02-08 08:08:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:45,131 INFO L225 Difference]: With dead ends: 2634 [2025-02-08 08:08:45,131 INFO L226 Difference]: Without dead ends: 2634 [2025-02-08 08:08:45,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-02-08 08:08:45,132 INFO L435 NwaCegarLoop]: 2081 mSDtfsCounter, 1874 mSDsluCounter, 19236 mSDsCounter, 0 mSdLazyCounter, 8191 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 21317 SdHoareTripleChecker+Invalid, 8709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 8191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:45,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 21317 Invalid, 8709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [518 Valid, 8191 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 08:08:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-08 08:08:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2631. [2025-02-08 08:08:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 1850 states have (on average 1.8335135135135134) internal successors, (3392), 2622 states have internal predecessors, (3392), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:08:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3901 transitions. [2025-02-08 08:08:45,166 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3901 transitions. Word has length 93 [2025-02-08 08:08:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:45,167 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3901 transitions. [2025-02-08 08:08:45,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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-08 08:08:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3901 transitions. [2025-02-08 08:08:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:08:45,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:45,168 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] [2025-02-08 08:08:45,178 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-08 08:08:45,368 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,SelfDestructingSolverStorable16 [2025-02-08 08:08:45,369 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:45,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1869256121, now seen corresponding path program 1 times [2025-02-08 08:08:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35760655] [2025-02-08 08:08:45,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:45,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:08:45,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:08:45,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:45,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:46,078 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-08 08:08:46,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35760655] [2025-02-08 08:08:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35760655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:08:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845366111] [2025-02-08 08:08:46,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:46,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:08:46,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:08:46,083 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-08 08:08:46,085 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-08 08:08:46,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:08:46,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:08:46,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:46,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:46,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 08:08:46,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:08:46,402 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-08 08:08:46,410 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:08:46,411 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-08 08:08:46,441 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-08 08:08:46,445 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-08 08:08:46,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 08:08:46,538 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-08 08:08:46,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:08:46,657 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-08 08:08:46,664 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-08 08:08:46,705 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-08 08:08:46,713 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-08 08:08:46,733 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-08 08:08:46,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:08:46,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_737 (Array Int Int)) (v_ArrVal_738 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_737) |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_738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_737 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 08:08:46,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845366111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:08:46,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:08:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-02-08 08:08:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125007058] [2025-02-08 08:08:46,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:08:46,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:08:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:46,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:08:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-02-08 08:08:46,839 INFO L87 Difference]: Start difference. First operand 2631 states and 3901 transitions. Second operand has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 18 states have internal predecessors, (118), 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-08 08:08:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:50,675 INFO L93 Difference]: Finished difference Result 2633 states and 3905 transitions. [2025-02-08 08:08:50,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:08:50,676 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 18 states have internal predecessors, (118), 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 93 [2025-02-08 08:08:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:50,680 INFO L225 Difference]: With dead ends: 2633 [2025-02-08 08:08:50,681 INFO L226 Difference]: Without dead ends: 2633 [2025-02-08 08:08:50,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-02-08 08:08:50,681 INFO L435 NwaCegarLoop]: 2084 mSDtfsCounter, 1896 mSDsluCounter, 18319 mSDsCounter, 0 mSdLazyCounter, 6609 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 20403 SdHoareTripleChecker+Invalid, 7633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 6609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:50,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 20403 Invalid, 7633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 6609 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-08 08:08:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-02-08 08:08:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2624. [2025-02-08 08:08:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 1845 states have (on average 1.834688346883469) internal successors, (3385), 2616 states have internal predecessors, (3385), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:08:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3893 transitions. [2025-02-08 08:08:50,719 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3893 transitions. Word has length 93 [2025-02-08 08:08:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:50,719 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 3893 transitions. [2025-02-08 08:08:50,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 18 states have internal predecessors, (118), 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-08 08:08:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3893 transitions. [2025-02-08 08:08:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 08:08:50,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:50,720 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-08 08:08:50,730 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-08 08:08:50,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:08:50,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:50,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash -124918782, now seen corresponding path program 1 times [2025-02-08 08:08:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:50,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343475800] [2025-02-08 08:08:50,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:50,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 08:08:50,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 08:08:50,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:50,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:51,406 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-08 08:08:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343475800] [2025-02-08 08:08:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343475800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:08:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710709030] [2025-02-08 08:08:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:51,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:08:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:51,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:08:51,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:08:51,409 INFO L87 Difference]: Start difference. First operand 2624 states and 3893 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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-08 08:08:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:53,772 INFO L93 Difference]: Finished difference Result 2637 states and 3909 transitions. [2025-02-08 08:08:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:08:53,772 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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 95 [2025-02-08 08:08:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:53,776 INFO L225 Difference]: With dead ends: 2637 [2025-02-08 08:08:53,776 INFO L226 Difference]: Without dead ends: 2637 [2025-02-08 08:08:53,777 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-08 08:08:53,777 INFO L435 NwaCegarLoop]: 2081 mSDtfsCounter, 1884 mSDsluCounter, 12989 mSDsCounter, 0 mSdLazyCounter, 5139 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 15070 SdHoareTripleChecker+Invalid, 5653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 5139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:53,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 15070 Invalid, 5653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 5139 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 08:08:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-02-08 08:08:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2633. [2025-02-08 08:08:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1853 states have (on average 1.832164058283864) internal successors, (3395), 2624 states have internal predecessors, (3395), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:08:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3904 transitions. [2025-02-08 08:08:53,809 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3904 transitions. Word has length 95 [2025-02-08 08:08:53,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:53,809 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3904 transitions. [2025-02-08 08:08:53,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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-08 08:08:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3904 transitions. [2025-02-08 08:08:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 08:08:53,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:53,811 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-08 08:08:53,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:08:53,811 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:53,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash -124918781, now seen corresponding path program 1 times [2025-02-08 08:08:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:53,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994580540] [2025-02-08 08:08:53,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:53,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:53,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 08:08:53,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 08:08:53,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:53,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:54,429 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-08 08:08:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994580540] [2025-02-08 08:08:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994580540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:08:54,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:08:54,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:08:54,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523365481] [2025-02-08 08:08:54,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:08:54,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:08:54,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:54,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:08:54,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:08:54,433 INFO L87 Difference]: Start difference. First operand 2633 states and 3904 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 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-08 08:08:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:08:56,488 INFO L93 Difference]: Finished difference Result 2636 states and 3908 transitions. [2025-02-08 08:08:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:08:56,488 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 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 95 [2025-02-08 08:08:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:08:56,496 INFO L225 Difference]: With dead ends: 2636 [2025-02-08 08:08:56,496 INFO L226 Difference]: Without dead ends: 2636 [2025-02-08 08:08:56,497 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-08 08:08:56,497 INFO L435 NwaCegarLoop]: 2085 mSDtfsCounter, 1894 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 13515 SdHoareTripleChecker+Invalid, 4230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 08:08:56,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 13515 Invalid, 4230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 08:08:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-08 08:08:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2633. [2025-02-08 08:08:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1853 states have (on average 1.8316243928764167) internal successors, (3394), 2624 states have internal predecessors, (3394), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:08:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3903 transitions. [2025-02-08 08:08:56,526 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3903 transitions. Word has length 95 [2025-02-08 08:08:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:08:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3903 transitions. [2025-02-08 08:08:56,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 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-08 08:08:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3903 transitions. [2025-02-08 08:08:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 08:08:56,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:08:56,528 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] [2025-02-08 08:08:56,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:08:56,528 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:08:56,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:08:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1533032303, now seen corresponding path program 1 times [2025-02-08 08:08:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:08:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259680687] [2025-02-08 08:08:56,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:08:56,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:08:56,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:08:56,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:56,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:57,023 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-08 08:08:57,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:08:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259680687] [2025-02-08 08:08:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259680687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:08:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370732132] [2025-02-08 08:08:57,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:08:57,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:08:57,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:08:57,026 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-08 08:08:57,028 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-08 08:08:57,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:08:57,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:08:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:08:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:08:57,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 08:08:57,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:08:57,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 6 treesize of output 5 [2025-02-08 08:08:57,469 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:08:57,469 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-08 08:08:57,499 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-08 08:08:57,580 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-08 08:08:57,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:08:57,714 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-08 08:08:57,805 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:08:57,805 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-08 08:08:57,828 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-08 08:08:57,857 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-08 08:08:57,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:08:57,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-08 08:08:57,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1022 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1022))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1019)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:08:57,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370732132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:08:57,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:08:57,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-08 08:08:57,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633101146] [2025-02-08 08:08:57,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:08:57,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 08:08:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:08:57,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 08:08:57,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=424, Unknown=12, NotChecked=86, Total=600 [2025-02-08 08:08:57,938 INFO L87 Difference]: Start difference. First operand 2633 states and 3903 transitions. Second operand has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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-08 08:09:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:09:02,673 INFO L93 Difference]: Finished difference Result 2635 states and 3907 transitions. [2025-02-08 08:09:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:09:02,674 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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 96 [2025-02-08 08:09:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:09:02,681 INFO L225 Difference]: With dead ends: 2635 [2025-02-08 08:09:02,681 INFO L226 Difference]: Without dead ends: 2635 [2025-02-08 08:09:02,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=547, Unknown=12, NotChecked=98, Total=756 [2025-02-08 08:09:02,682 INFO L435 NwaCegarLoop]: 2080 mSDtfsCounter, 1863 mSDsluCounter, 20294 mSDsCounter, 0 mSdLazyCounter, 9593 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 22374 SdHoareTripleChecker+Invalid, 10109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 9593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:09:02,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1867 Valid, 22374 Invalid, 10109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 9593 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-08 08:09:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-02-08 08:09:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2632. [2025-02-08 08:09:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 1853 states have (on average 1.8310847274689692) internal successors, (3393), 2623 states have internal predecessors, (3393), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:09:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3902 transitions. [2025-02-08 08:09:02,729 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3902 transitions. Word has length 96 [2025-02-08 08:09:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:09:02,730 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 3902 transitions. [2025-02-08 08:09:02,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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-08 08:09:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3902 transitions. [2025-02-08 08:09:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 08:09:02,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:09:02,731 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] [2025-02-08 08:09:02,744 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-08 08:09:02,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:09:02,936 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:09:02,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:09:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1533032302, now seen corresponding path program 1 times [2025-02-08 08:09:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:09:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691996382] [2025-02-08 08:09:02,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:09:02,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:09:02,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:09:02,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:02,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:09:03,627 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-08 08:09:03,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:09:03,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691996382] [2025-02-08 08:09:03,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691996382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:09:03,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32320891] [2025-02-08 08:09:03,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:03,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:09:03,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:09:03,630 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-08 08:09:03,632 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-08 08:09:03,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:09:03,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:09:03,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:03,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:09:03,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 08:09:03,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:09:03,854 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-08 08:09:03,957 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-08 08:09:03,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:09:03,966 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-08 08:09:03,991 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-08 08:09:03,995 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-08 08:09:04,059 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-08 08:09:04,065 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-08 08:09:04,149 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:09:04,150 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-08 08:09:04,154 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-08 08:09:04,221 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:09:04,222 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-08 08:09:04,228 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-08 08:09:04,242 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-08 08:09:04,246 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-08 08:09:04,284 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-08 08:09:04,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:09:04,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1173) |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_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 08:09:04,421 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_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-02-08 08:09:04,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1180) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1179))) (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_1180) .cse1 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 08:09:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32320891] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:09:04,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:09:04,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-08 08:09:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148197147] [2025-02-08 08:09:04,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:09:04,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:09:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:09:04,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:09:04,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2025-02-08 08:09:04,478 INFO L87 Difference]: Start difference. First operand 2632 states and 3902 transitions. Second operand has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 states have internal predecessors, (152), 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-08 08:09:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:09:07,206 INFO L93 Difference]: Finished difference Result 2634 states and 3906 transitions. [2025-02-08 08:09:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:09:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 states have internal predecessors, (152), 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 96 [2025-02-08 08:09:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:09:07,212 INFO L225 Difference]: With dead ends: 2634 [2025-02-08 08:09:07,212 INFO L226 Difference]: Without dead ends: 2634 [2025-02-08 08:09:07,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2025-02-08 08:09:07,215 INFO L435 NwaCegarLoop]: 2083 mSDtfsCounter, 1869 mSDsluCounter, 13384 mSDsCounter, 0 mSdLazyCounter, 4744 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 15467 SdHoareTripleChecker+Invalid, 5766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 4744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:09:07,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 15467 Invalid, 5766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1022 Valid, 4744 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 08:09:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-08 08:09:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2622. [2025-02-08 08:09:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 1845 states have (on average 1.8336043360433605) internal successors, (3383), 2614 states have internal predecessors, (3383), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:09:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3891 transitions. [2025-02-08 08:09:07,247 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3891 transitions. Word has length 96 [2025-02-08 08:09:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:09:07,248 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 3891 transitions. [2025-02-08 08:09:07,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 states have internal predecessors, (152), 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-08 08:09:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3891 transitions. [2025-02-08 08:09:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 08:09:07,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:09:07,249 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-08 08:09:07,259 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-08 08:09:07,450 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,SelfDestructingSolverStorable21 [2025-02-08 08:09:07,450 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:09:07,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:09:07,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2009906464, now seen corresponding path program 1 times [2025-02-08 08:09:07,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:09:07,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709144326] [2025-02-08 08:09:07,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:07,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:09:07,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 08:09:07,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 08:09:07,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:07,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:09:07,859 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-08 08:09:07,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:09:07,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709144326] [2025-02-08 08:09:07,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709144326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:09:07,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:09:07,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:09:07,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321434843] [2025-02-08 08:09:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:09:07,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:09:07,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:09:07,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:09:07,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:09:07,862 INFO L87 Difference]: Start difference. First operand 2622 states and 3891 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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-08 08:09:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:09:10,527 INFO L93 Difference]: Finished difference Result 2638 states and 3910 transitions. [2025-02-08 08:09:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:09:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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 98 [2025-02-08 08:09:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:09:10,530 INFO L225 Difference]: With dead ends: 2638 [2025-02-08 08:09:10,530 INFO L226 Difference]: Without dead ends: 2638 [2025-02-08 08:09:10,530 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-08 08:09:10,531 INFO L435 NwaCegarLoop]: 2083 mSDtfsCounter, 1880 mSDsluCounter, 16604 mSDsCounter, 0 mSdLazyCounter, 5883 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 18687 SdHoareTripleChecker+Invalid, 6395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 5883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:09:10,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 18687 Invalid, 6395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 5883 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 08:09:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2025-02-08 08:09:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2634. [2025-02-08 08:09:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 1856 states have (on average 1.8297413793103448) internal successors, (3396), 2625 states have internal predecessors, (3396), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:09:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3905 transitions. [2025-02-08 08:09:10,560 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3905 transitions. Word has length 98 [2025-02-08 08:09:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:09:10,561 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3905 transitions. [2025-02-08 08:09:10,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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-08 08:09:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3905 transitions. [2025-02-08 08:09:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 08:09:10,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:09:10,561 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-08 08:09:10,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:09:10,562 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:09:10,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:09:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2009906463, now seen corresponding path program 1 times [2025-02-08 08:09:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:09:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433711623] [2025-02-08 08:09:10,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:09:10,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 08:09:10,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 08:09:10,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:10,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:09:11,237 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-08 08:09:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:09:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433711623] [2025-02-08 08:09:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433711623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:09:11,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:09:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:09:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024570234] [2025-02-08 08:09:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:09:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:09:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:09:11,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:09:11,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:09:11,239 INFO L87 Difference]: Start difference. First operand 2634 states and 3905 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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-08 08:09:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:09:13,712 INFO L93 Difference]: Finished difference Result 2637 states and 3909 transitions. [2025-02-08 08:09:13,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:09:13,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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 98 [2025-02-08 08:09:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:09:13,716 INFO L225 Difference]: With dead ends: 2637 [2025-02-08 08:09:13,716 INFO L226 Difference]: Without dead ends: 2637 [2025-02-08 08:09:13,716 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-08 08:09:13,716 INFO L435 NwaCegarLoop]: 2084 mSDtfsCounter, 1894 mSDsluCounter, 15325 mSDsCounter, 0 mSdLazyCounter, 4725 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 17409 SdHoareTripleChecker+Invalid, 5237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 4725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:09:13,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 17409 Invalid, 5237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 4725 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 08:09:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-02-08 08:09:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2634. [2025-02-08 08:09:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 1856 states have (on average 1.8292025862068966) internal successors, (3395), 2625 states have internal predecessors, (3395), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:09:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3904 transitions. [2025-02-08 08:09:13,748 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3904 transitions. Word has length 98 [2025-02-08 08:09:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:09:13,748 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3904 transitions. [2025-02-08 08:09:13,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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-08 08:09:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3904 transitions. [2025-02-08 08:09:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 08:09:13,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:09:13,750 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] [2025-02-08 08:09:13,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 08:09:13,750 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:09:13,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:09:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2120736753, now seen corresponding path program 1 times [2025-02-08 08:09:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:09:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294525865] [2025-02-08 08:09:13,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:09:13,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:09:13,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:09:13,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:13,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:09:14,301 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-08 08:09:14,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:09:14,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294525865] [2025-02-08 08:09:14,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294525865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:09:14,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74015601] [2025-02-08 08:09:14,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:14,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:09:14,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:09:14,304 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-08 08:09:14,307 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-08 08:09:14,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:09:14,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:09:14,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:14,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:09:14,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 08:09:14,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:09:14,553 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-08 08:09:14,659 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:09:14,659 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-08 08:09:14,693 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-08 08:09:14,768 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-08 08:09:14,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:09:14,896 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-08 08:09:14,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:09:14,980 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-08 08:09:15,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:09:15,033 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-08 08:09:15,047 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-08 08:09:15,087 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-08 08:09:15,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:09:15,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1485 (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_1485))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1486)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:09:15,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1485 (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_1489))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1485)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1486)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:09:15,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74015601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:09:15,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:09:15,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-08 08:09:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219200916] [2025-02-08 08:09:15,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:09:15,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 08:09:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:09:15,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 08:09:15,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=580, Unknown=23, NotChecked=102, Total=812 [2025-02-08 08:09:15,243 INFO L87 Difference]: Start difference. First operand 2634 states and 3904 transitions. Second operand has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 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-08 08:09:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:09:19,881 INFO L93 Difference]: Finished difference Result 2636 states and 3908 transitions. [2025-02-08 08:09:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:09:19,881 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 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 99 [2025-02-08 08:09:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:09:19,884 INFO L225 Difference]: With dead ends: 2636 [2025-02-08 08:09:19,884 INFO L226 Difference]: Without dead ends: 2636 [2025-02-08 08:09:19,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=725, Unknown=23, NotChecked=114, Total=992 [2025-02-08 08:09:19,885 INFO L435 NwaCegarLoop]: 2079 mSDtfsCounter, 1852 mSDsluCounter, 20815 mSDsCounter, 0 mSdLazyCounter, 9076 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 22894 SdHoareTripleChecker+Invalid, 9591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 9076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:09:19,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 22894 Invalid, 9591 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 9076 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 08:09:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-08 08:09:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2633. [2025-02-08 08:09:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1856 states have (on average 1.8286637931034482) internal successors, (3394), 2624 states have internal predecessors, (3394), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:09:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3903 transitions. [2025-02-08 08:09:19,913 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3903 transitions. Word has length 99 [2025-02-08 08:09:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:09:19,914 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3903 transitions. [2025-02-08 08:09:19,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 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-08 08:09:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3903 transitions. [2025-02-08 08:09:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 08:09:19,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:09:19,917 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] [2025-02-08 08:09:19,929 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-08 08:09:20,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 08:09:20,118 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:09:20,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:09:20,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2120736754, now seen corresponding path program 1 times [2025-02-08 08:09:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:09:20,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614161162] [2025-02-08 08:09:20,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:20,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:09:20,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:09:20,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:09:20,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:09:20,905 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-08 08:09:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:09:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614161162] [2025-02-08 08:09:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614161162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:09:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723246722] [2025-02-08 08:09:20,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:20,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:09:20,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:09:20,909 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-08 08:09:20,911 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-08 08:09:21,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:09:21,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:09:21,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:21,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:09:21,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 08:09:21,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:09:21,161 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-08 08:09:21,246 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-08 08:09:21,252 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:09:21,252 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-08 08:09:21,278 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-08 08:09:21,285 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-08 08:09:21,357 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-08 08:09:21,361 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-08 08:09:21,437 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:09:21,437 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-08 08:09:21,443 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-08 08:09:21,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:09:21,504 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-08 08:09:21,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 08:09:21,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:09:21,554 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-08 08:09:21,557 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-08 08:09:21,569 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-08 08:09:21,572 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-08 08:09:21,587 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-08 08:09:21,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:09:21,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1655 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 08:09:21,646 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_1655 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 08:09:21,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1652) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1653))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1652) .cse1 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 08:09:21,675 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_1655 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1652) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1653) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1653))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1652) .cse2 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-08 08:09:21,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1660))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1653))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1661) .cse0 v_ArrVal_1652) .cse1 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1660))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1661) .cse5 v_ArrVal_1652) (select (select (store .cse6 .cse5 v_ArrVal_1653) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1655))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-02-08 08:09:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723246722] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:09:21,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:09:21,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-02-08 08:09:21,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17608639] [2025-02-08 08:09:21,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:09:21,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 08:09:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:09:21,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 08:09:21,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=480, Unknown=5, NotChecked=240, Total=812 [2025-02-08 08:09:21,743 INFO L87 Difference]: Start difference. First operand 2633 states and 3903 transitions. Second operand has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 states have internal predecessors, (158), 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-08 08:09:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:09:25,871 INFO L93 Difference]: Finished difference Result 2635 states and 3907 transitions. [2025-02-08 08:09:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:09:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 states have internal predecessors, (158), 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 99 [2025-02-08 08:09:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:09:25,874 INFO L225 Difference]: With dead ends: 2635 [2025-02-08 08:09:25,874 INFO L226 Difference]: Without dead ends: 2635 [2025-02-08 08:09:25,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=745, Unknown=5, NotChecked=300, Total=1190 [2025-02-08 08:09:25,875 INFO L435 NwaCegarLoop]: 2082 mSDtfsCounter, 1866 mSDsluCounter, 26596 mSDsCounter, 0 mSdLazyCounter, 8084 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 28678 SdHoareTripleChecker+Invalid, 9106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 8084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-08 08:09:25,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1870 Valid, 28678 Invalid, 9106 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1022 Valid, 8084 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-08 08:09:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-02-08 08:09:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2620. [2025-02-08 08:09:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 1845 states have (on average 1.832520325203252) internal successors, (3381), 2612 states have internal predecessors, (3381), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:09:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 3889 transitions. [2025-02-08 08:09:25,896 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 3889 transitions. Word has length 99 [2025-02-08 08:09:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:09:25,896 INFO L471 AbstractCegarLoop]: Abstraction has 2620 states and 3889 transitions. [2025-02-08 08:09:25,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 states have internal predecessors, (158), 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-08 08:09:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 3889 transitions. [2025-02-08 08:09:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 08:09:25,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:09:25,898 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-08 08:09:25,907 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-08 08:09:26,102 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,SelfDestructingSolverStorable25 [2025-02-08 08:09:26,102 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:09:26,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:09:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash -980552677, now seen corresponding path program 1 times [2025-02-08 08:09:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:09:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573510249] [2025-02-08 08:09:26,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:09:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:09:26,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 08:09:26,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 08:09:26,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:09:26,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat