./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:39:04,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:39:04,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:39:04,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:39:04,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:39:04,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:39:04,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:39:04,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:39:04,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:39:04,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:39:04,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:39:04,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:39:04,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:39:04,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:39:04,981 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:39:04,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:39:04,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:39:04,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:39:04,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:39:04,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:39:04,983 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2025-01-10 01:39:05,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:39:05,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:39:05,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:39:05,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:39:05,217 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:39:05,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2025-01-10 01:39:06,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05aa99c2d/b71daf20bf6049be9a842e841fe1df13/FLAG878a18ca8 [2025-01-10 01:39:06,751 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:39:06,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2025-01-10 01:39:06,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05aa99c2d/b71daf20bf6049be9a842e841fe1df13/FLAG878a18ca8 [2025-01-10 01:39:06,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05aa99c2d/b71daf20bf6049be9a842e841fe1df13 [2025-01-10 01:39:06,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:39:06,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:39:06,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:39:06,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:39:06,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:39:06,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:39:06" (1/1) ... [2025-01-10 01:39:06,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71018e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:06, skipping insertion in model container [2025-01-10 01:39:06,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:39:06" (1/1) ... [2025-01-10 01:39:06,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:39:07,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:39:07,095 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:39:07,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:39:07,173 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:39:07,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07 WrapperNode [2025-01-10 01:39:07,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:39:07,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:39:07,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:39:07,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:39:07,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,209 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 128 [2025-01-10 01:39:07,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:39:07,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:39:07,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:39:07,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:39:07,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,237 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-01-10 01:39:07,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:39:07,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:39:07,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:39:07,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:39:07,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (1/1) ... [2025-01-10 01:39:07,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:39:07,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:39:07,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:39:07,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2025-01-10 01:39:07,304 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2025-01-10 01:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-10 01:39:07,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-10 01:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2025-01-10 01:39:07,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2025-01-10 01:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:39:07,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:39:07,411 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:39:07,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:39:07,621 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-01-10 01:39:07,621 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:39:07,630 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:39:07,630 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:39:07,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:39:07 BoogieIcfgContainer [2025-01-10 01:39:07,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:39:07,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:39:07,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:39:07,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:39:07,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:39:06" (1/3) ... [2025-01-10 01:39:07,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a59430f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:39:07, skipping insertion in model container [2025-01-10 01:39:07,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:07" (2/3) ... [2025-01-10 01:39:07,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a59430f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:39:07, skipping insertion in model container [2025-01-10 01:39:07,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:39:07" (3/3) ... [2025-01-10 01:39:07,639 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2025-01-10 01:39:07,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:39:07,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test22_3-1.i that has 4 procedures, 54 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-01-10 01:39:07,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:39:07,693 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;@8f600ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:39:07,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:39:07,697 INFO L276 IsEmpty]: Start isEmpty. 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), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:39:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:39:07,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:07,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:39:07,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:07,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1168148547, now seen corresponding path program 1 times [2025-01-10 01:39:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:07,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126561702] [2025-01-10 01:39:07,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:07,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:07,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:39:07,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:39:07,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:07,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:07,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:07,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126561702] [2025-01-10 01:39:07,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126561702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:07,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:39:07,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:39:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605115183] [2025-01-10 01:39:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:07,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:39:07,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:07,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:39:07,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:39:07,987 INFO L87 Difference]: Start difference. First 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), 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-01-10 01:39:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:08,033 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2025-01-10 01:39:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:39:08,035 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-01-10 01:39:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:08,039 INFO L225 Difference]: With dead ends: 100 [2025-01-10 01:39:08,040 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 01:39:08,042 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-01-10 01:39:08,045 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 232 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-01-10 01:39:08,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 232 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:39:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 01:39:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-01-10 01:39:08,071 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-01-10 01:39:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-01-10 01:39:08,077 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2025-01-10 01:39:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:08,077 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-01-10 01:39:08,077 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-01-10 01:39:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-01-10 01:39:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:39:08,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:08,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:39:08,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:39:08,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 574661788, now seen corresponding path program 1 times [2025-01-10 01:39:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121672326] [2025-01-10 01:39:08,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:08,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:39:08,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:39:08,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:08,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121672326] [2025-01-10 01:39:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121672326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:08,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:39:08,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:39:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341004925] [2025-01-10 01:39:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:08,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:39:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:08,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:39:08,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:39:08,248 INFO L87 Difference]: Start difference. First operand 54 states and 63 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-01-10 01:39:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:08,275 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2025-01-10 01:39:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:39:08,278 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-01-10 01:39:08,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:08,280 INFO L225 Difference]: With dead ends: 85 [2025-01-10 01:39:08,281 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 01:39:08,282 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-01-10 01:39:08,283 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 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-01-10 01:39:08,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:39:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 01:39:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2025-01-10 01:39:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 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-01-10 01:39:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-01-10 01:39:08,291 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 12 [2025-01-10 01:39:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:08,292 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-01-10 01:39:08,292 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-01-10 01:39:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-01-10 01:39:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:39:08,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:08,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:39:08,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:39:08,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:08,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 636052202, now seen corresponding path program 1 times [2025-01-10 01:39:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:08,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502700341] [2025-01-10 01:39:08,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:08,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:08,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:39:08,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:39:08,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:08,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:08,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:08,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502700341] [2025-01-10 01:39:08,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502700341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:08,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:39:08,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:39:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607783862] [2025-01-10 01:39:08,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:08,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:39:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:08,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:39:08,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:39:08,426 INFO L87 Difference]: Start difference. First operand 56 states and 65 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-01-10 01:39:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:08,476 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2025-01-10 01:39:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:39:08,477 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-01-10 01:39:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:08,477 INFO L225 Difference]: With dead ends: 95 [2025-01-10 01:39:08,477 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 01:39:08,478 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-01-10 01:39:08,478 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 266 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-01-10 01:39:08,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 266 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:39:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 01:39:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2025-01-10 01:39:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 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-01-10 01:39:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-01-10 01:39:08,489 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 16 [2025-01-10 01:39:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:08,489 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-01-10 01:39:08,490 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-01-10 01:39:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-01-10 01:39:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:39:08,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:08,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:39:08,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:39:08,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:08,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash 765134921, now seen corresponding path program 1 times [2025-01-10 01:39:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:08,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486775568] [2025-01-10 01:39:08,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:39:08,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:39:08,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:08,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486775568] [2025-01-10 01:39:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486775568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:08,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:39:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:39:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167692127] [2025-01-10 01:39:08,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:08,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:39:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:08,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:39:08,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:39:08,595 INFO L87 Difference]: Start difference. First operand 59 states and 69 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-01-10 01:39:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:08,627 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2025-01-10 01:39:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:39:08,627 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-01-10 01:39:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:08,628 INFO L225 Difference]: With dead ends: 97 [2025-01-10 01:39:08,629 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 01:39:08,630 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-01-10 01:39:08,630 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:39:08,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:39:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 01:39:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 01:39:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.25) internal successors, (55), 49 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-01-10 01:39:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-01-10 01:39:08,635 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2025-01-10 01:39:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:08,635 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-01-10 01:39:08,636 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-01-10 01:39:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-01-10 01:39:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:39:08,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:08,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:39:08,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:39:08,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:08,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash 714815698, now seen corresponding path program 1 times [2025-01-10 01:39:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078843654] [2025-01-10 01:39:08,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:08,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:39:08,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:39:08,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:08,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:08,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:08,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078843654] [2025-01-10 01:39:08,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078843654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:08,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:39:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:39:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929543185] [2025-01-10 01:39:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:08,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:39:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:08,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:39:08,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:39:08,766 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-01-10 01:39:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:08,824 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2025-01-10 01:39:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:39:08,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 18 [2025-01-10 01:39:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:08,825 INFO L225 Difference]: With dead ends: 84 [2025-01-10 01:39:08,825 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:39:08,826 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-01-10 01:39:08,827 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:39:08,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 313 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:39:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:39:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 01:39:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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-01-10 01:39:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-01-10 01:39:08,834 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2025-01-10 01:39:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:08,835 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-01-10 01:39:08,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-01-10 01:39:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-01-10 01:39:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:39:08,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:08,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:39:08,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:39:08,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:08,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1450209133, now seen corresponding path program 1 times [2025-01-10 01:39:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796719322] [2025-01-10 01:39:08,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:08,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:39:08,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:39:08,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:08,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:08,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:08,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796719322] [2025-01-10 01:39:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796719322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:08,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:39:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:39:08,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538070930] [2025-01-10 01:39:08,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:08,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:39:08,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:08,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:39:08,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:39:08,931 INFO L87 Difference]: Start difference. First operand 50 states and 56 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-01-10 01:39:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:08,976 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-01-10 01:39:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:39:08,977 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-01-10 01:39:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:08,978 INFO L225 Difference]: With dead ends: 82 [2025-01-10 01:39:08,978 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:39:08,978 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-01-10 01:39:08,979 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 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-01-10 01:39:08,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:39:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:39:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 01:39:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 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-01-10 01:39:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-01-10 01:39:08,985 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2025-01-10 01:39:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:08,985 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-01-10 01:39:08,985 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-01-10 01:39:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-01-10 01:39:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:39:08,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:08,986 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-01-10 01:39:08,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:39:08,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:08,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2129349698, now seen corresponding path program 1 times [2025-01-10 01:39:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093192827] [2025-01-10 01:39:08,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:08,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:39:09,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:39:09,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:09,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:09,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093192827] [2025-01-10 01:39:09,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093192827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:09,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:39:09,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:39:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744765632] [2025-01-10 01:39:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:09,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:39:09,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:09,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:39:09,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:39:09,104 INFO L87 Difference]: Start difference. First operand 50 states and 55 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-01-10 01:39:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:09,112 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-01-10 01:39:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:39:09,116 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-01-10 01:39:09,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:09,117 INFO L225 Difference]: With dead ends: 91 [2025-01-10 01:39:09,117 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:39:09,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:39:09,117 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 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-01-10 01:39:09,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:39:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:39:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-10 01:39:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.225) internal successors, (49), 44 states have internal predecessors, (49), 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-01-10 01:39:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-01-10 01:39:09,123 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 23 [2025-01-10 01:39:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-01-10 01:39:09,123 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-01-10 01:39:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-01-10 01:39:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:39:09,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:09,125 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-01-10 01:39:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:39:09,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:09,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2003043345, now seen corresponding path program 1 times [2025-01-10 01:39:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238106497] [2025-01-10 01:39:09,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:09,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:39:09,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:39:09,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:09,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238106497] [2025-01-10 01:39:09,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238106497] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:39:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034871813] [2025-01-10 01:39:09,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:09,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:39:09,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:39:09,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:39:09,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:39:09,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:39:09,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:39:09,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:09,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:09,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-01-10 01:39:09,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:39:09,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 01:39:09,489 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-01-10 01:39:09,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:39:09,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:39:09,509 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-01-10 01:39:09,551 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 19 treesize of output 7 [2025-01-10 01:39:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:39:09,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:39:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034871813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:09,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:39:09,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-01-10 01:39:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475728310] [2025-01-10 01:39:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:09,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:39:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:09,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:39:09,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=109, Unknown=1, NotChecked=20, Total=156 [2025-01-10 01:39:09,568 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-01-10 01:39:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:09,686 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-01-10 01:39:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:39:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-01-10 01:39:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:09,688 INFO L225 Difference]: With dead ends: 53 [2025-01-10 01:39:09,688 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:39:09,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182 [2025-01-10 01:39:09,689 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:39:09,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 241 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2025-01-10 01:39:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:39:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-01-10 01:39:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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-01-10 01:39:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-01-10 01:39:09,692 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2025-01-10 01:39:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:09,693 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-01-10 01:39:09,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-01-10 01:39:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-01-10 01:39:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:39:09,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:09,693 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-01-10 01:39:09,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:39:09,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:39:09,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:09,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1964801435, now seen corresponding path program 1 times [2025-01-10 01:39:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049866597] [2025-01-10 01:39:09,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:09,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:39:09,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:39:09,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:09,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:10,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:10,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049866597] [2025-01-10 01:39:10,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049866597] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:39:10,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836499400] [2025-01-10 01:39:10,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:10,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:39:10,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:39:10,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:39:10,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:39:10,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:39:10,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:39:10,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:10,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:10,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-01-10 01:39:10,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:39:10,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:39:10,251 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-01-10 01:39:10,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:39:10,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:39:10,269 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-01-10 01:39:10,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:39:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:39:10,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:39:10,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836499400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:10,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:39:10,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2025-01-10 01:39:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245605494] [2025-01-10 01:39:10,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:10,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:39:10,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:10,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:39:10,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2025-01-10 01:39:10,346 INFO L87 Difference]: Start difference. First operand 50 states and 55 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-01-10 01:39:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:10,481 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-01-10 01:39:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:39:10,482 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-01-10 01:39:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:10,482 INFO L225 Difference]: With dead ends: 53 [2025-01-10 01:39:10,482 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:39:10,483 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-01-10 01:39:10,483 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:39:10,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2025-01-10 01:39:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:39:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2025-01-10 01:39:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.175) 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-01-10 01:39:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-01-10 01:39:10,487 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2025-01-10 01:39:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:10,487 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-01-10 01:39:10,487 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-01-10 01:39:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-01-10 01:39:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:39:10,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:10,488 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] [2025-01-10 01:39:10,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:39:10,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:39:10,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:10,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2055305755, now seen corresponding path program 1 times [2025-01-10 01:39:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:10,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36462130] [2025-01-10 01:39:10,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:10,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:10,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:39:10,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:39:10,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:10,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:39:10,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:10,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36462130] [2025-01-10 01:39:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36462130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:39:10,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:39:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:39:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016955437] [2025-01-10 01:39:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:39:10,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:39:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:39:10,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:39:10,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:39:10,807 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-01-10 01:39:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:39:10,836 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2025-01-10 01:39:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:39:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 30 [2025-01-10 01:39:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:39:10,837 INFO L225 Difference]: With dead ends: 71 [2025-01-10 01:39:10,837 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 01:39:10,838 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-01-10 01:39:10,838 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 252 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-01-10 01:39:10,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 252 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:39:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 01:39:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 01:39:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.15) internal successors, (46), 42 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-01-10 01:39:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-01-10 01:39:10,845 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2025-01-10 01:39:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:39:10,845 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-01-10 01:39:10,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-01-10 01:39:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-01-10 01:39:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:39:10,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:39:10,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:39:10,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:39:10,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:39:10,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:39:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 936684971, now seen corresponding path program 1 times [2025-01-10 01:39:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:39:10,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662358840] [2025-01-10 01:39:10,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:39:10,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:39:10,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:39:10,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:10,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:39:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662358840] [2025-01-10 01:39:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662358840] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:39:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248751206] [2025-01-10 01:39:10,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:39:10,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:39:10,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:39:10,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:39:10,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:39:11,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:39:11,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:39:11,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:39:11,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:39:11,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 146 conjuncts are in the unsatisfiable core [2025-01-10 01:39:11,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:39:11,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:39:11,243 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-01-10 01:39:11,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:39:11,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:39:11,260 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-01-10 01:39:11,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:39:11,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:39:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:39:11,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:40:21,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248751206] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:21,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:40:21,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 19] total 22 [2025-01-10 01:40:21,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543074404] [2025-01-10 01:40:21,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:40:21,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:40:21,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:21,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:40:21,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=833, Unknown=16, NotChecked=58, Total=992 [2025-01-10 01:40:21,141 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:40:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:37,899 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2025-01-10 01:40:37,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:40:37,900 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2025-01-10 01:40:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:37,900 INFO L225 Difference]: With dead ends: 99 [2025-01-10 01:40:37,901 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 01:40:37,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 80.1s TimeCoverageRelationStatistics Valid=141, Invalid=1406, Unknown=17, NotChecked=76, Total=1640 [2025-01-10 01:40:37,902 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:37,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 383 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 436 Invalid, 0 Unknown, 100 Unchecked, 6.3s Time] [2025-01-10 01:40:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 01:40:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-01-10 01:40:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 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-01-10 01:40:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-01-10 01:40:37,905 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2025-01-10 01:40:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:37,905 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-01-10 01:40:37,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:40:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-01-10 01:40:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 01:40:37,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:37,906 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:37,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:40:38,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:38,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:40:38,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2073125879, now seen corresponding path program 1 times [2025-01-10 01:40:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:38,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241811104] [2025-01-10 01:40:38,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:38,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:40:38,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:40:38,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:38,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241811104] [2025-01-10 01:40:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241811104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363396976] [2025-01-10 01:40:38,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:38,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:38,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:38,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:40:38,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:40:38,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:40:38,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:40:38,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:38,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:38,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 153 conjuncts are in the unsatisfiable core [2025-01-10 01:40:38,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:41,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:40:41,974 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-01-10 01:40:42,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:40:42,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:40:42,150 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-01-10 01:40:44,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:46,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:47,199 INFO L312 TraceCheckSpWp]: Computing backward predicates...