./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-90.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_loopvsstraightlinecode_50-1loop_file-90.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 fac5641064dafa2cff3f5bb36fec0428c2326aea5290de8df19e073ecb1f4396
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 01:42:12,090 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 01:42:12,148 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-06 01:42:12,156 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 01:42:12,156 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 01:42:12,178 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 01:42:12,179 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 01:42:12,179 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 01:42:12,179 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 01:42:12,180 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 01:42:12,180 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 01:42:12,180 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 01:42:12,181 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 01:42:12,181 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 01:42:12,181 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 01:42:12,181 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 01:42:12,181 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 01:42:12,181 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 01:42:12,181 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 01:42:12,181 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 01:42:12,182 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 01:42:12,182 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 01:42:12,182 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 01:42:12,182 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 01:42:12,182 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 01:42:12,182 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 01:42:12,182 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 01:42:12,182 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 01:42:12,182 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 01:42:12,183 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 01:42:12,183 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-06 01:42:12,183 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 01:42:12,183 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 01:42:12,183 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 01:42:12,183 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 01:42:12,183 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 01:42:12,184 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 01:42:12,184 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 01:42:12,184 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-06 01:42:12,184 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 01:42:12,184 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 01:42:12,184 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 01:42:12,184 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 01:42:12,184 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 -> fac5641064dafa2cff3f5bb36fec0428c2326aea5290de8df19e073ecb1f4396
[2025-02-06 01:42:12,409 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 01:42:12,417 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 01:42:12,419 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 01:42:12,420 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 01:42:12,420 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 01:42:12,421 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-90.i
[2025-02-06 01:42:13,685 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6204e754b/21aabbc49fd2440fa52336a6cbc037a3/FLAG9c7990f96
[2025-02-06 01:42:13,938 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 01:42:13,938 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-90.i
[2025-02-06 01:42:13,945 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6204e754b/21aabbc49fd2440fa52336a6cbc037a3/FLAG9c7990f96
[2025-02-06 01:42:13,958 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6204e754b/21aabbc49fd2440fa52336a6cbc037a3
[2025-02-06 01:42:13,961 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 01:42:13,962 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 01:42:13,963 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 01:42:13,964 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 01:42:13,966 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 01:42:13,967 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:42:13" (1/1) ...
[2025-02-06 01:42:13,967 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155271c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:13, skipping insertion in model container
[2025-02-06 01:42:13,969 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:42:13" (1/1) ...
[2025-02-06 01:42:13,982 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 01:42:14,083 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_loopvsstraightlinecode_50-1loop_file-90.i[915,928]
[2025-02-06 01:42:14,119 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 01:42:14,130 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 01:42:14,139 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_loopvsstraightlinecode_50-1loop_file-90.i[915,928]
[2025-02-06 01:42:14,169 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 01:42:14,186 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 01:42:14,187 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14 WrapperNode
[2025-02-06 01:42:14,188 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 01:42:14,189 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 01:42:14,189 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 01:42:14,189 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 01:42:14,194 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,205 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,234 INFO  L138                Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152
[2025-02-06 01:42:14,234 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 01:42:14,235 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 01:42:14,235 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 01:42:14,235 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 01:42:14,241 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,242 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,243 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,259 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-06 01:42:14,259 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,260 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,269 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,269 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,270 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,271 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,276 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 01:42:14,277 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 01:42:14,277 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 01:42:14,277 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 01:42:14,279 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (1/1) ...
[2025-02-06 01:42:14,285 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 01:42:14,293 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:42:14,304 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-06 01:42:14,306 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-06 01:42:14,323 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 01:42:14,323 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-06 01:42:14,323 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-06 01:42:14,323 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-06 01:42:14,323 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 01:42:14,323 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 01:42:14,384 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 01:42:14,386 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 01:42:14,578 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~bitwise14#1;
[2025-02-06 01:42:14,612 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-02-06 01:42:14,613 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 01:42:14,640 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 01:42:14,640 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 01:42:14,640 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:14 BoogieIcfgContainer
[2025-02-06 01:42:14,640 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 01:42:14,642 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 01:42:14,642 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 01:42:14,647 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 01:42:14,648 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:42:13" (1/3) ...
[2025-02-06 01:42:14,649 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2872f30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:42:14, skipping insertion in model container
[2025-02-06 01:42:14,649 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:14" (2/3) ...
[2025-02-06 01:42:14,649 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2872f30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:42:14, skipping insertion in model container
[2025-02-06 01:42:14,649 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:14" (3/3) ...
[2025-02-06 01:42:14,650 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-90.i
[2025-02-06 01:42:14,661 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 01:42:14,663 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-90.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-06 01:42:14,700 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 01:42:14,707 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;@20425414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 01:42:14,707 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-06 01:42:14,709 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 64 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-02-06 01:42:14,715 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-02-06 01:42:14,715 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:42:14,716 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:14,716 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:42:14,719 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:42:14,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -868108347, now seen corresponding path program 1 times
[2025-02-06 01:42:14,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:42:14,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882448602]
[2025-02-06 01:42:14,724 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:14,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:42:14,776 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-02-06 01:42:14,790 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-02-06 01:42:14,790 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:14,791 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:14,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked.
[2025-02-06 01:42:14,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:42:14,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882448602]
[2025-02-06 01:42:14,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882448602] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 01:42:14,887 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31567281]
[2025-02-06 01:42:14,887 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:14,887 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:42:14,887 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:42:14,895 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-06 01:42:14,896 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-06 01:42:14,946 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-02-06 01:42:15,012 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-02-06 01:42:15,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:15,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:15,016 INFO  L256         TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-06 01:42:15,023 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:42:15,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked.
[2025-02-06 01:42:15,039 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 01:42:15,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [31567281] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:42:15,039 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-06 01:42:15,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-06 01:42:15,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169248395]
[2025-02-06 01:42:15,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:42:15,047 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-06 01:42:15,047 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:42:15,062 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 01:42:15,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 01:42:15,064 INFO  L87              Difference]: Start difference. First operand  has 64 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18)
[2025-02-06 01:42:15,082 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:42:15,082 INFO  L93              Difference]: Finished difference Result 125 states and 211 transitions.
[2025-02-06 01:42:15,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 01:42:15,084 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118
[2025-02-06 01:42:15,084 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:42:15,089 INFO  L225             Difference]: With dead ends: 125
[2025-02-06 01:42:15,089 INFO  L226             Difference]: Without dead ends: 61
[2025-02-06 01:42:15,092 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-06 01:42:15,095 INFO  L435           NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 01:42:15,097 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 01:42:15,106 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2025-02-06 01:42:15,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2025-02-06 01:42:15,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-02-06 01:42:15,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions.
[2025-02-06 01:42:15,131 INFO  L78                 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 118
[2025-02-06 01:42:15,131 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:42:15,132 INFO  L471      AbstractCegarLoop]: Abstraction has 61 states and 93 transitions.
[2025-02-06 01:42:15,133 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18)
[2025-02-06 01:42:15,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions.
[2025-02-06 01:42:15,135 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-02-06 01:42:15,136 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:42:15,136 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:15,146 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-06 01:42:15,340 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-06 01:42:15,340 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:42:15,341 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:42:15,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 1674362665, now seen corresponding path program 1 times
[2025-02-06 01:42:15,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:42:15,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920394593]
[2025-02-06 01:42:15,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:15,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:42:15,365 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-02-06 01:42:15,430 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-02-06 01:42:15,430 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:15,430 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:15,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-02-06 01:42:15,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:42:15,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920394593]
[2025-02-06 01:42:15,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920394593] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:42:15,949 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:42:15,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 01:42:15,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994724769]
[2025-02-06 01:42:15,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:42:15,950 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 01:42:15,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:42:15,951 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 01:42:15,951 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-06 01:42:15,951 INFO  L87              Difference]: Start difference. First operand 61 states and 93 transitions. Second operand  has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-02-06 01:42:16,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:42:16,145 INFO  L93              Difference]: Finished difference Result 178 states and 274 transitions.
[2025-02-06 01:42:16,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 01:42:16,146 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118
[2025-02-06 01:42:16,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:42:16,147 INFO  L225             Difference]: With dead ends: 178
[2025-02-06 01:42:16,148 INFO  L226             Difference]: Without dead ends: 120
[2025-02-06 01:42:16,148 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-06 01:42:16,151 INFO  L435           NwaCegarLoop]: 84 mSDtfsCounter, 62 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 01:42:16,152 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 239 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 01:42:16,153 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2025-02-06 01:42:16,177 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111.
[2025-02-06 01:42:16,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 111 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-02-06 01:42:16,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions.
[2025-02-06 01:42:16,179 INFO  L78                 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 118
[2025-02-06 01:42:16,179 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:42:16,179 INFO  L471      AbstractCegarLoop]: Abstraction has 111 states and 172 transitions.
[2025-02-06 01:42:16,179 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-02-06 01:42:16,179 INFO  L276                IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions.
[2025-02-06 01:42:16,180 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-02-06 01:42:16,180 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:42:16,181 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:16,181 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-06 01:42:16,181 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:42:16,181 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:42:16,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 1976967649, now seen corresponding path program 1 times
[2025-02-06 01:42:16,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:42:16,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185558824]
[2025-02-06 01:42:16,182 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:16,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:42:16,196 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-02-06 01:42:16,219 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-02-06 01:42:16,219 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:16,219 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:16,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-02-06 01:42:16,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:42:16,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185558824]
[2025-02-06 01:42:16,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185558824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:42:16,399 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:42:16,399 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 01:42:16,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694701141]
[2025-02-06 01:42:16,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:42:16,400 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 01:42:16,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:42:16,400 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 01:42:16,400 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-06 01:42:16,401 INFO  L87              Difference]: Start difference. First operand 111 states and 172 transitions. Second operand  has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-02-06 01:42:16,532 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:42:16,533 INFO  L93              Difference]: Finished difference Result 254 states and 392 transitions.
[2025-02-06 01:42:16,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 01:42:16,533 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120
[2025-02-06 01:42:16,533 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:42:16,535 INFO  L225             Difference]: With dead ends: 254
[2025-02-06 01:42:16,535 INFO  L226             Difference]: Without dead ends: 182
[2025-02-06 01:42:16,535 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-06 01:42:16,536 INFO  L435           NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 01:42:16,536 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 253 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 01:42:16,536 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2025-02-06 01:42:16,564 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172.
[2025-02-06 01:42:16,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 172 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2025-02-06 01:42:16,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions.
[2025-02-06 01:42:16,569 INFO  L78                 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 120
[2025-02-06 01:42:16,570 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:42:16,570 INFO  L471      AbstractCegarLoop]: Abstraction has 172 states and 264 transitions.
[2025-02-06 01:42:16,570 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-02-06 01:42:16,571 INFO  L276                IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions.
[2025-02-06 01:42:16,572 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-02-06 01:42:16,574 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:42:16,574 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:16,574 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-06 01:42:16,575 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:42:16,575 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:42:16,575 INFO  L85        PathProgramCache]: Analyzing trace with hash 2081826440, now seen corresponding path program 1 times
[2025-02-06 01:42:16,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:42:16,575 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030628624]
[2025-02-06 01:42:16,575 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:16,575 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:42:16,593 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-06 01:42:16,648 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-06 01:42:16,648 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:16,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:16,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked.
[2025-02-06 01:42:16,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:42:16,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030628624]
[2025-02-06 01:42:16,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030628624] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 01:42:16,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761556121]
[2025-02-06 01:42:16,866 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:16,866 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:42:16,866 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:42:16,868 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-06 01:42:16,870 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-06 01:42:16,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-06 01:42:16,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-06 01:42:16,962 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:16,962 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:16,963 INFO  L256         TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-02-06 01:42:16,969 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:42:17,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked.
[2025-02-06 01:42:17,325 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 01:42:17,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 51 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked.
[2025-02-06 01:42:17,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761556121] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 01:42:17,604 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 01:42:17,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15
[2025-02-06 01:42:17,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457698105]
[2025-02-06 01:42:17,605 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 01:42:17,605 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-02-06 01:42:17,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:42:17,606 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-02-06 01:42:17,606 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210
[2025-02-06 01:42:17,606 INFO  L87              Difference]: Start difference. First operand 172 states and 264 transitions. Second operand  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39)
[2025-02-06 01:42:17,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:42:17,847 INFO  L93              Difference]: Finished difference Result 342 states and 498 transitions.
[2025-02-06 01:42:17,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-06 01:42:17,847 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 122
[2025-02-06 01:42:17,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:42:17,849 INFO  L225             Difference]: With dead ends: 342
[2025-02-06 01:42:17,849 INFO  L226             Difference]: Without dead ends: 214
[2025-02-06 01:42:17,850 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420
[2025-02-06 01:42:17,850 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 127 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 01:42:17,851 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 205 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 01:42:17,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2025-02-06 01:42:17,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196.
[2025-02-06 01:42:17,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2025-02-06 01:42:17,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 279 transitions.
[2025-02-06 01:42:17,885 INFO  L78                 Accepts]: Start accepts. Automaton has 196 states and 279 transitions. Word has length 122
[2025-02-06 01:42:17,888 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:42:17,888 INFO  L471      AbstractCegarLoop]: Abstraction has 196 states and 279 transitions.
[2025-02-06 01:42:17,888 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39)
[2025-02-06 01:42:17,888 INFO  L276                IsEmpty]: Start isEmpty. Operand 196 states and 279 transitions.
[2025-02-06 01:42:17,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-02-06 01:42:17,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:42:17,889 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:17,896 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-06 01:42:18,090 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:42:18,090 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:42:18,090 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:42:18,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 1788423433, now seen corresponding path program 1 times
[2025-02-06 01:42:18,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:42:18,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552815951]
[2025-02-06 01:42:18,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:18,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:42:18,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-06 01:42:18,141 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-06 01:42:18,142 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:18,142 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 01:42:18,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097644275]
[2025-02-06 01:42:18,144 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:18,144 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:42:18,144 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:42:18,146 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-06 01:42:18,147 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-06 01:42:18,189 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-06 01:42:18,340 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-06 01:42:18,340 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:18,340 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 01:42:18,340 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 01:42:18,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-06 01:42:18,387 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-06 01:42:18,387 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:18,387 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 01:42:18,440 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 01:42:18,440 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-02-06 01:42:18,441 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-06 01:42:18,452 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-06 01:42:18,643 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:42:18,645 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2025-02-06 01:42:18,702 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-06 01:42:18,704 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:42:18 BoogieIcfgContainer
[2025-02-06 01:42:18,704 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-06 01:42:18,705 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-06 01:42:18,705 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-06 01:42:18,705 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-06 01:42:18,705 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:14" (3/4) ...
[2025-02-06 01:42:18,707 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-02-06 01:42:18,707 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-06 01:42:18,707 INFO  L158              Benchmark]: Toolchain (without parser) took 4746.04ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 110.0MB in the beginning and 106.0MB in the end (delta: 4.0MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB.
[2025-02-06 01:42:18,708 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 01:42:18,708 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 225.53ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 96.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-06 01:42:18,708 INFO  L158              Benchmark]: Boogie Procedure Inliner took 45.15ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 01:42:18,708 INFO  L158              Benchmark]: Boogie Preprocessor took 41.87ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 01:42:18,708 INFO  L158              Benchmark]: IcfgBuilder took 363.05ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 70.3MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-06 01:42:18,708 INFO  L158              Benchmark]: TraceAbstraction took 4062.83ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 70.3MB in the beginning and 107.4MB in the end (delta: -37.1MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB.
[2025-02-06 01:42:18,708 INFO  L158              Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 293.6MB. Free memory was 106.1MB in the beginning and 106.0MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 01:42:18,709 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 225.53ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 96.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 45.15ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 41.87ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 363.05ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 70.3MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 4062.83ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 70.3MB in the beginning and 107.4MB in the end (delta: -37.1MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB.
 * Witness Printer took 2.33ms. Allocated memory is still 293.6MB. Free memory was 106.1MB in the beginning and 106.0MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of bitwiseOr at line 45, overapproximation of bitwiseOr at line 128. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    signed long int var_1_1 = -32;
[L23]                    signed long int var_1_3 = 10;
[L24]                    signed long int var_1_4 = 64;
[L25]                    unsigned short int var_1_11 = 64;
[L26]                    unsigned short int var_1_12 = 8;
[L27]                    unsigned short int var_1_13 = 5;
[L28]                    signed short int var_1_14 = 8;
[L29]                    unsigned short int var_1_15 = 62763;
[L30]                    unsigned long int var_1_16 = 25;
[L31]                    float var_1_18 = 63.25;
[L32]                    unsigned char var_1_20 = 0;
[L33]                    float var_1_21 = 7.8;
[L34]                    float var_1_22 = 32.1;
[L35]                    unsigned char var_1_23 = 0;
[L36]                    signed long int var_1_24 = -16;
[L37]                    signed long int last_1_var_1_1 = -32;
[L38]                    unsigned short int last_1_var_1_11 = 64;
[L39]                    signed short int last_1_var_1_14 = 8;
[L40]                    unsigned long int last_1_var_1_16 = 25;
[L41]                    float last_1_var_1_18 = 63.25;
             VAL         [isInitial=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64]
[L132]                   isInitial = 1
[L133]       FCALL       initially()
[L134]                   int k_loop;
[L135]                   k_loop = 0
             VAL         [isInitial=1, k_loop=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64]
[L135]       COND TRUE   k_loop < 1
[L136]       CALL        updateLastVariables()
[L121]                   last_1_var_1_1 = var_1_1
[L122]                   last_1_var_1_11 = var_1_11
[L123]                   last_1_var_1_14 = var_1_14
[L124]                   last_1_var_1_16 = var_1_16
[L125]                   last_1_var_1_18 = var_1_18
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64]
[L136]       RET         updateLastVariables()
[L137]       CALL        updateVariables()
[L92]                    var_1_3 = __VERIFIER_nondet_long()
[L93]        CALL        assume_abort_if_not(var_1_3 >= -2147483648)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L93]        RET         assume_abort_if_not(var_1_3 >= -2147483648)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L94]        CALL        assume_abort_if_not(var_1_3 <= 2147483647)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L94]        RET         assume_abort_if_not(var_1_3 <= 2147483647)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L95]        CALL        assume_abort_if_not(var_1_3 != 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L95]        RET         assume_abort_if_not(var_1_3 != 0)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L96]                    var_1_4 = __VERIFIER_nondet_long()
[L97]        CALL        assume_abort_if_not(var_1_4 >= -2147483648)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L97]        RET         assume_abort_if_not(var_1_4 >= -2147483648)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L98]        CALL        assume_abort_if_not(var_1_4 <= 2147483647)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L98]        RET         assume_abort_if_not(var_1_4 <= 2147483647)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L99]        CALL        assume_abort_if_not(var_1_4 != 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L99]        RET         assume_abort_if_not(var_1_4 != 0)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L100]                   var_1_12 = __VERIFIER_nondet_ushort()
[L101]       CALL        assume_abort_if_not(var_1_12 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L101]       RET         assume_abort_if_not(var_1_12 >= 0)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L102]       CALL        assume_abort_if_not(var_1_12 <= 16384)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L102]       RET         assume_abort_if_not(var_1_12 <= 16384)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L103]                   var_1_13 = __VERIFIER_nondet_ushort()
[L104]       CALL        assume_abort_if_not(var_1_13 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L104]       RET         assume_abort_if_not(var_1_13 >= 0)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L105]       CALL        assume_abort_if_not(var_1_13 <= 16383)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L105]       RET         assume_abort_if_not(var_1_13 <= 16383)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L106]                   var_1_15 = __VERIFIER_nondet_ushort()
[L107]       CALL        assume_abort_if_not(var_1_15 >= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L107]       RET         assume_abort_if_not(var_1_15 >= 32767)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L108]       CALL        assume_abort_if_not(var_1_15 <= 65535)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L108]       RET         assume_abort_if_not(var_1_15 <= 65535)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L109]                   var_1_20 = __VERIFIER_nondet_uchar()
[L110]       CALL        assume_abort_if_not(var_1_20 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L110]       RET         assume_abort_if_not(var_1_20 >= 0)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L111]       CALL        assume_abort_if_not(var_1_20 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L111]       RET         assume_abort_if_not(var_1_20 <= 1)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L112]                   var_1_21 = __VERIFIER_nondet_float()
[L113]       CALL        assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L113]       RET         assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L114]                   var_1_22 = __VERIFIER_nondet_float()
[L115]       CALL        assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L115]       RET         assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L116]                   var_1_23 = __VERIFIER_nondet_uchar()
[L117]       CALL        assume_abort_if_not(var_1_23 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L117]       RET         assume_abort_if_not(var_1_23 >= 0)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L118]       CALL        assume_abort_if_not(var_1_23 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L118]       RET         assume_abort_if_not(var_1_23 <= 1)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L137]       RET         updateVariables()
[L138]       CALL        step()
[L45]        EXPR        last_1_var_1_1 | last_1_var_1_16
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L45]        COND FALSE  !((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16))
[L52]                    var_1_1 = last_1_var_1_11
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L54]        COND FALSE  !((- (- last_1_var_1_18)) != last_1_var_1_18)
[L61]                    var_1_24 = last_1_var_1_14
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=-255, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L63]        COND FALSE  !(((var_1_15 - var_1_12) + var_1_24) < var_1_24)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=-255, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L66]                    unsigned short int stepLocal_0 = var_1_13;
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, stepLocal_0=-65528, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=-255, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L67]        COND FALSE  !(var_1_24 < stepLocal_0)
[L78]                    var_1_18 = var_1_21
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L80]        COND TRUE   var_1_18 != (var_1_18 + var_1_18)
[L81]                    var_1_11 = ((var_1_12 + var_1_13) + 32)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=40, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L83]        COND FALSE  !(((var_1_1 * var_1_4) + var_1_1) > var_1_1)
[L88]                    var_1_16 = 0u
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=40, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L138]       RET         step()
[L139]       CALL, EXPR  property()
[L128]       EXPR        last_1_var_1_1 | last_1_var_1_16
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=40, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L128-L129]              return (((((((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) ? (((last_1_var_1_18 * last_1_var_1_18) < last_1_var_1_18) ? (var_1_1 == ((signed long int) last_1_var_1_11)) : (var_1_1 == ((signed long int) last_1_var_1_11))) : (var_1_1 == ((signed long int) last_1_var_1_11))) && ((var_1_18 != (var_1_18 + var_1_18)) ? (var_1_11 == ((unsigned short int) ((var_1_12 + var_1_13) + 32))) : 1)) && ((((var_1_15 - var_1_12) + var_1_24) < var_1_24) ? (var_1_14 == ((signed short int) var_1_12)) : 1)) && ((((var_1_1 * var_1_4) + var_1_1) > var_1_1) ? ((var_1_14 < var_1_1) ? (var_1_16 == ((unsigned long int) var_1_12)) : 1) : (var_1_16 == ((unsigned long int) 0u)))) && ((var_1_24 < var_1_13) ? (var_1_20 ? (var_1_18 == ((float) (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) + var_1_22))) : (var_1_23 ? (var_1_18 == ((float) (var_1_22 + var_1_21))) : (var_1_18 == ((float) -0.75f)))) : (var_1_18 == ((float) var_1_21)))) && (((- (- last_1_var_1_18)) != last_1_var_1_18) ? ((var_1_12 <= ((((last_1_var_1_14) > ((- last_1_var_1_14))) ? (last_1_var_1_14) : ((- last_1_var_1_14))))) ? (var_1_24 == ((signed long int) -50)) : (var_1_24 == ((signed long int) last_1_var_1_14))) : (var_1_24 == ((signed long int) last_1_var_1_14)))
;
[L139]       RET, EXPR   property()
[L139]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=40, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=40, var_1_12=0, var_1_13=-65528, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 791 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 456 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 335 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=4, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 2802 SizeOfPredicates, 3 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 4103/4284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-02-06 01:42:18,726 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
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_loopvsstraightlinecode_50-1loop_file-90.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 fac5641064dafa2cff3f5bb36fec0428c2326aea5290de8df19e073ecb1f4396
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 01:42:20,655 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 01:42:20,710 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-02-06 01:42:20,714 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 01:42:20,714 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 01:42:20,759 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 01:42:20,769 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 01:42:20,770 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 01:42:20,770 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 01:42:20,770 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 01:42:20,771 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 01:42:20,771 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 01:42:20,771 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 01:42:20,771 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 01:42:20,771 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 01:42:20,774 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 01:42:20,774 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 01:42:20,775 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 01:42:20,775 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 01:42:20,775 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-06 01:42:20,775 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 01:42:20,775 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 01:42:20,775 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 01:42:20,775 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 01:42:20,775 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 01:42:20,775 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 01:42:20,775 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-02-06 01:42:20,776 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-02-06 01:42:20,776 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 01:42:20,776 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 01:42:20,776 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 01:42:20,776 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 01:42:20,776 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 -> fac5641064dafa2cff3f5bb36fec0428c2326aea5290de8df19e073ecb1f4396
[2025-02-06 01:42:21,013 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 01:42:21,022 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 01:42:21,024 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 01:42:21,024 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 01:42:21,024 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 01:42:21,027 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-90.i
[2025-02-06 01:42:22,218 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf69b8622/780f6922a7754958976ac1f84645aa0c/FLAGef8b0607f
[2025-02-06 01:42:22,477 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 01:42:22,477 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-90.i
[2025-02-06 01:42:22,485 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf69b8622/780f6922a7754958976ac1f84645aa0c/FLAGef8b0607f
[2025-02-06 01:42:22,779 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf69b8622/780f6922a7754958976ac1f84645aa0c
[2025-02-06 01:42:22,781 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 01:42:22,783 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 01:42:22,785 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 01:42:22,785 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 01:42:22,788 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 01:42:22,789 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:42:22" (1/1) ...
[2025-02-06 01:42:22,791 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2140e0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:22, skipping insertion in model container
[2025-02-06 01:42:22,791 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:42:22" (1/1) ...
[2025-02-06 01:42:22,812 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 01:42:22,920 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_loopvsstraightlinecode_50-1loop_file-90.i[915,928]
[2025-02-06 01:42:22,975 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 01:42:22,984 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 01:42:22,992 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_loopvsstraightlinecode_50-1loop_file-90.i[915,928]
[2025-02-06 01:42:23,005 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 01:42:23,017 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 01:42:23,017 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23 WrapperNode
[2025-02-06 01:42:23,018 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 01:42:23,018 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 01:42:23,019 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 01:42:23,019 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 01:42:23,023 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,029 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,044 INFO  L138                Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132
[2025-02-06 01:42:23,044 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 01:42:23,045 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 01:42:23,045 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 01:42:23,045 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 01:42:23,050 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,051 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,053 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,061 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-06 01:42:23,061 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,061 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,068 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,068 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,070 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,071 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,072 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 01:42:23,073 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 01:42:23,073 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 01:42:23,073 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 01:42:23,074 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (1/1) ...
[2025-02-06 01:42:23,084 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 01:42:23,094 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:42:23,105 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-06 01:42:23,109 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-06 01:42:23,125 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 01:42:23,125 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-02-06 01:42:23,126 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-06 01:42:23,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-06 01:42:23,126 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 01:42:23,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 01:42:23,187 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 01:42:23,189 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 01:42:23,999 INFO  L?                        ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2025-02-06 01:42:23,999 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 01:42:24,006 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 01:42:24,006 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 01:42:24,006 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:24 BoogieIcfgContainer
[2025-02-06 01:42:24,006 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 01:42:24,008 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 01:42:24,008 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 01:42:24,012 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 01:42:24,013 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:42:22" (1/3) ...
[2025-02-06 01:42:24,013 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f4275c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:42:24, skipping insertion in model container
[2025-02-06 01:42:24,014 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:23" (2/3) ...
[2025-02-06 01:42:24,014 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f4275c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:42:24, skipping insertion in model container
[2025-02-06 01:42:24,014 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:24" (3/3) ...
[2025-02-06 01:42:24,016 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-90.i
[2025-02-06 01:42:24,026 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 01:42:24,027 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-90.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-06 01:42:24,061 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 01:42:24,069 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;@7b1d482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 01:42:24,069 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-06 01:42:24,071 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 57 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-02-06 01:42:24,077 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-02-06 01:42:24,077 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:42:24,078 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:24,078 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:42:24,081 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:42:24,082 INFO  L85        PathProgramCache]: Analyzing trace with hash 603858526, now seen corresponding path program 1 times
[2025-02-06 01:42:24,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-06 01:42:24,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545444516]
[2025-02-06 01:42:24,089 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:24,089 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-06 01:42:24,089 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-06 01:42:24,091 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-02-06 01:42:24,094 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2025-02-06 01:42:24,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-02-06 01:42:24,301 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-02-06 01:42:24,302 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:24,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:24,311 INFO  L256         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-06 01:42:24,320 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:42:24,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked.
[2025-02-06 01:42:24,358 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 01:42:24,359 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-06 01:42:24,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545444516]
[2025-02-06 01:42:24,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545444516] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:42:24,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:42:24,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 01:42:24,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751576789]
[2025-02-06 01:42:24,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:42:24,364 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-06 01:42:24,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-06 01:42:24,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 01:42:24,379 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 01:42:24,380 INFO  L87              Difference]: Start difference. First operand  has 57 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2025-02-06 01:42:24,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:42:24,396 INFO  L93              Difference]: Finished difference Result 111 states and 189 transitions.
[2025-02-06 01:42:24,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 01:42:24,397 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115
[2025-02-06 01:42:24,397 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:42:24,401 INFO  L225             Difference]: With dead ends: 111
[2025-02-06 01:42:24,401 INFO  L226             Difference]: Without dead ends: 54
[2025-02-06 01:42:24,403 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-06 01:42:24,405 INFO  L435           NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 01:42:24,405 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 01:42:24,414 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2025-02-06 01:42:24,431 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2025-02-06 01:42:24,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-02-06 01:42:24,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions.
[2025-02-06 01:42:24,439 INFO  L78                 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 115
[2025-02-06 01:42:24,439 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:42:24,439 INFO  L471      AbstractCegarLoop]: Abstraction has 54 states and 82 transitions.
[2025-02-06 01:42:24,439 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2025-02-06 01:42:24,439 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions.
[2025-02-06 01:42:24,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-02-06 01:42:24,441 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:42:24,442 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:24,459 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2025-02-06 01:42:24,642 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-06 01:42:24,642 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:42:24,643 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:42:24,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 887814522, now seen corresponding path program 1 times
[2025-02-06 01:42:24,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-06 01:42:24,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307108673]
[2025-02-06 01:42:24,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:24,644 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-06 01:42:24,644 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-06 01:42:24,646 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-02-06 01:42:24,648 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2025-02-06 01:42:24,699 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-02-06 01:42:24,921 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-02-06 01:42:24,921 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:24,921 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:24,930 INFO  L256         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-02-06 01:42:24,935 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:42:25,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked.
[2025-02-06 01:42:25,664 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 01:42:25,956 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-06 01:42:25,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307108673]
[2025-02-06 01:42:25,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307108673] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 01:42:25,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [625924767]
[2025-02-06 01:42:25,956 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:42:25,956 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2025-02-06 01:42:25,957 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4
[2025-02-06 01:42:25,961 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2025-02-06 01:42:25,962 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process
[2025-02-06 01:42:26,010 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-02-06 01:42:26,598 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-02-06 01:42:26,598 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:42:26,598 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:42:26,622 INFO  L256         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-02-06 01:42:26,633 INFO  L279         TraceCheckSpWp]: Computing forward predicates...