./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 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_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:02:43,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:02:43,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 22:02:43,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:02:43,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:02:43,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:02:43,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:02:43,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:02:43,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:02:43,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:02:43,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:02:43,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:02:43,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:02:43,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:02:43,259 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:02:43,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:02:43,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 22:02:43,259 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:02:43,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:02:43,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:02:43,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 22:02:43,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:02:43,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:02:43,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:02:43,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:02:43,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:02:43,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:02:43,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:02:43,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:02:43,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:02:43,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:02:43,262 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-memcleanup) ) 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 -> 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 [2025-01-09 22:02:43,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:02:43,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:02:43,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:02:43,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:02:43,585 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:02:43,587 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_test2-1.i [2025-01-09 22:02:44,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/897ff7838/c92b002140ed4e2b84ad0b5064176cff/FLAGda1344e4c [2025-01-09 22:02:45,340 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:02:45,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2025-01-09 22:02:45,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/897ff7838/c92b002140ed4e2b84ad0b5064176cff/FLAGda1344e4c [2025-01-09 22:02:45,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/897ff7838/c92b002140ed4e2b84ad0b5064176cff [2025-01-09 22:02:45,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:02:45,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:02:45,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:02:45,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:02:45,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:02:45,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:02:45" (1/1) ... [2025-01-09 22:02:45,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235e7df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:45, skipping insertion in model container [2025-01-09 22:02:45,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:02:45" (1/1) ... [2025-01-09 22:02:45,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:02:45,771 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,811 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,816 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,821 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,832 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,864 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,865 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,867 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,867 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:02:45,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:02:45,892 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:02:46,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:02:46,061 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:02:46,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46 WrapperNode [2025-01-09 22:02:46,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:02:46,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:02:46,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:02:46,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:02:46,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,165 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-01-09 22:02:46,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:02:46,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:02:46,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:02:46,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:02:46,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,241 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [34, 2, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [4, 0, 42]. [2025-01-09 22:02:46,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:02:46,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:02:46,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:02:46,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:02:46,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (1/1) ... [2025-01-09 22:02:46,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:02:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:02:46,358 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-01-09 22:02:46,362 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-01-09 22:02:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 22:02:46,390 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 22:02:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 22:02:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 22:02:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 22:02:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 22:02:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 22:02:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 22:02:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:02:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:02:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:02:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:02:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:02:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:02:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:02:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:02:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 22:02:46,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:02:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:02:46,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:02:46,627 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:02:46,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:02:48,237 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-01-09 22:02:48,238 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:02:48,262 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:02:48,266 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 22:02:48,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:02:48 BoogieIcfgContainer [2025-01-09 22:02:48,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:02:48,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:02:48,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:02:48,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:02:48,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:02:45" (1/3) ... [2025-01-09 22:02:48,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b50676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:02:48, skipping insertion in model container [2025-01-09 22:02:48,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:46" (2/3) ... [2025-01-09 22:02:48,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b50676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:02:48, skipping insertion in model container [2025-01-09 22:02:48,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:02:48" (3/3) ... [2025-01-09 22:02:48,276 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-1.i [2025-01-09 22:02:48,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:02:48,291 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test2-1.i that has 6 procedures, 392 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-01-09 22:02:48,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:02:48,357 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;@5a8254c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:02:48,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 22:02:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 368 states have (on average 1.6141304347826086) internal successors, (594), 377 states have internal predecessors, (594), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:02:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:02:48,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:48,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:02:48,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:48,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1579356390, now seen corresponding path program 1 times [2025-01-09 22:02:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496198175] [2025-01-09 22:02:48,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:48,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:02:48,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:02:48,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:48,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:02:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:48,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496198175] [2025-01-09 22:02:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496198175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:02:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936195645] [2025-01-09 22:02:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:48,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:02:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:48,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:02:48,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:02:48,568 INFO L87 Difference]: Start difference. First operand has 384 states, 368 states have (on average 1.6141304347826086) internal successors, (594), 377 states have internal predecessors, (594), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:02:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:48,620 INFO L93 Difference]: Finished difference Result 382 states and 555 transitions. [2025-01-09 22:02:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:02:48,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:02:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:48,636 INFO L225 Difference]: With dead ends: 382 [2025-01-09 22:02:48,637 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 22:02:48,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:02:48,642 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:48,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:02:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 22:02:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-01-09 22:02:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 366 states have (on average 1.4617486338797814) internal successors, (535), 373 states have internal predecessors, (535), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:02:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 553 transitions. [2025-01-09 22:02:48,720 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 553 transitions. Word has length 7 [2025-01-09 22:02:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:48,720 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 553 transitions. [2025-01-09 22:02:48,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:02:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 553 transitions. [2025-01-09 22:02:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:02:48,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:48,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:02:48,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:02:48,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:48,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash -877250352, now seen corresponding path program 1 times [2025-01-09 22:02:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:48,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35089446] [2025-01-09 22:02:48,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:48,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:02:48,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:02:48,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:48,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:02:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35089446] [2025-01-09 22:02:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35089446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:48,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:02:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187314667] [2025-01-09 22:02:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:48,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:02:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:48,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:02:48,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:02:48,942 INFO L87 Difference]: Start difference. First operand 380 states and 553 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:02:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:49,133 INFO L93 Difference]: Finished difference Result 743 states and 1090 transitions. [2025-01-09 22:02:49,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:02:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:02:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:49,143 INFO L225 Difference]: With dead ends: 743 [2025-01-09 22:02:49,143 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 22:02:49,143 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-01-09 22:02:49,144 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 517 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:49,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1591 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:02:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 22:02:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 382. [2025-01-09 22:02:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 368 states have (on average 1.4592391304347827) internal successors, (537), 375 states have internal predecessors, (537), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:02:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 555 transitions. [2025-01-09 22:02:49,183 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 555 transitions. Word has length 9 [2025-01-09 22:02:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:49,183 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 555 transitions. [2025-01-09 22:02:49,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:02:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 555 transitions. [2025-01-09 22:02:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 22:02:49,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:49,186 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:49,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:02:49,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:49,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1909968268, now seen corresponding path program 1 times [2025-01-09 22:02:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:49,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071805592] [2025-01-09 22:02:49,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:49,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:49,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 22:02:49,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 22:02:49,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:49,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:02:49,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071805592] [2025-01-09 22:02:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071805592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:49,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:02:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695582662] [2025-01-09 22:02:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:49,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:02:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:49,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:02:49,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:02:49,631 INFO L87 Difference]: Start difference. First operand 382 states and 555 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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-01-09 22:02:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:49,728 INFO L93 Difference]: Finished difference Result 340 states and 478 transitions. [2025-01-09 22:02:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:02:49,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-01-09 22:02:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:49,730 INFO L225 Difference]: With dead ends: 340 [2025-01-09 22:02:49,731 INFO L226 Difference]: Without dead ends: 340 [2025-01-09 22:02:49,731 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-01-09 22:02:49,731 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 30 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:49,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1337 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:02:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-09 22:02:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-01-09 22:02:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 326 states have (on average 1.4110429447852761) internal successors, (460), 333 states have internal predecessors, (460), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:02:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 478 transitions. [2025-01-09 22:02:49,750 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 478 transitions. Word has length 85 [2025-01-09 22:02:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:49,750 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 478 transitions. [2025-01-09 22:02:49,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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-01-09 22:02:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 478 transitions. [2025-01-09 22:02:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 22:02:49,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:49,757 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:49,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:02:49,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:49,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash 380494336, now seen corresponding path program 1 times [2025-01-09 22:02:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221784844] [2025-01-09 22:02:49,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:49,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 22:02:49,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 22:02:49,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:49,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:02:50,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:50,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221784844] [2025-01-09 22:02:50,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221784844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:50,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:50,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:02:50,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116730747] [2025-01-09 22:02:50,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:50,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:02:50,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:50,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:02:50,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:02:50,011 INFO L87 Difference]: Start difference. First operand 340 states and 478 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-01-09 22:02:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:50,075 INFO L93 Difference]: Finished difference Result 576 states and 822 transitions. [2025-01-09 22:02:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:02:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-01-09 22:02:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:50,079 INFO L225 Difference]: With dead ends: 576 [2025-01-09 22:02:50,079 INFO L226 Difference]: Without dead ends: 576 [2025-01-09 22:02:50,079 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-01-09 22:02:50,080 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 272 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:50,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1122 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:02:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-01-09 22:02:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 572. [2025-01-09 22:02:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 553 states have (on average 1.4303797468354431) internal successors, (791), 565 states have internal predecessors, (791), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 22:02:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 819 transitions. [2025-01-09 22:02:50,098 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 819 transitions. Word has length 85 [2025-01-09 22:02:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:50,099 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 819 transitions. [2025-01-09 22:02:50,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-01-09 22:02:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 819 transitions. [2025-01-09 22:02:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 22:02:50,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:50,102 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:50,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:02:50,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:50,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 209796900, now seen corresponding path program 1 times [2025-01-09 22:02:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479167517] [2025-01-09 22:02:50,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:50,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 22:02:50,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 22:02:50,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:50,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:02:50,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:50,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479167517] [2025-01-09 22:02:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479167517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:50,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:50,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:02:50,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914542701] [2025-01-09 22:02:50,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:50,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:02:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:50,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:02:50,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:02:50,344 INFO L87 Difference]: Start difference. First operand 572 states and 819 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:50,415 INFO L93 Difference]: Finished difference Result 572 states and 813 transitions. [2025-01-09 22:02:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:02:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 22:02:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:50,419 INFO L225 Difference]: With dead ends: 572 [2025-01-09 22:02:50,420 INFO L226 Difference]: Without dead ends: 572 [2025-01-09 22:02:50,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:02:50,420 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:50,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 906 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:02:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-01-09 22:02:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-01-09 22:02:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 553 states have (on average 1.4195298372513563) internal successors, (785), 565 states have internal predecessors, (785), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 22:02:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 813 transitions. [2025-01-09 22:02:50,448 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 813 transitions. Word has length 100 [2025-01-09 22:02:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:50,448 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 813 transitions. [2025-01-09 22:02:50,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 813 transitions. [2025-01-09 22:02:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 22:02:50,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:50,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:50,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:02:50,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:50,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash 702423074, now seen corresponding path program 1 times [2025-01-09 22:02:50,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410607287] [2025-01-09 22:02:50,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:50,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 22:02:50,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 22:02:50,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:50,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:02:50,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:50,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410607287] [2025-01-09 22:02:50,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410607287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:50,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:50,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:02:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234251975] [2025-01-09 22:02:50,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:50,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:02:50,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:50,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:02:50,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:02:50,873 INFO L87 Difference]: Start difference. First operand 572 states and 813 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:50,995 INFO L93 Difference]: Finished difference Result 818 states and 1176 transitions. [2025-01-09 22:02:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:02:50,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 22:02:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:51,002 INFO L225 Difference]: With dead ends: 818 [2025-01-09 22:02:51,002 INFO L226 Difference]: Without dead ends: 818 [2025-01-09 22:02:51,002 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-01-09 22:02:51,003 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 430 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:51,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1430 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:02:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-01-09 22:02:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 574. [2025-01-09 22:02:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 555 states have (on average 1.418018018018018) internal successors, (787), 567 states have internal predecessors, (787), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 22:02:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 815 transitions. [2025-01-09 22:02:51,037 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 815 transitions. Word has length 100 [2025-01-09 22:02:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:51,038 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 815 transitions. [2025-01-09 22:02:51,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 815 transitions. [2025-01-09 22:02:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 22:02:51,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:51,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:51,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:02:51,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:51,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash 910762525, now seen corresponding path program 1 times [2025-01-09 22:02:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:51,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122889742] [2025-01-09 22:02:51,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 22:02:51,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 22:02:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:02:51,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:51,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122889742] [2025-01-09 22:02:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122889742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:51,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:51,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:02:51,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405031763] [2025-01-09 22:02:51,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:51,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:02:51,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:51,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:02:51,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:02:51,468 INFO L87 Difference]: Start difference. First operand 574 states and 815 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:51,561 INFO L93 Difference]: Finished difference Result 490 states and 661 transitions. [2025-01-09 22:02:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:02:51,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 22:02:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:51,566 INFO L225 Difference]: With dead ends: 490 [2025-01-09 22:02:51,566 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 22:02:51,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:02:51,568 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 14 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:51,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1441 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:02:51,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 22:02:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-01-09 22:02:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 471 states have (on average 1.3439490445859872) internal successors, (633), 483 states have internal predecessors, (633), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 22:02:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 661 transitions. [2025-01-09 22:02:51,587 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 661 transitions. Word has length 156 [2025-01-09 22:02:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:51,588 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 661 transitions. [2025-01-09 22:02:51,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 661 transitions. [2025-01-09 22:02:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 22:02:51,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:51,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:51,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:02:51,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:51,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash 366506315, now seen corresponding path program 1 times [2025-01-09 22:02:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:51,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245710838] [2025-01-09 22:02:51,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:51,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 22:02:51,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 22:02:51,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:51,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:02:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245710838] [2025-01-09 22:02:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245710838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:02:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166261146] [2025-01-09 22:02:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:51,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:02:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:02:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:02:51,872 INFO L87 Difference]: Start difference. First operand 490 states and 661 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:51,925 INFO L93 Difference]: Finished difference Result 478 states and 641 transitions. [2025-01-09 22:02:51,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:02:51,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 22:02:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:51,929 INFO L225 Difference]: With dead ends: 478 [2025-01-09 22:02:51,930 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 22:02:51,930 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-01-09 22:02:51,930 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 9 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:51,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1085 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:02:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 22:02:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2025-01-09 22:02:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 459 states have (on average 1.3355119825708062) internal successors, (613), 471 states have internal predecessors, (613), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 22:02:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 641 transitions. [2025-01-09 22:02:51,943 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 641 transitions. Word has length 156 [2025-01-09 22:02:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:51,943 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 641 transitions. [2025-01-09 22:02:51,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 641 transitions. [2025-01-09 22:02:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 22:02:51,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:51,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:02:51,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:51,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1111055699, now seen corresponding path program 1 times [2025-01-09 22:02:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443881354] [2025-01-09 22:02:51,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:51,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 22:02:52,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 22:02:52,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:52,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:02:52,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:52,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443881354] [2025-01-09 22:02:52,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443881354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:02:52,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:02:52,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:02:52,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326109174] [2025-01-09 22:02:52,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:02:52,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:02:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:52,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:02:52,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:02:52,224 INFO L87 Difference]: Start difference. First operand 478 states and 641 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:52,616 INFO L93 Difference]: Finished difference Result 562 states and 749 transitions. [2025-01-09 22:02:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:02:52,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 22:02:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:52,620 INFO L225 Difference]: With dead ends: 562 [2025-01-09 22:02:52,620 INFO L226 Difference]: Without dead ends: 562 [2025-01-09 22:02:52,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:02:52,621 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1016 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:52,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 1033 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:02:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-01-09 22:02:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2025-01-09 22:02:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 367 states have (on average 1.3215258855585832) internal successors, (485), 374 states have internal predecessors, (485), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:02:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 503 transitions. [2025-01-09 22:02:52,635 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 503 transitions. Word has length 156 [2025-01-09 22:02:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:52,635 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 503 transitions. [2025-01-09 22:02:52,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:02:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 503 transitions. [2025-01-09 22:02:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 22:02:52,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:52,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:52,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:02:52,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:52,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1162293762, now seen corresponding path program 1 times [2025-01-09 22:02:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:52,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96457897] [2025-01-09 22:02:52,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:52,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:52,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 22:02:52,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 22:02:52,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:52,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:02:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96457897] [2025-01-09 22:02:53,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96457897] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:02:53,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464211136] [2025-01-09 22:02:53,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:53,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:02:53,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:02:53,438 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-01-09 22:02:53,441 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-01-09 22:02:53,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 22:02:53,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 22:02:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:53,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:02:53,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:02:53,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:02:54,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 22:02:54,122 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 15 treesize of output 7 [2025-01-09 22:02:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:02:54,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:02:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:02:54,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464211136] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:02:54,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:02:54,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 22:02:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530188412] [2025-01-09 22:02:54,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:02:54,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:02:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:02:54,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:02:54,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:02:54,371 INFO L87 Difference]: Start difference. First operand 381 states and 503 transitions. Second operand has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:02:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:02:54,661 INFO L93 Difference]: Finished difference Result 1115 states and 1485 transitions. [2025-01-09 22:02:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:02:54,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 166 [2025-01-09 22:02:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:02:54,667 INFO L225 Difference]: With dead ends: 1115 [2025-01-09 22:02:54,667 INFO L226 Difference]: Without dead ends: 1115 [2025-01-09 22:02:54,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:02:54,668 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 1469 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:02:54,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 2613 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:02:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-09 22:02:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 728. [2025-01-09 22:02:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 710 states have (on average 1.3183098591549296) internal successors, (936), 717 states have internal predecessors, (936), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 22:02:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 960 transitions. [2025-01-09 22:02:54,689 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 960 transitions. Word has length 166 [2025-01-09 22:02:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:02:54,689 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 960 transitions. [2025-01-09 22:02:54,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:02:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 960 transitions. [2025-01-09 22:02:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 22:02:54,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:02:54,695 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:02:54,706 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-01-09 22:02:54,896 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,SelfDestructingSolverStorable9 [2025-01-09 22:02:54,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:02:54,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:02:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 481277528, now seen corresponding path program 1 times [2025-01-09 22:02:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:02:54,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103557886] [2025-01-09 22:02:54,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:02:55,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 22:02:55,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 22:02:55,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:55,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:02:58,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:02:58,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103557886] [2025-01-09 22:02:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103557886] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:02:58,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618155307] [2025-01-09 22:02:58,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:02:58,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:02:58,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:02:58,358 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-01-09 22:02:58,361 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-01-09 22:02:58,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 22:02:59,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 22:02:59,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:02:59,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:02:59,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:02:59,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:02:59,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:02:59,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 22:02:59,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 22:02:59,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 22:02:59,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 22:02:59,707 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 15 treesize of output 7 [2025-01-09 22:02:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:02:59,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:03:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:03:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618155307] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:03:00,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:03:00,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-01-09 22:03:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586117587] [2025-01-09 22:03:00,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:03:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:03:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:03:00,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:03:00,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:03:00,277 INFO L87 Difference]: Start difference. First operand 728 states and 960 transitions. Second operand has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:03:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:03:00,866 INFO L93 Difference]: Finished difference Result 2339 states and 3126 transitions. [2025-01-09 22:03:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:03:00,867 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 394 [2025-01-09 22:03:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:03:00,877 INFO L225 Difference]: With dead ends: 2339 [2025-01-09 22:03:00,877 INFO L226 Difference]: Without dead ends: 2339 [2025-01-09 22:03:00,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 780 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:03:00,879 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 4450 mSDsluCounter, 4876 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4487 SdHoareTripleChecker+Valid, 5281 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:03:00,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4487 Valid, 5281 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:03:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2025-01-09 22:03:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1592. [2025-01-09 22:03:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1568 states have (on average 1.316326530612245) internal successors, (2064), 1575 states have internal predecessors, (2064), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 22:03:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2100 transitions. [2025-01-09 22:03:00,916 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2100 transitions. Word has length 394 [2025-01-09 22:03:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:03:00,917 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2100 transitions. [2025-01-09 22:03:00,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:03:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2100 transitions. [2025-01-09 22:03:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 22:03:00,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:03:00,934 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:03:00,947 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-01-09 22:03:01,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:03:01,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:03:01,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:03:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash -113756668, now seen corresponding path program 2 times [2025-01-09 22:03:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:03:01,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831647143] [2025-01-09 22:03:01,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:03:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:03:01,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 850 statements into 2 equivalence classes. [2025-01-09 22:03:01,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 850 statements. [2025-01-09 22:03:01,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:03:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:03:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 22:03:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:03:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831647143] [2025-01-09 22:03:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831647143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:03:01,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:03:01,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:03:01,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165311736] [2025-01-09 22:03:01,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:03:01,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:03:01,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:03:01,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:03:01,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:03:01,687 INFO L87 Difference]: Start difference. First operand 1592 states and 2100 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:03:02,126 INFO L93 Difference]: Finished difference Result 1597 states and 2105 transitions. [2025-01-09 22:03:02,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:03:02,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 22:03:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:03:02,137 INFO L225 Difference]: With dead ends: 1597 [2025-01-09 22:03:02,138 INFO L226 Difference]: Without dead ends: 1597 [2025-01-09 22:03:02,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:03:02,139 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 34 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:03:02,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1822 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:03:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-01-09 22:03:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1596. [2025-01-09 22:03:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1572 states have (on average 1.3155216284987277) internal successors, (2068), 1579 states have internal predecessors, (2068), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 22:03:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2104 transitions. [2025-01-09 22:03:02,170 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2104 transitions. Word has length 850 [2025-01-09 22:03:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:03:02,172 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2104 transitions. [2025-01-09 22:03:02,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2104 transitions. [2025-01-09 22:03:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 22:03:02,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:03:02,193 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:03:02,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:03:02,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:03:02,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:03:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2038204040, now seen corresponding path program 1 times [2025-01-09 22:03:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:03:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695759176] [2025-01-09 22:03:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:03:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:03:02,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 22:03:02,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 22:03:02,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:03:02,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:03:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 22:03:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:03:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695759176] [2025-01-09 22:03:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695759176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:03:05,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:03:05,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:03:05,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905721960] [2025-01-09 22:03:05,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:03:05,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:03:05,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:03:05,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:03:05,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:03:05,229 INFO L87 Difference]: Start difference. First operand 1596 states and 2104 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:03:05,638 INFO L93 Difference]: Finished difference Result 1601 states and 2110 transitions. [2025-01-09 22:03:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:03:05,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2025-01-09 22:03:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:03:05,647 INFO L225 Difference]: With dead ends: 1601 [2025-01-09 22:03:05,648 INFO L226 Difference]: Without dead ends: 1601 [2025-01-09 22:03:05,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:03:05,648 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 9 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:03:05,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1812 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:03:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-01-09 22:03:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1600. [2025-01-09 22:03:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1576 states have (on average 1.3153553299492386) internal successors, (2073), 1583 states have internal predecessors, (2073), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 22:03:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2109 transitions. [2025-01-09 22:03:05,683 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2109 transitions. Word has length 851 [2025-01-09 22:03:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:03:05,684 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2109 transitions. [2025-01-09 22:03:05,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2109 transitions. [2025-01-09 22:03:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 22:03:05,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:03:05,693 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:03:05,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:03:05,693 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:03:05,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:03:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash 298942988, now seen corresponding path program 1 times [2025-01-09 22:03:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:03:05,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344025719] [2025-01-09 22:03:05,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:03:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:03:05,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 22:03:06,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 22:03:06,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:03:06,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:03:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 22:03:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:03:07,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344025719] [2025-01-09 22:03:07,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344025719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:03:07,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:03:07,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:03:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720149808] [2025-01-09 22:03:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:03:07,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:03:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:03:07,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:03:07,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:03:07,789 INFO L87 Difference]: Start difference. First operand 1600 states and 2109 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:03:08,126 INFO L93 Difference]: Finished difference Result 1605 states and 2115 transitions. [2025-01-09 22:03:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:03:08,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2025-01-09 22:03:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:03:08,135 INFO L225 Difference]: With dead ends: 1605 [2025-01-09 22:03:08,135 INFO L226 Difference]: Without dead ends: 1605 [2025-01-09 22:03:08,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:03:08,135 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 10 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:03:08,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1844 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:03:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-01-09 22:03:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1600. [2025-01-09 22:03:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1576 states have (on average 1.3153553299492386) internal successors, (2073), 1583 states have internal predecessors, (2073), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 22:03:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2109 transitions. [2025-01-09 22:03:08,173 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2109 transitions. Word has length 851 [2025-01-09 22:03:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:03:08,175 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2109 transitions. [2025-01-09 22:03:08,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2109 transitions. [2025-01-09 22:03:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2025-01-09 22:03:08,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:03:08,190 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:03:08,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:03:08,190 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:03:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:03:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2129416592, now seen corresponding path program 1 times [2025-01-09 22:03:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:03:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424129927] [2025-01-09 22:03:08,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:03:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:03:08,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 852 statements into 1 equivalence classes. [2025-01-09 22:03:08,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 852 of 852 statements. [2025-01-09 22:03:08,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:03:08,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:03:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 22:03:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:03:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424129927] [2025-01-09 22:03:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424129927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:03:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:03:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:03:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815065108] [2025-01-09 22:03:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:03:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:03:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:03:10,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:03:10,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:03:10,703 INFO L87 Difference]: Start difference. First operand 1600 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:03:11,235 INFO L93 Difference]: Finished difference Result 1611 states and 2123 transitions. [2025-01-09 22:03:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:03:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 852 [2025-01-09 22:03:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:03:11,244 INFO L225 Difference]: With dead ends: 1611 [2025-01-09 22:03:11,245 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 22:03:11,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:03:11,246 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 27 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:03:11,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2533 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:03:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 22:03:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1608. [2025-01-09 22:03:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1584 states have (on average 1.3150252525252526) internal successors, (2083), 1591 states have internal predecessors, (2083), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 22:03:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2119 transitions. [2025-01-09 22:03:11,279 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2119 transitions. Word has length 852 [2025-01-09 22:03:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:03:11,280 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2119 transitions. [2025-01-09 22:03:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2119 transitions. [2025-01-09 22:03:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-01-09 22:03:11,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:03:11,290 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:03:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:03:11,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:03:11,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:03:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1198784621, now seen corresponding path program 1 times [2025-01-09 22:03:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:03:11,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389492479] [2025-01-09 22:03:11,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:03:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:03:11,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-01-09 22:03:11,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-01-09 22:03:11,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:03:11,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:03:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 22:03:13,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:03:13,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389492479] [2025-01-09 22:03:13,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389492479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:03:13,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:03:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:03:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224319479] [2025-01-09 22:03:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:03:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:03:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:03:13,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:03:13,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:03:13,193 INFO L87 Difference]: Start difference. First operand 1608 states and 2119 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:03:13,480 INFO L93 Difference]: Finished difference Result 1611 states and 2122 transitions. [2025-01-09 22:03:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:03:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 853 [2025-01-09 22:03:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:03:13,487 INFO L225 Difference]: With dead ends: 1611 [2025-01-09 22:03:13,487 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 22:03:13,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:03:13,488 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 4 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:03:13,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1832 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:03:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 22:03:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2025-01-09 22:03:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1587 states have (on average 1.3144297416509136) internal successors, (2086), 1594 states have internal predecessors, (2086), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 22:03:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2122 transitions. [2025-01-09 22:03:13,517 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2122 transitions. Word has length 853 [2025-01-09 22:03:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:03:13,518 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2122 transitions. [2025-01-09 22:03:13,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:03:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2122 transitions. [2025-01-09 22:03:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-01-09 22:03:13,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:03:13,528 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:03:13,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:03:13,528 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:03:13,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:03:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1601539951, now seen corresponding path program 1 times [2025-01-09 22:03:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:03:13,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714484587] [2025-01-09 22:03:13,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:03:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:03:13,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes.