./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:07:25,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:07:25,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:07:25,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:07:25,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:07:25,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:07:25,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:07:25,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:07:25,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:07:25,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:07:25,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:07:25,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:07:25,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:07:25,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:07:25,429 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:07:25,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:07:25,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:07:25,430 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:07:25,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:07:25,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:07:25,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:07:25,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:07:25,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:07:25,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:07:25,431 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:07:25,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:07:25,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:07:25,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:07:25,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:07:25,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:07:25,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:07:25,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:07:25,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:07:25,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:07:25,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:07:25,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:07:25,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:07:25,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:07:25,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:07:25,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:07:25,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:07:25,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:07:25,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:07:25,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:07:25,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:07:25,434 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 ! overflow) ) 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2025-02-08 09:07:25,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:07:25,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:07:25,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:07:25,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:07:25,733 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:07:25,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2025-02-08 09:07:27,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bc9b8eaa/98c681b3692b43c3b785c9a0eb6dd59a/FLAG97dd89ad7 [2025-02-08 09:07:27,360 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:07:27,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2025-02-08 09:07:27,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bc9b8eaa/98c681b3692b43c3b785c9a0eb6dd59a/FLAG97dd89ad7 [2025-02-08 09:07:27,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bc9b8eaa/98c681b3692b43c3b785c9a0eb6dd59a [2025-02-08 09:07:27,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:07:27,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:07:27,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:07:27,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:07:27,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:07:27,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:27,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b4f802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27, skipping insertion in model container [2025-02-08 09:07:27,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:27,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:07:27,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:07:27,835 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:07:27,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:07:27,925 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:07:27,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27 WrapperNode [2025-02-08 09:07:27,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:07:27,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:07:27,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:07:27,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:07:27,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:27,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:27,961 INFO L138 Inliner]: procedures = 164, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 124 [2025-02-08 09:07:27,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:07:27,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:07:27,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:07:27,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:07:27,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:27,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:27,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:28,000 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-02-08 09:07:28,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:28,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:28,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:28,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:28,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:28,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:28,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:07:28,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:07:28,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:07:28,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:07:28,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (1/1) ... [2025-02-08 09:07:28,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:07:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:28,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:07:28,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:07:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 09:07:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 09:07:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2025-02-08 09:07:28,086 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2025-02-08 09:07:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-08 09:07:28,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-08 09:07:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2025-02-08 09:07:28,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2025-02-08 09:07:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 09:07:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 09:07:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 09:07:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:07:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 09:07:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 09:07:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 09:07:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 09:07:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 09:07:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 09:07:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 09:07:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:07:28,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:07:28,210 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:07:28,212 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:07:28,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L674-1: ldv_kref_sub_#t~ret32#1 := ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem31#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;havoc ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;assume { :end_inline_ldv_atomic_sub_return } true;assume -2147483648 <= ldv_kref_sub_#t~ret32#1 && ldv_kref_sub_#t~ret32#1 <= 2147483647; [2025-02-08 09:07:28,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume ldv_kobject_cleanup_~name~0#1.base != 0 || ldv_kobject_cleanup_~name~0#1.offset != 0;call ULTIMATE.dealloc(ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset); [2025-02-08 09:07:28,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume !(ldv_kobject_cleanup_~name~0#1.base != 0 || ldv_kobject_cleanup_~name~0#1.offset != 0); [2025-02-08 09:07:28,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc ldv_kref_put_#t~ret34#1;#t~ret37#1 := ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret34#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :end_inline_ldv_kref_put } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;havoc #t~ret37#1; [2025-02-08 09:07:28,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690-2: ldv_kref_put_#t~ret34#1 := ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret32#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;havoc ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :end_inline_ldv_kref_sub } true;assume -2147483648 <= ldv_kref_put_#t~ret34#1 && ldv_kref_put_#t~ret34#1 <= 2147483647;ldv_kref_put_#res#1 := ldv_kref_put_#t~ret34#1;havoc ldv_kref_put_#t~ret34#1; [2025-02-08 09:07:28,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;havoc ##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset, ##fun~$Pointer$~TO~VOID_#in~#fp#1.base, ##fun~$Pointer$~TO~VOID_#in~#fp#1.offset;assume { :end_inline_##fun~$Pointer$~TO~VOID } true;ldv_kref_sub_#res#1 := 1; [2025-02-08 09:07:28,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc ldv_kobject_cleanup_#t~mem35#1.base, ldv_kobject_cleanup_#t~mem35#1.offset, ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset;havoc ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset;assume { :end_inline_ldv_kobject_cleanup } true;havoc ldv_kobject_release_#t~ret36#1.base, ldv_kobject_release_#t~ret36#1.offset, ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset, ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset, ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;havoc ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset;assume { :end_inline_ldv_kobject_release } true; [2025-02-08 09:07:28,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: assume 0 == ldv_kref_sub_#t~ret32#1;havoc ldv_kref_sub_#t~ret32#1;assume { :begin_inline_##fun~$Pointer$~TO~VOID } true;##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset, ##fun~$Pointer$~TO~VOID_#in~#fp#1.base, ##fun~$Pointer$~TO~VOID_#in~#fp#1.offset := ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;havoc ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset := ##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset;assume { :begin_inline_ldv_kobject_release } true;ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset := ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;havoc ldv_kobject_release_#t~ret36#1.base, ldv_kobject_release_#t~ret36#1.offset, ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset, ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset, ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset := ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset;ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset := ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset;ldv_kobject_release_#t~ret36#1.base, ldv_kobject_release_#t~ret36#1.offset := ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset - 12;havoc ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset;ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset := ldv_kobject_release_#t~ret36#1.base, ldv_kobject_release_#t~ret36#1.offset;havoc ldv_kobject_release_#t~ret36#1.base, ldv_kobject_release_#t~ret36#1.offset;assume { :begin_inline_ldv_kobject_cleanup } true;ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset := ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;havoc ldv_kobject_cleanup_#t~mem35#1.base, ldv_kobject_cleanup_#t~mem35#1.offset, ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset;ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset := ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset;call ldv_kobject_cleanup_#t~mem35#1.base, ldv_kobject_cleanup_#t~mem35#1.offset := read~$Pointer$#1(ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, 4);ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset := ldv_kobject_cleanup_#t~mem35#1.base, ldv_kobject_cleanup_#t~mem35#1.offset;havoc ldv_kobject_cleanup_#t~mem35#1.base, ldv_kobject_cleanup_#t~mem35#1.offset;call ULTIMATE.dealloc(ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset); [2025-02-08 09:07:28,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: assume !(0 == ldv_kref_sub_#t~ret32#1);havoc ldv_kref_sub_#t~ret32#1;ldv_kref_sub_#res#1 := 0; [2025-02-08 09:07:28,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2025-02-08 09:07:28,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L686: ldv_kref_get_#t~ret33#1 := ldv_atomic_add_return_#res#1;havoc ldv_atomic_add_return_#t~mem30#1, ldv_atomic_add_return_~i#1, ldv_atomic_add_return_~v#1.base, ldv_atomic_add_return_~v#1.offset, ldv_atomic_add_return_~temp~0#1;havoc ldv_atomic_add_return_#in~i#1, ldv_atomic_add_return_#in~v#1.base, ldv_atomic_add_return_#in~v#1.offset;assume { :end_inline_ldv_atomic_add_return } true;assume -2147483648 <= ldv_kref_get_#t~ret33#1 && ldv_kref_get_#t~ret33#1 <= 2147483647;havoc ldv_kref_get_#t~ret33#1;havoc ldv_kref_get_#t~ret33#1, ldv_kref_get_~kref#1.base, ldv_kref_get_~kref#1.offset;havoc ldv_kref_get_#in~kref#1.base, ldv_kref_get_#in~kref#1.offset;assume { :end_inline_ldv_kref_get } true; [2025-02-08 09:07:28,505 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-02-08 09:07:28,505 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:07:28,512 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:07:28,512 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:07:28,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:07:28 BoogieIcfgContainer [2025-02-08 09:07:28,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:07:28,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:07:28,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:07:28,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:07:28,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:07:27" (1/3) ... [2025-02-08 09:07:28,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b3eb85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:07:28, skipping insertion in model container [2025-02-08 09:07:28,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:27" (2/3) ... [2025-02-08 09:07:28,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b3eb85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:07:28, skipping insertion in model container [2025-02-08 09:07:28,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:07:28" (3/3) ... [2025-02-08 09:07:28,522 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2025-02-08 09:07:28,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:07:28,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test22_2-2.i that has 4 procedures, 41 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-02-08 09:07:28,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:07:28,596 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=LoopHeads, 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;@527c8f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:07:28,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 09:07:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:07:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 09:07:28,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:28,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:28,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:07:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash 871874525, now seen corresponding path program 1 times [2025-02-08 09:07:28,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:28,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139886041] [2025-02-08 09:07:28,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:28,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 09:07:28,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 09:07:28,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:28,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139886041] [2025-02-08 09:07:29,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139886041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:07:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169696438] [2025-02-08 09:07:29,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:29,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:07:29,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:29,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:07:29,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:07:29,159 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:29,183 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2025-02-08 09:07:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:07:29,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-08 09:07:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:29,191 INFO L225 Difference]: With dead ends: 73 [2025-02-08 09:07:29,192 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 09:07:29,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:07:29,200 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:29,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 09:07:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 09:07:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:07:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-02-08 09:07:29,243 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2025-02-08 09:07:29,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:29,244 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-02-08 09:07:29,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-02-08 09:07:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 09:07:29,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:29,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:29,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:07:29,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:07:29,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1924296810, now seen corresponding path program 1 times [2025-02-08 09:07:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312688995] [2025-02-08 09:07:29,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:29,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 09:07:29,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 09:07:29,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:29,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:29,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312688995] [2025-02-08 09:07:29,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312688995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:07:29,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661457488] [2025-02-08 09:07:29,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:29,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:29,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:07:29,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:07:29,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 09:07:29,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 09:07:29,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:29,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:29,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 09:07:29,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:07:29,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 09:07:29,853 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_6 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_6 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_6 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_6 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_6)) .cse1 (select .cse0 .cse1))))))) is different from true [2025-02-08 09:07:29,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 09:07:29,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 09:07:29,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 09:07:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:07:29,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:07:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661457488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:29,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:07:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 12 [2025-02-08 09:07:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470522844] [2025-02-08 09:07:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:29,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:07:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:29,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:07:29,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2025-02-08 09:07:29,973 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:30,089 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-02-08 09:07:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 09:07:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-08 09:07:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:30,090 INFO L225 Difference]: With dead ends: 34 [2025-02-08 09:07:30,090 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 09:07:30,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2025-02-08 09:07:30,091 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:30,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 89 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2025-02-08 09:07:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 09:07:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 09:07:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:07:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-02-08 09:07:30,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2025-02-08 09:07:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:30,097 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-02-08 09:07:30,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-02-08 09:07:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 09:07:30,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:30,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:30,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 09:07:30,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:30,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:07:30,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash -476341027, now seen corresponding path program 1 times [2025-02-08 09:07:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:30,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562292323] [2025-02-08 09:07:30,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:30,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:30,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 09:07:30,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 09:07:30,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:30,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:30,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:30,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562292323] [2025-02-08 09:07:30,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562292323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:07:30,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392210153] [2025-02-08 09:07:30,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:30,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:30,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:30,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:07:30,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:07:30,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 09:07:30,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 09:07:30,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:30,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:30,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 09:07:30,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:07:30,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 09:07:30,694 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_9 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_9 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_9 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_9)) .cse1 (select .cse0 .cse1))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_9 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2025-02-08 09:07:30,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 09:07:30,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 09:07:30,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 09:07:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:07:30,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:07:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392210153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:07:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 12 [2025-02-08 09:07:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574539184] [2025-02-08 09:07:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:30,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:07:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:30,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:07:30,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2025-02-08 09:07:30,799 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:30,913 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-02-08 09:07:30,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 09:07:30,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-02-08 09:07:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:30,914 INFO L225 Difference]: With dead ends: 33 [2025-02-08 09:07:30,914 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 09:07:30,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2025-02-08 09:07:30,915 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:30,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2025-02-08 09:07:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 09:07:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 09:07:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:07:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-02-08 09:07:30,922 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2025-02-08 09:07:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:30,923 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-02-08 09:07:30,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-02-08 09:07:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 09:07:30,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:30,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:30,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 09:07:31,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:31,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:07:31,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:31,125 INFO L85 PathProgramCache]: Analyzing trace with hash -78570957, now seen corresponding path program 1 times [2025-02-08 09:07:31,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:31,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109462856] [2025-02-08 09:07:31,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:31,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 09:07:31,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 09:07:31,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:31,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:07:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109462856] [2025-02-08 09:07:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109462856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:31,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 09:07:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352035111] [2025-02-08 09:07:31,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:31,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:07:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:31,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:07:31,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:07:31,261 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:31,287 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2025-02-08 09:07:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:07:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-02-08 09:07:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:31,288 INFO L225 Difference]: With dead ends: 53 [2025-02-08 09:07:31,288 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 09:07:31,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:07:31,289 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:31,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 09:07:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 09:07:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:07:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-08 09:07:31,295 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2025-02-08 09:07:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:31,295 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-08 09:07:31,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-08 09:07:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 09:07:31,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:31,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:31,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:07:31,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:07:31,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 132779956, now seen corresponding path program 1 times [2025-02-08 09:07:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:31,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911972613] [2025-02-08 09:07:31,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:31,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 09:07:31,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 09:07:31,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:31,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:07:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911972613] [2025-02-08 09:07:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911972613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:31,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:31,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 09:07:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790450277] [2025-02-08 09:07:31,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:31,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:07:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:31,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:07:31,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:07:31,410 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:31,422 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-02-08 09:07:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:07:31,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-02-08 09:07:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:31,427 INFO L225 Difference]: With dead ends: 30 [2025-02-08 09:07:31,427 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:07:31,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:07:31,427 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:31,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:07:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:07:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:07:31,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2025-02-08 09:07:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:31,429 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:07:31,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:07:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:07:31,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:07:31,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-08 09:07:31,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-08 09:07:31,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-08 09:07:31,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-08 09:07:31,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:07:31,439 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 09:07:31,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:07:31,492 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:07:31,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:07:31 BoogieIcfgContainer [2025-02-08 09:07:31,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:07:31,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:07:31,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:07:31,503 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:07:31,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:07:28" (3/4) ... [2025-02-08 09:07:31,506 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:07:31,511 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-02-08 09:07:31,511 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2025-02-08 09:07:31,512 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2025-02-08 09:07:31,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 09:07:31,519 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 09:07:31,519 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:07:31,519 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:07:31,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:07:31,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:07:31,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:07:31,599 INFO L158 Benchmark]: Toolchain (without parser) took 4195.00ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 46.0MB in the end (delta: 66.1MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2025-02-08 09:07:31,600 INFO L158 Benchmark]: CDTParser took 1.30ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:07:31,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.53ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 90.2MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 09:07:31,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.16ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:07:31,601 INFO L158 Benchmark]: Boogie Preprocessor took 59.27ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:07:31,602 INFO L158 Benchmark]: IcfgBuilder took 490.87ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 65.5MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 09:07:31,602 INFO L158 Benchmark]: TraceAbstraction took 2986.48ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 52.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2025-02-08 09:07:31,602 INFO L158 Benchmark]: Witness Printer took 95.50ms. Allocated memory is still 142.6MB. Free memory was 52.1MB in the beginning and 46.0MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:07:31,604 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.53ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 90.2MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.16ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.27ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 490.87ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 65.5MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2986.48ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 52.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 95.50ms. Allocated memory is still 142.6MB. Free memory was 52.1MB in the beginning and 46.0MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 408 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 91 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 113 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 142 ConstructedInterpolants, 4 QuantifiedInterpolants, 493 SizeOfPredicates, 14 NumberOfNonLiveVariables, 383 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 09:07:31,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE