./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version c00e63dc
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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8be6ce3aed04a0f72fff72ce21ac27fefd98e972dd5fa46b07e62cac65a15dd5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 21:45:38,788 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 21:45:38,833 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 21:45:38,837 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 21:45:38,839 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 21:45:38,862 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 21:45:38,863 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 21:45:38,863 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 21:45:38,863 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 21:45:38,863 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 21:45:38,863 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 21:45:38,863 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 21:45:38,863 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 21:45:38,863 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 21:45:38,863 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 21:45:38,864 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 21:45:38,864 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 21:45:38,864 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 21:45:38,864 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 21:45:38,864 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 21:45:38,864 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 21:45:38,864 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 21:45:38,864 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 21:45:38,868 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 21:45:38,869 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:45:38,869 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 21:45:38,869 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 21:45:38,869 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 ! call(reach_error())) )


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 -> 8be6ce3aed04a0f72fff72ce21ac27fefd98e972dd5fa46b07e62cac65a15dd5
[2025-02-05 21:45:39,114 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 21:45:39,120 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 21:45:39,121 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 21:45:39,122 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 21:45:39,122 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 21:45:39,123 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i
[2025-02-05 21:45:40,247 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51e6719b3/464d9bc6fb994e6d91cbf805df4dfe61/FLAGde3843f10
[2025-02-05 21:45:40,493 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 21:45:40,493 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i
[2025-02-05 21:45:40,500 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51e6719b3/464d9bc6fb994e6d91cbf805df4dfe61/FLAGde3843f10
[2025-02-05 21:45:40,820 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51e6719b3/464d9bc6fb994e6d91cbf805df4dfe61
[2025-02-05 21:45:40,822 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 21:45:40,823 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 21:45:40,824 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 21:45:40,824 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 21:45:40,827 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 21:45:40,828 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:45:40" (1/1) ...
[2025-02-05 21:45:40,828 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3e1e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:40, skipping insertion in model container
[2025-02-05 21:45:40,829 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:45:40" (1/1) ...
[2025-02-05 21:45:40,847 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 21:45:40,934 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i[915,928]
[2025-02-05 21:45:40,994 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:45:41,012 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 21:45:41,020 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i[915,928]
[2025-02-05 21:45:41,052 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:45:41,068 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 21:45:41,069 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41 WrapperNode
[2025-02-05 21:45:41,069 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 21:45:41,070 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 21:45:41,070 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 21:45:41,070 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 21:45:41,075 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,084 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,111 INFO  L138                Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240
[2025-02-05 21:45:41,112 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 21:45:41,112 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 21:45:41,112 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 21:45:41,112 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 21:45:41,118 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,118 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,121 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,150 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 21:45:41,150 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,150 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,159 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,160 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,164 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,165 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,170 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 21:45:41,171 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 21:45:41,171 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 21:45:41,171 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 21:45:41,171 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (1/1) ...
[2025-02-05 21:45:41,177 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:45:41,188 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:45:41,200 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-05 21:45:41,204 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-05 21:45:41,221 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 21:45:41,221 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 21:45:41,222 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 21:45:41,222 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 21:45:41,222 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 21:45:41,222 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 21:45:41,289 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 21:45:41,291 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 21:45:41,595 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L168: havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;
[2025-02-05 21:45:41,616 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2025-02-05 21:45:41,617 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 21:45:41,637 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 21:45:41,637 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 21:45:41,638 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:45:41 BoogieIcfgContainer
[2025-02-05 21:45:41,638 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 21:45:41,640 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 21:45:41,640 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 21:45:41,643 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 21:45:41,643 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:45:40" (1/3) ...
[2025-02-05 21:45:41,644 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43653e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:45:41, skipping insertion in model container
[2025-02-05 21:45:41,644 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:41" (2/3) ...
[2025-02-05 21:45:41,644 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43653e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:45:41, skipping insertion in model container
[2025-02-05 21:45:41,644 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:45:41" (3/3) ...
[2025-02-05 21:45:41,645 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-33.i
[2025-02-05 21:45:41,655 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 21:45:41,657 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-33.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 21:45:41,694 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 21:45:41,703 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;@4fd1c8d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 21:45:41,703 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 21:45:41,706 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 100 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-05 21:45:41,715 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-02-05 21:45:41,715 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:45:41,716 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:45:41,716 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:45:41,719 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:45:41,720 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821730053, now seen corresponding path program 1 times
[2025-02-05 21:45:41,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:45:41,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055503768]
[2025-02-05 21:45:41,726 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:45:41,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:45:41,790 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-05 21:45:41,809 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-05 21:45:41,810 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:45:41,810 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:45:41,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked.
[2025-02-05 21:45:41,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:45:41,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055503768]
[2025-02-05 21:45:41,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055503768] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:45:41,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694539986]
[2025-02-05 21:45:41,989 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:45:41,990 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:45:41,990 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:45:41,993 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-05 21:45:41,995 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-05 21:45:42,086 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-05 21:45:42,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-05 21:45:42,169 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:45:42,169 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:45:42,172 INFO  L256         TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 21:45:42,182 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:45:42,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked.
[2025-02-05 21:45:42,216 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 21:45:42,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [694539986] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:45:42,217 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 21:45:42,217 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 21:45:42,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665768586]
[2025-02-05 21:45:42,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:45:42,221 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 21:45:42,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:45:42,237 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 21:45:42,237 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:45:42,239 INFO  L87              Difference]: Start difference. First operand  has 100 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32)
[2025-02-05 21:45:42,275 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:45:42,276 INFO  L93              Difference]: Finished difference Result 194 states and 335 transitions.
[2025-02-05 21:45:42,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 21:45:42,278 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204
[2025-02-05 21:45:42,279 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:45:42,284 INFO  L225             Difference]: With dead ends: 194
[2025-02-05 21:45:42,284 INFO  L226             Difference]: Without dead ends: 97
[2025-02-05 21:45:42,288 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:45:42,292 INFO  L435           NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 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-02-05 21:45:42,294 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:45:42,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2025-02-05 21:45:42,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2025-02-05 21:45:42,330 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-05 21:45:42,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions.
[2025-02-05 21:45:42,339 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 204
[2025-02-05 21:45:42,339 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:45:42,340 INFO  L471      AbstractCegarLoop]: Abstraction has 97 states and 148 transitions.
[2025-02-05 21:45:42,340 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32)
[2025-02-05 21:45:42,340 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions.
[2025-02-05 21:45:42,343 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-02-05 21:45:42,343 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:45:42,343 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:45:42,353 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 21:45:42,544 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 21:45:42,544 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:45:42,544 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:45:42,545 INFO  L85        PathProgramCache]: Analyzing trace with hash -1908150459, now seen corresponding path program 1 times
[2025-02-05 21:45:42,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:45:42,545 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4231894]
[2025-02-05 21:45:42,545 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:45:42,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:45:42,566 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-05 21:45:42,722 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-05 21:45:42,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:45:42,727 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:45:43,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-02-05 21:45:43,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:45:43,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4231894]
[2025-02-05 21:45:43,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4231894] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:45:43,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:45:43,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:45:43,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853569677]
[2025-02-05 21:45:43,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:45:43,392 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:45:43,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:45:43,393 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:45:43,394 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:45:43,394 INFO  L87              Difference]: Start difference. First operand 97 states and 148 transitions. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-02-05 21:45:43,711 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:45:43,712 INFO  L93              Difference]: Finished difference Result 290 states and 446 transitions.
[2025-02-05 21:45:43,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:45:43,712 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204
[2025-02-05 21:45:43,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:45:43,716 INFO  L225             Difference]: With dead ends: 290
[2025-02-05 21:45:43,717 INFO  L226             Difference]: Without dead ends: 196
[2025-02-05 21:45:43,718 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-05 21:45:43,720 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 113 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:45:43,720 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 374 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 21:45:43,721 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-02-05 21:45:43,757 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 182.
[2025-02-05 21:45:43,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 182 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 115 states have internal predecessors, (153), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-05 21:45:43,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 281 transitions.
[2025-02-05 21:45:43,763 INFO  L78                 Accepts]: Start accepts. Automaton has 182 states and 281 transitions. Word has length 204
[2025-02-05 21:45:43,764 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:45:43,764 INFO  L471      AbstractCegarLoop]: Abstraction has 182 states and 281 transitions.
[2025-02-05 21:45:43,764 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-02-05 21:45:43,765 INFO  L276                IsEmpty]: Start isEmpty. Operand 182 states and 281 transitions.
[2025-02-05 21:45:43,766 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-02-05 21:45:43,768 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:45:43,769 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:45:43,769 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 21:45:43,769 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:45:43,770 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:45:43,770 INFO  L85        PathProgramCache]: Analyzing trace with hash -1577161691, now seen corresponding path program 1 times
[2025-02-05 21:45:43,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:45:43,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122090295]
[2025-02-05 21:45:43,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:45:43,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:45:43,790 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-02-05 21:45:43,812 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-02-05 21:45:43,812 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:45:43,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:45:43,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-02-05 21:45:43,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:45:43,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122090295]
[2025-02-05 21:45:43,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122090295] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:45:43,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:45:43,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:45:43,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793298497]
[2025-02-05 21:45:43,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:45:43,997 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:45:43,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:45:43,997 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:45:43,997 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:45:43,998 INFO  L87              Difference]: Start difference. First operand 182 states and 281 transitions. Second operand  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-02-05 21:45:44,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:45:44,198 INFO  L93              Difference]: Finished difference Result 299 states and 457 transitions.
[2025-02-05 21:45:44,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:45:44,199 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205
[2025-02-05 21:45:44,199 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:45:44,200 INFO  L225             Difference]: With dead ends: 299
[2025-02-05 21:45:44,202 INFO  L226             Difference]: Without dead ends: 192
[2025-02-05 21:45:44,203 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-05 21:45:44,204 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 110 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:45:44,205 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 379 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 21:45:44,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 192 states.
[2025-02-05 21:45:44,237 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183.
[2025-02-05 21:45:44,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 183 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 116 states have internal predecessors, (153), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-05 21:45:44,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 281 transitions.
[2025-02-05 21:45:44,242 INFO  L78                 Accepts]: Start accepts. Automaton has 183 states and 281 transitions. Word has length 205
[2025-02-05 21:45:44,242 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:45:44,242 INFO  L471      AbstractCegarLoop]: Abstraction has 183 states and 281 transitions.
[2025-02-05 21:45:44,242 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-02-05 21:45:44,243 INFO  L276                IsEmpty]: Start isEmpty. Operand 183 states and 281 transitions.
[2025-02-05 21:45:44,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 21:45:44,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:45:44,244 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:45:44,244 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 21:45:44,248 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:45:44,248 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:45:44,248 INFO  L85        PathProgramCache]: Analyzing trace with hash -184314969, now seen corresponding path program 1 times
[2025-02-05 21:45:44,249 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:45:44,249 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96985779]
[2025-02-05 21:45:44,249 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:45:44,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:45:44,273 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 21:45:44,363 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 21:45:44,364 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:45:44,364 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:45:52,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-02-05 21:45:52,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:45:52,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96985779]
[2025-02-05 21:45:52,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96985779] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:45:52,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:45:52,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-02-05 21:45:52,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684900299]
[2025-02-05 21:45:52,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:45:52,318 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-05 21:45:52,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:45:52,318 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-05 21:45:52,318 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2025-02-05 21:45:52,319 INFO  L87              Difference]: Start difference. First operand 183 states and 281 transitions. Second operand  has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-02-05 21:45:54,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:45:54,296 INFO  L93              Difference]: Finished difference Result 244 states and 352 transitions.
[2025-02-05 21:45:54,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-05 21:45:54,297 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206
[2025-02-05 21:45:54,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:45:54,299 INFO  L225             Difference]: With dead ends: 244
[2025-02-05 21:45:54,299 INFO  L226             Difference]: Without dead ends: 242
[2025-02-05 21:45:54,300 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600
[2025-02-05 21:45:54,300 INFO  L435           NwaCegarLoop]: 122 mSDtfsCounter, 270 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 21:45:54,300 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 869 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 21:45:54,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 242 states.
[2025-02-05 21:45:54,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 197.
[2025-02-05 21:45:54,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 197 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-05 21:45:54,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 298 transitions.
[2025-02-05 21:45:54,322 INFO  L78                 Accepts]: Start accepts. Automaton has 197 states and 298 transitions. Word has length 206
[2025-02-05 21:45:54,322 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:45:54,323 INFO  L471      AbstractCegarLoop]: Abstraction has 197 states and 298 transitions.
[2025-02-05 21:45:54,323 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-02-05 21:45:54,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 197 states and 298 transitions.
[2025-02-05 21:45:54,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 21:45:54,324 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:45:54,324 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:45:54,325 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 21:45:54,325 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:45:54,325 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:45:54,325 INFO  L85        PathProgramCache]: Analyzing trace with hash -380828474, now seen corresponding path program 1 times
[2025-02-05 21:45:54,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:45:54,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677431721]
[2025-02-05 21:45:54,325 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:45:54,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:45:54,336 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 21:45:54,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 21:45:54,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:45:54,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:45:59,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 57 proven. 123 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked.
[2025-02-05 21:45:59,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:45:59,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677431721]
[2025-02-05 21:45:59,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677431721] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:45:59,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532221350]
[2025-02-05 21:45:59,479 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:45:59,479 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:45:59,479 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:45:59,481 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-05 21:45:59,483 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-05 21:45:59,530 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 21:45:59,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 21:45:59,576 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:45:59,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:45:59,578 INFO  L256         TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-02-05 21:45:59,586 INFO  L279         TraceCheckSpWp]: Computing forward predicates...