./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-e2fb8be-m [2025-03-09 01:52:46,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:52:46,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:52:46,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:52:46,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:52:46,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:52:46,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:52:46,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:52:46,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:52:46,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:52:46,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:52:46,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:52:46,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:52:46,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:52:46,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:52:46,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:52:46,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:52:46,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:52:46,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:52:46,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:52:46,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:52:46,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-03-09 01:52:47,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:52:47,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:52:47,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:52:47,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:52:47,209 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:52:47,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2025-03-09 01:52:48,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b9da07c/80eef2dbfc7746e8a686a913a542ce8e/FLAGbac839510 [2025-03-09 01:52:48,673 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:52:48,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2025-03-09 01:52:48,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b9da07c/80eef2dbfc7746e8a686a913a542ce8e/FLAGbac839510 [2025-03-09 01:52:48,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b9da07c/80eef2dbfc7746e8a686a913a542ce8e [2025-03-09 01:52:48,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:52:48,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:52:48,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:52:48,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:52:48,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:52:48,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:52:48" (1/1) ... [2025-03-09 01:52:48,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2258a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:48, skipping insertion in model container [2025-03-09 01:52:48,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:52:48" (1/1) ... [2025-03-09 01:52:48,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:52:49,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:52:49,225 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:52:49,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:52:49,311 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:52:49,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49 WrapperNode [2025-03-09 01:52:49,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:52:49,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:52:49,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:52:49,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:52:49,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,355 INFO L138 Inliner]: procedures = 164, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 124 [2025-03-09 01:52:49,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:52:49,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:52:49,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:52:49,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:52:49,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,387 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-03-09 01:52:49,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:52:49,408 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:52:49,408 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:52:49,408 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:52:49,410 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (1/1) ... [2025-03-09 01:52:49,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:52:49,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:49,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:52:49,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:52:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:52:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:52:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2025-03-09 01:52:49,454 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-09 01:52:49,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2025-03-09 01:52:49,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:52:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:52:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:52:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:52:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:52:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:52:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:52:49,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:52:49,562 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:52:49,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:52:49,629 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc ldv_kref_put_#t~ret34#1; [2025-03-09 01:52:49,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2025-03-09 01:52:49,731 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-09 01:52:49,731 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:52:49,740 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:52:49,740 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:52:49,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:52:49 BoogieIcfgContainer [2025-03-09 01:52:49,740 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:52:49,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:52:49,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:52:49,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:52:49,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:52:48" (1/3) ... [2025-03-09 01:52:49,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddec366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:52:49, skipping insertion in model container [2025-03-09 01:52:49,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:49" (2/3) ... [2025-03-09 01:52:49,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddec366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:52:49, skipping insertion in model container [2025-03-09 01:52:49,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:52:49" (3/3) ... [2025-03-09 01:52:49,747 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2025-03-09 01:52:49,757 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:52:49,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test22_2-2.i that has 4 procedures, 52 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-09 01:52:49,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:52:49,812 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;@20ac932e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:52:49,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:52:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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-03-09 01:52:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:52:49,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:49,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:49,822 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-03-09 01:52:49,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 241440200, now seen corresponding path program 1 times [2025-03-09 01:52:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876934534] [2025-03-09 01:52:49,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:49,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:52:49,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:52:49,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:49,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:50,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:50,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876934534] [2025-03-09 01:52:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876934534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:50,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:50,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:52:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656873187] [2025-03-09 01:52:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:50,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:52:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:50,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:52:50,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:50,107 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:50,149 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2025-03-09 01:52:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:52:50,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-09 01:52:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:50,155 INFO L225 Difference]: With dead ends: 96 [2025-03-09 01:52:50,155 INFO L226 Difference]: Without dead ends: 60 [2025-03-09 01:52:50,158 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-03-09 01:52:50,161 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 10 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:50,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 224 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-09 01:52:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2025-03-09 01:52:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:52:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-03-09 01:52:50,215 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 12 [2025-03-09 01:52:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:50,215 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-03-09 01:52:50,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-03-09 01:52:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:52:50,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:50,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:50,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:52:50,217 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-03-09 01:52:50,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1984250535, now seen corresponding path program 1 times [2025-03-09 01:52:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370774818] [2025-03-09 01:52:50,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:50,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:52:50,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:52:50,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:50,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370774818] [2025-03-09 01:52:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370774818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:50,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:50,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:52:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505121401] [2025-03-09 01:52:50,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:50,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:52:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:50,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:52:50,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:50,353 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:50,380 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-03-09 01:52:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:52:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-09 01:52:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:50,383 INFO L225 Difference]: With dead ends: 81 [2025-03-09 01:52:50,383 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 01:52:50,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:50,385 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:50,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 01:52:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2025-03-09 01:52:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:52:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-09 01:52:50,392 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2025-03-09 01:52:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:50,392 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-09 01:52:50,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-09 01:52:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:52:50,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:50,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:50,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:52:50,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:52:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2075562795, now seen corresponding path program 1 times [2025-03-09 01:52:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465347750] [2025-03-09 01:52:50,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:50,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:52:50,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:52:50,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:50,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:50,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:50,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465347750] [2025-03-09 01:52:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465347750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:52:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365207972] [2025-03-09 01:52:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:50,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:52:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:50,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:52:50,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:52:50,507 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:50,555 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2025-03-09 01:52:50,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:52:50,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-09 01:52:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:50,556 INFO L225 Difference]: With dead ends: 91 [2025-03-09 01:52:50,556 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 01:52:50,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:52:50,557 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:50,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 256 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 01:52:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2025-03-09 01:52:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:52:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-03-09 01:52:50,565 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 16 [2025-03-09 01:52:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:50,565 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-03-09 01:52:50,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-03-09 01:52:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:52:50,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:50,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:50,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:52:50,566 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-03-09 01:52:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1798263475, now seen corresponding path program 1 times [2025-03-09 01:52:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689060566] [2025-03-09 01:52:50,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:50,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:52:50,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:52:50,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:50,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:50,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689060566] [2025-03-09 01:52:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689060566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:50,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:50,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:52:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371826003] [2025-03-09 01:52:50,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:50,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:52:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:50,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:52:50,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:52:50,709 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:50,760 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-03-09 01:52:50,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:52:50,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-09 01:52:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:50,763 INFO L225 Difference]: With dead ends: 82 [2025-03-09 01:52:50,763 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 01:52:50,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:52:50,764 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:50,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 260 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 01:52:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 01:52:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:52:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-03-09 01:52:50,768 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 17 [2025-03-09 01:52:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:50,769 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-03-09 01:52:50,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-03-09 01:52:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:52:50,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:50,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:50,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:52:50,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:52:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1946480076, now seen corresponding path program 1 times [2025-03-09 01:52:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593017804] [2025-03-09 01:52:50,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:50,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:52:50,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:52:50,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:50,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:50,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:50,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593017804] [2025-03-09 01:52:50,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593017804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:50,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:52:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862874435] [2025-03-09 01:52:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:50,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:52:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:50,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:52:50,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:50,837 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:50,859 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-03-09 01:52:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:52:50,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-09 01:52:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:50,860 INFO L225 Difference]: With dead ends: 91 [2025-03-09 01:52:50,860 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 01:52:50,861 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-03-09 01:52:50,861 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:50,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 01:52:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-09 01:52:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 42 states have internal predecessors, (47), 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-03-09 01:52:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-03-09 01:52:50,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 16 [2025-03-09 01:52:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:50,865 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-03-09 01:52:50,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-03-09 01:52:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:52:50,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:50,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:50,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:52:50,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:52:50,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:50,867 INFO L85 PathProgramCache]: Analyzing trace with hash 257761074, now seen corresponding path program 1 times [2025-03-09 01:52:50,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:50,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5662542] [2025-03-09 01:52:50,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:50,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:52:50,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:52:50,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:50,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:50,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:50,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5662542] [2025-03-09 01:52:50,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5662542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:50,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:50,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:52:50,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103969150] [2025-03-09 01:52:50,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:50,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:52:50,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:50,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:52:50,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:52:50,995 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:51,029 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-03-09 01:52:51,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:52:51,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-09 01:52:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:51,030 INFO L225 Difference]: With dead ends: 78 [2025-03-09 01:52:51,030 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 01:52:51,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:52:51,031 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:51,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 267 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 01:52:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-09 01:52:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 41 states have internal predecessors, (46), 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-03-09 01:52:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-09 01:52:51,038 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2025-03-09 01:52:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:51,038 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-09 01:52:51,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:52:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-09 01:52:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:52:51,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:51,039 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] [2025-03-09 01:52:51,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:52:51,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:52:51,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1336200382, now seen corresponding path program 1 times [2025-03-09 01:52:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533291489] [2025-03-09 01:52:51,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:51,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:52:51,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:52:51,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:51,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533291489] [2025-03-09 01:52:51,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533291489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:51,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:51,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:52:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613803196] [2025-03-09 01:52:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:52:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:51,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:52:51,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:52:51,148 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-03-09 01:52:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:51,158 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2025-03-09 01:52:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:52:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 23 [2025-03-09 01:52:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:51,160 INFO L225 Difference]: With dead ends: 87 [2025-03-09 01:52:51,160 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 01:52:51,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:52:51,160 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:51,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 01:52:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 01:52:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.236842105263158) internal successors, (47), 42 states have internal predecessors, (47), 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-03-09 01:52:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-03-09 01:52:51,166 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 23 [2025-03-09 01:52:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:51,166 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-03-09 01:52:51,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-03-09 01:52:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-03-09 01:52:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:52:51,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:51,167 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-03-09 01:52:51,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:52:51,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:52:51,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1817744430, now seen corresponding path program 1 times [2025-03-09 01:52:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:51,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495668987] [2025-03-09 01:52:51,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:51,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:52:51,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:52:51,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:51,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:51,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:51,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495668987] [2025-03-09 01:52:51,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495668987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820376307] [2025-03-09 01:52:51,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:51,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:51,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:51,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:51,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:52:51,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:52:51,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:52:51,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:51,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:51,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-09 01:52:51,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:51,558 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-03-09 01:52:51,618 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-03-09 01:52:51,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:52:51,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:52:51,650 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 34 treesize of output 11 [2025-03-09 01:52:51,726 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-03-09 01:52:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:52:51,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:52:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820376307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:51,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:52:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2025-03-09 01:52:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956441018] [2025-03-09 01:52:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:51,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:52:51,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:51,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:52:51,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2025-03-09 01:52:51,747 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:51,883 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-09 01:52:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:52:51,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 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 24 [2025-03-09 01:52:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:51,885 INFO L225 Difference]: With dead ends: 51 [2025-03-09 01:52:51,885 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 01:52:51,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2025-03-09 01:52:51,886 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:51,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 221 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2025-03-09 01:52:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 01:52:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-09 01:52:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 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-03-09 01:52:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-09 01:52:51,890 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2025-03-09 01:52:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:51,890 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-09 01:52:51,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-09 01:52:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:52:51,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:51,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:51,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:52:52,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:52,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:52:52,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash 515502495, now seen corresponding path program 1 times [2025-03-09 01:52:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:52,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627896885] [2025-03-09 01:52:52,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:52,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:52,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:52:52,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:52:52,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:52,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627896885] [2025-03-09 01:52:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627896885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129840555] [2025-03-09 01:52:52,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:52,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:52,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:52,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:52,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:52:52,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:52:52,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:52:52,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:52,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:52,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-09 01:52:52,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:52,393 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-03-09 01:52:52,452 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-03-09 01:52:52,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:52:52,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:52:52,480 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 34 treesize of output 11 [2025-03-09 01:52:52,547 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-03-09 01:52:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:52:52,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:52:52,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129840555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:52,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:52:52,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2025-03-09 01:52:52,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216828753] [2025-03-09 01:52:52,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:52,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:52:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:52,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:52:52,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2025-03-09 01:52:52,570 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:52,709 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-09 01:52:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:52:52,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 25 [2025-03-09 01:52:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:52,710 INFO L225 Difference]: With dead ends: 51 [2025-03-09 01:52:52,710 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 01:52:52,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2025-03-09 01:52:52,711 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:52,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 271 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2025-03-09 01:52:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 01:52:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-03-09 01:52:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 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-03-09 01:52:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-09 01:52:52,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 25 [2025-03-09 01:52:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:52,718 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-09 01:52:52,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-09 01:52:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 01:52:52,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:52,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:52,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:52:52,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-09 01:52:52,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:52:52,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1853474778, now seen corresponding path program 1 times [2025-03-09 01:52:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:52,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721287906] [2025-03-09 01:52:52,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:52,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:52:52,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:52:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:52:53,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:53,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721287906] [2025-03-09 01:52:53,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721287906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:53,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:53,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:52:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277969024] [2025-03-09 01:52:53,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:52:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:53,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:52:53,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:52:53,024 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-03-09 01:52:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:53,046 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-03-09 01:52:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:52:53,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 29 [2025-03-09 01:52:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:53,047 INFO L225 Difference]: With dead ends: 67 [2025-03-09 01:52:53,047 INFO L226 Difference]: Without dead ends: 47 [2025-03-09 01:52:53,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:52:53,048 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 5 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:53,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 240 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-09 01:52:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-09 01:52:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 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-03-09 01:52:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-03-09 01:52:53,054 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 29 [2025-03-09 01:52:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:53,054 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-03-09 01:52:53,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-03-09 01:52:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-03-09 01:52:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 01:52:53,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:53,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:53,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:52:53,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:52:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1882912354, now seen corresponding path program 1 times [2025-03-09 01:52:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731515105] [2025-03-09 01:52:53,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:53,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:52:53,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:52:53,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:53,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:53,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:53,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731515105] [2025-03-09 01:52:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731515105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:53,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768083880] [2025-03-09 01:52:53,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:53,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:53,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:53,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:53,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:52:53,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:52:53,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:52:53,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:53,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:53,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-09 01:52:53,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:53,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 01:52:53,374 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_13 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_13 |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_13 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_13 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_13)) .cse1 (select .cse0 .cse1))))))) is different from true [2025-03-09 01:52:53,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:52:53,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:52:53,395 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-03-09 01:52:53,492 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 46 treesize of output 15 [2025-03-09 01:52:53,548 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-03-09 01:52:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:53,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:54:02,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768083880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:54:02,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:54:02,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15] total 18 [2025-03-09 01:54:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514660867] [2025-03-09 01:54:02,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:54:02,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:54:02,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:54:02,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:54:02,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=616, Unknown=16, NotChecked=50, Total=756 [2025-03-09 01:54:02,140 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:54:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:54:19,680 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2025-03-09 01:54:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:54:19,682 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-09 01:54:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:54:19,682 INFO L225 Difference]: With dead ends: 94 [2025-03-09 01:54:19,682 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 01:54:19,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 79.7s TimeCoverageRelationStatistics Valid=109, Invalid=869, Unknown=18, NotChecked=60, Total=1056 [2025-03-09 01:54:19,683 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:54:19,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 365 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 365 Invalid, 0 Unknown, 90 Unchecked, 6.4s Time] [2025-03-09 01:54:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 01:54:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-09 01:54:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:54:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-03-09 01:54:19,688 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 33 [2025-03-09 01:54:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:54:19,688 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-03-09 01:54:19,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:54:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-03-09 01:54:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:54:19,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:19,689 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] [2025-03-09 01:54:19,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:54:19,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:19,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:19,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash 299239524, now seen corresponding path program 1 times [2025-03-09 01:54:19,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:19,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760903067] [2025-03-09 01:54:19,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:54:19,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:19,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:54:19,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:54:19,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:54:19,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:20,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:20,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760903067] [2025-03-09 01:54:20,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760903067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:54:20,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116957376] [2025-03-09 01:54:20,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:54:20,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:54:20,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:54:20,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:54:20,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:54:20,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:54:20,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:54:20,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:20,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-03-09 01:54:20,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:54:23,123 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-03-09 01:54:24,184 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_19 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_19 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (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_19 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_19 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_19)) .cse1 (select .cse0 .cse1)))) |c_#memory_int#1|))) is different from true [2025-03-09 01:54:24,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:54:24,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:54:24,366 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 34 treesize of output 11 [2025-03-09 01:54:27,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 01:54:29,431 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-03-09 01:54:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:54:30,169 INFO L312 TraceCheckSpWp]: Computing backward predicates...