./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-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 a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:35:10,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:35:11,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:35:11,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:35:11,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:35:11,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:35:11,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:35:11,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:35:11,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:35:11,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:35:11,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:35:11,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:35:11,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:35:11,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:35:11,085 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:35:11,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:35:11,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:35:11,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:35:11,086 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:35:11,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:35:11,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:35:11,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:35:11,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:35:11,088 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 -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2025-02-08 13:35:11,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:35:11,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:35:11,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:35:11,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:35:11,317 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:35:11,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2025-02-08 13:35:12,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47e86254e/f314dd5c43c14473a82e9c081dbabd02/FLAGa00b0dc98 [2025-02-08 13:35:12,903 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:35:12,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2025-02-08 13:35:12,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47e86254e/f314dd5c43c14473a82e9c081dbabd02/FLAGa00b0dc98 [2025-02-08 13:35:12,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47e86254e/f314dd5c43c14473a82e9c081dbabd02 [2025-02-08 13:35:12,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:35:12,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:35:12,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:35:12,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:35:12,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:35:12,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:35:12" (1/1) ... [2025-02-08 13:35:12,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ae6b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:12, skipping insertion in model container [2025-02-08 13:35:12,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:35:12" (1/1) ... [2025-02-08 13:35:12,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:35:13,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:35:13,271 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:35:13,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:35:13,411 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:35:13,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13 WrapperNode [2025-02-08 13:35:13,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:35:13,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:35:13,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:35:13,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:35:13,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,496 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 823 [2025-02-08 13:35:13,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:35:13,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:35:13,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:35:13,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:35:13,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,580 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [156, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 42 writes are split as follows [42, 0]. [2025-02-08 13:35:13,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:35:13,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:35:13,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:35:13,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:35:13,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (1/1) ... [2025-02-08 13:35:13,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:35:13,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:13,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:35:13,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:35:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:35:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:35:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 13:35:13,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 13:35:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:35:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:35:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:35:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:35:13,678 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:35:13,678 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:35:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:35:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:35:13,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:35:13,823 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:35:13,824 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:35:14,520 INFO L? ?]: Removed 211 outVars from TransFormulas that were not future-live. [2025-02-08 13:35:14,521 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:35:14,543 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:35:14,544 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:35:14,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:35:14 BoogieIcfgContainer [2025-02-08 13:35:14,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:35:14,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:35:14,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:35:14,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:35:14,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:35:12" (1/3) ... [2025-02-08 13:35:14,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fcd612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:35:14, skipping insertion in model container [2025-02-08 13:35:14,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:13" (2/3) ... [2025-02-08 13:35:14,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fcd612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:35:14, skipping insertion in model container [2025-02-08 13:35:14,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:35:14" (3/3) ... [2025-02-08 13:35:14,550 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-1.i [2025-02-08 13:35:14,560 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:35:14,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test1-1.i that has 4 procedures, 243 locations, 1 initial locations, 20 loop locations, and 6 error locations. [2025-02-08 13:35:14,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:35:14,609 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;@e06e54d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:35:14,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:35:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 216 states have (on average 1.6296296296296295) internal successors, (352), 232 states have internal predecessors, (352), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:35:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 13:35:14,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:14,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 13:35:14,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:35:14,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash 13330444, now seen corresponding path program 1 times [2025-02-08 13:35:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:14,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740334198] [2025-02-08 13:35:14,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:14,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 13:35:14,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 13:35:14,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:14,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:35:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:14,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740334198] [2025-02-08 13:35:14,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740334198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:14,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:35:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903244195] [2025-02-08 13:35:14,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:14,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:35:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:14,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:35:14,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:14,776 INFO L87 Difference]: Start difference. First operand has 239 states, 216 states have (on average 1.6296296296296295) internal successors, (352), 232 states have internal predecessors, (352), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:14,923 INFO L93 Difference]: Finished difference Result 669 states and 1079 transitions. [2025-02-08 13:35:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:35:14,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 13:35:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:14,934 INFO L225 Difference]: With dead ends: 669 [2025-02-08 13:35:14,934 INFO L226 Difference]: Without dead ends: 413 [2025-02-08 13:35:14,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:14,943 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 274 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:14,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 627 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-08 13:35:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 224. [2025-02-08 13:35:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 215 states have (on average 1.4232558139534883) internal successors, (306), 219 states have internal predecessors, (306), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:35:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 312 transitions. [2025-02-08 13:35:14,988 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 312 transitions. Word has length 4 [2025-02-08 13:35:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:14,988 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 312 transitions. [2025-02-08 13:35:14,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 312 transitions. [2025-02-08 13:35:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:35:14,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:14,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:14,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:35:14,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:35:14,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:14,991 INFO L85 PathProgramCache]: Analyzing trace with hash 371510989, now seen corresponding path program 1 times [2025-02-08 13:35:14,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:14,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461957006] [2025-02-08 13:35:14,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:15,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:35:15,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:35:15,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:15,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:35:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461957006] [2025-02-08 13:35:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461957006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:15,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:15,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:35:15,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365440779] [2025-02-08 13:35:15,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:15,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:35:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:15,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:35:15,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:35:15,305 INFO L87 Difference]: Start difference. First operand 224 states and 312 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:15,398 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2025-02-08 13:35:15,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:35:15,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-08 13:35:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:15,400 INFO L225 Difference]: With dead ends: 445 [2025-02-08 13:35:15,400 INFO L226 Difference]: Without dead ends: 227 [2025-02-08 13:35:15,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:35:15,400 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 105 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:15,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 690 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-08 13:35:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2025-02-08 13:35:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 215 states have (on average 1.3906976744186046) internal successors, (299), 219 states have internal predecessors, (299), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:35:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 305 transitions. [2025-02-08 13:35:15,411 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 305 transitions. Word has length 78 [2025-02-08 13:35:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:15,411 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 305 transitions. [2025-02-08 13:35:15,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 305 transitions. [2025-02-08 13:35:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:35:15,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:15,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:15,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:35:15,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:35:15,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1014432730, now seen corresponding path program 1 times [2025-02-08 13:35:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:15,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508336945] [2025-02-08 13:35:15,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:15,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:35:15,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:35:15,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:15,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:35:15,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:15,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508336945] [2025-02-08 13:35:15,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508336945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:15,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:15,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:35:15,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000752215] [2025-02-08 13:35:15,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:15,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:35:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:15,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:35:15,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:15,565 INFO L87 Difference]: Start difference. First operand 224 states and 305 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:15,670 INFO L93 Difference]: Finished difference Result 568 states and 790 transitions. [2025-02-08 13:35:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:35:15,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-08 13:35:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:15,672 INFO L225 Difference]: With dead ends: 568 [2025-02-08 13:35:15,673 INFO L226 Difference]: Without dead ends: 350 [2025-02-08 13:35:15,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:15,675 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 134 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:15,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 546 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-08 13:35:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-02-08 13:35:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 341 states have (on average 1.4193548387096775) internal successors, (484), 345 states have internal predecessors, (484), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:35:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 490 transitions. [2025-02-08 13:35:15,690 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 490 transitions. Word has length 78 [2025-02-08 13:35:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:15,690 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 490 transitions. [2025-02-08 13:35:15,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 490 transitions. [2025-02-08 13:35:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 13:35:15,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:15,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:15,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:35:15,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:35:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1783100641, now seen corresponding path program 1 times [2025-02-08 13:35:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:15,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418685513] [2025-02-08 13:35:15,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:15,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 13:35:15,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 13:35:15,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:15,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:35:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:16,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418685513] [2025-02-08 13:35:16,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418685513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:16,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:35:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844178160] [2025-02-08 13:35:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:35:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:35:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:35:16,021 INFO L87 Difference]: Start difference. First operand 350 states and 490 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:16,115 INFO L93 Difference]: Finished difference Result 415 states and 575 transitions. [2025-02-08 13:35:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:35:16,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2025-02-08 13:35:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:16,117 INFO L225 Difference]: With dead ends: 415 [2025-02-08 13:35:16,117 INFO L226 Difference]: Without dead ends: 413 [2025-02-08 13:35:16,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-08 13:35:16,118 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 185 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:16,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 885 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-08 13:35:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-08 13:35:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 401 states have (on average 1.399002493765586) internal successors, (561), 405 states have internal predecessors, (561), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 573 transitions. [2025-02-08 13:35:16,130 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 573 transitions. Word has length 93 [2025-02-08 13:35:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:16,130 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 573 transitions. [2025-02-08 13:35:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 573 transitions. [2025-02-08 13:35:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 13:35:16,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:16,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:16,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:35:16,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:35:16,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:16,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1769700644, now seen corresponding path program 1 times [2025-02-08 13:35:16,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:16,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425817151] [2025-02-08 13:35:16,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:16,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 13:35:16,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 13:35:16,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:35:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425817151] [2025-02-08 13:35:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425817151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239477514] [2025-02-08 13:35:16,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:16,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:16,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:16,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:16,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:35:16,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 13:35:16,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 13:35:16,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:16,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:16,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:35:16,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:35:16,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:35:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:35:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239477514] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:35:16,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:35:16,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 13:35:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896101173] [2025-02-08 13:35:16,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:35:16,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:35:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:16,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:35:16,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:35:16,893 INFO L87 Difference]: Start difference. First operand 413 states and 573 transitions. Second operand has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:35:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:17,069 INFO L93 Difference]: Finished difference Result 626 states and 870 transitions. [2025-02-08 13:35:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:35:17,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 97 [2025-02-08 13:35:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:17,075 INFO L225 Difference]: With dead ends: 626 [2025-02-08 13:35:17,075 INFO L226 Difference]: Without dead ends: 610 [2025-02-08 13:35:17,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:35:17,075 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1276 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:17,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1336 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-02-08 13:35:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2025-02-08 13:35:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 595 states have (on average 1.4016806722689075) internal successors, (834), 599 states have internal predecessors, (834), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:35:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 852 transitions. [2025-02-08 13:35:17,115 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 852 transitions. Word has length 97 [2025-02-08 13:35:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:17,116 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 852 transitions. [2025-02-08 13:35:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:35:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 852 transitions. [2025-02-08 13:35:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 13:35:17,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:17,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:17,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:35:17,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:17,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:35:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash 448240973, now seen corresponding path program 1 times [2025-02-08 13:35:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307211464] [2025-02-08 13:35:17,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:17,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 13:35:17,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 13:35:17,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:17,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:35:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307211464] [2025-02-08 13:35:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307211464] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664801729] [2025-02-08 13:35:17,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:17,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:17,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:17,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:17,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:35:17,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 13:35:17,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 13:35:17,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:17,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:17,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:35:17,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:17,885 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 11 treesize of output 7 [2025-02-08 13:35:17,904 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 21 treesize of output 20 [2025-02-08 13:35:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:35:18,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:35:18,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664801729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:18,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:35:18,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 14 [2025-02-08 13:35:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673924674] [2025-02-08 13:35:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:18,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 13:35:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:18,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 13:35:18,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:35:18,702 INFO L87 Difference]: Start difference. First operand 610 states and 852 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:19,972 INFO L93 Difference]: Finished difference Result 1183 states and 1646 transitions. [2025-02-08 13:35:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:35:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-02-08 13:35:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:19,975 INFO L225 Difference]: With dead ends: 1183 [2025-02-08 13:35:19,975 INFO L226 Difference]: Without dead ends: 658 [2025-02-08 13:35:19,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-02-08 13:35:19,978 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 539 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:19,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1445 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 13:35:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-02-08 13:35:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 635. [2025-02-08 13:35:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 620 states have (on average 1.3935483870967742) internal successors, (864), 624 states have internal predecessors, (864), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:35:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 882 transitions. [2025-02-08 13:35:20,007 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 882 transitions. Word has length 99 [2025-02-08 13:35:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:20,008 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 882 transitions. [2025-02-08 13:35:20,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 882 transitions. [2025-02-08 13:35:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 13:35:20,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:20,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:20,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:35:20,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:20,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:35:20,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash 448523926, now seen corresponding path program 1 times [2025-02-08 13:35:20,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:20,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923022679] [2025-02-08 13:35:20,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:20,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:20,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:35:20,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:35:20,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:20,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:35:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923022679] [2025-02-08 13:35:20,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923022679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735140931] [2025-02-08 13:35:20,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:20,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:20,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:20,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:20,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:35:20,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:35:20,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:35:20,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:20,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:20,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 13:35:20,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:49,146 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 13:36:42,734 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 13:36:53,556 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)