./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-79.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-while_file-79.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 6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 01:52:45,740 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 01:52:45,812 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:52:45,819 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 01:52:45,821 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 01:52:45,858 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 01:52:45,859 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 01:52:45,859 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 01:52:45,859 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 01:52:45,859 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 01:52:45,859 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 01:52:45,859 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 01:52:45,864 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 01:52:45,864 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 01:52:45,864 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 01:52:45,864 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 01:52:45,864 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 01:52:45,865 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 01:52:45,865 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 01:52:45,865 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 01:52:45,866 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 01:52:45,866 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 01:52:45,866 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-06 01:52:45,866 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 01:52:45,866 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 01:52:45,866 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 01:52:45,866 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 01:52:45,866 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 -> 6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7
[2025-02-06 01:52:46,161 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 01:52:46,173 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 01:52:46,175 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 01:52:46,178 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 01:52:46,178 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 01:52:46,179 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-while_file-79.i
[2025-02-06 01:52:47,475 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35923d324/6a7e18f17bcc4b6991f48dbb7f70a5d1/FLAG362ac7807
[2025-02-06 01:52:47,737 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 01:52:47,738 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-79.i
[2025-02-06 01:52:47,753 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35923d324/6a7e18f17bcc4b6991f48dbb7f70a5d1/FLAG362ac7807
[2025-02-06 01:52:47,771 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35923d324/6a7e18f17bcc4b6991f48dbb7f70a5d1
[2025-02-06 01:52:47,775 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 01:52:47,777 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 01:52:47,778 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 01:52:47,779 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 01:52:47,782 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 01:52:47,782 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:52:47" (1/1) ...
[2025-02-06 01:52:47,783 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fb8bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:47, skipping insertion in model container
[2025-02-06 01:52:47,783 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:52:47" (1/1) ...
[2025-02-06 01:52:47,803 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 01:52:47,902 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-while_file-79.i[915,928]
[2025-02-06 01:52:47,947 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 01:52:47,958 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 01:52:47,969 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-while_file-79.i[915,928]
[2025-02-06 01:52:48,006 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 01:52:48,024 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 01:52:48,025 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48 WrapperNode
[2025-02-06 01:52:48,025 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 01:52:48,026 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 01:52:48,026 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 01:52:48,026 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 01:52:48,030 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:52:48" (1/1) ...
[2025-02-06 01:52:48,036 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:52:48" (1/1) ...
[2025-02-06 01:52:48,059 INFO  L138                Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160
[2025-02-06 01:52:48,059 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 01:52:48,059 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 01:52:48,059 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 01:52:48,060 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 01:52:48,065 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,065 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,068 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,081 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:52:48,081 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,081 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,092 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,097 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,098 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,103 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,105 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 01:52:48,105 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 01:52:48,105 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 01:52:48,106 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 01:52:48,106 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (1/1) ...
[2025-02-06 01:52:48,111 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 01:52:48,121 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:52:48,137 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:52:48,142 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:52:48,158 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 01:52:48,159 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-06 01:52:48,159 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-06 01:52:48,159 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-06 01:52:48,159 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 01:52:48,159 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 01:52:48,216 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 01:52:48,217 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 01:52:48,494 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-02-06 01:52:48,496 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 01:52:48,505 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 01:52:48,507 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 01:52:48,507 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:52:48 BoogieIcfgContainer
[2025-02-06 01:52:48,507 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 01:52:48,510 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 01:52:48,510 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 01:52:48,514 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 01:52:48,514 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:52:47" (1/3) ...
[2025-02-06 01:52:48,514 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bc0c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:52:48, skipping insertion in model container
[2025-02-06 01:52:48,514 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:48" (2/3) ...
[2025-02-06 01:52:48,515 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bc0c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:52:48, skipping insertion in model container
[2025-02-06 01:52:48,516 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:52:48" (3/3) ...
[2025-02-06 01:52:48,517 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-79.i
[2025-02-06 01:52:48,530 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 01:52:48,532 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-79.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-06 01:52:48,583 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 01:52:48,594 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;@4e8e7f58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 01:52:48,594 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-06 01:52:48,598 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-02-06 01:52:48,607 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-02-06 01:52:48,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:52:48,608 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,608 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:52:48,611 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:52:48,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 786649215, now seen corresponding path program 1 times
[2025-02-06 01:52:48,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:52:48,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500348750]
[2025-02-06 01:52:48,616 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:48,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:52:48,683 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-02-06 01:52:48,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-02-06 01:52:48,705 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:48,705 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:52:48,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked.
[2025-02-06 01:52:48,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:52:48,881 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500348750]
[2025-02-06 01:52:48,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500348750] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 01:52:48,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261005829]
[2025-02-06 01:52:48,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:48,882 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:52:48,882 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:52:48,886 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:52:48,887 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:52:48,975 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-02-06 01:52:49,040 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-02-06 01:52:49,040 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:49,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:52:49,042 INFO  L256         TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-06 01:52:49,049 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:52:49,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked.
[2025-02-06 01:52:49,072 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 01:52:49,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261005829] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:52:49,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-06 01:52:49,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-06 01:52:49,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550760135]
[2025-02-06 01:52:49,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:52:49,078 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-06 01:52:49,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:52:49,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 01:52:49,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 01:52:49,095 INFO  L87              Difference]: Start difference. First operand  has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25)
[2025-02-06 01:52:49,119 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:52:49,123 INFO  L93              Difference]: Finished difference Result 134 states and 232 transitions.
[2025-02-06 01:52:49,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 01:52:49,125 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157
[2025-02-06 01:52:49,125 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:52:49,128 INFO  L225             Difference]: With dead ends: 134
[2025-02-06 01:52:49,128 INFO  L226             Difference]: Without dead ends: 67
[2025-02-06 01:52:49,131 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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:52:49,132 INFO  L435           NwaCegarLoop]: 101 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, 101 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:52:49,132 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 01:52:49,141 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2025-02-06 01:52:49,153 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2025-02-06 01:52:49,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 67 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-02-06 01:52:49,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions.
[2025-02-06 01:52:49,162 INFO  L78                 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 157
[2025-02-06 01:52:49,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:52:49,162 INFO  L471      AbstractCegarLoop]: Abstraction has 67 states and 101 transitions.
[2025-02-06 01:52:49,162 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25)
[2025-02-06 01:52:49,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions.
[2025-02-06 01:52:49,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-02-06 01:52:49,164 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:52:49,164 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,172 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:52:49,365 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:52:49,365 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:52:49,367 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:52:49,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -1758937242, now seen corresponding path program 1 times
[2025-02-06 01:52:49,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:52:49,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243523341]
[2025-02-06 01:52:49,368 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:49,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:52:49,384 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-02-06 01:52:49,441 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-02-06 01:52:49,441 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:49,441 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:52:49,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2025-02-06 01:52:49,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:52:49,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243523341]
[2025-02-06 01:52:49,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243523341] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:52:49,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:52:49,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 01:52:49,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176065929]
[2025-02-06 01:52:49,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:52:49,673 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 01:52:49,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:52:49,673 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 01:52:49,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 01:52:49,674 INFO  L87              Difference]: Start difference. First operand 67 states and 101 transitions. Second operand  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:52:49,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:52:49,702 INFO  L93              Difference]: Finished difference Result 195 states and 297 transitions.
[2025-02-06 01:52:49,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 01:52:49,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157
[2025-02-06 01:52:49,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:52:49,705 INFO  L225             Difference]: With dead ends: 195
[2025-02-06 01:52:49,705 INFO  L226             Difference]: Without dead ends: 131
[2025-02-06 01:52:49,706 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 01:52:49,706 INFO  L435           NwaCegarLoop]: 105 mSDtfsCounter, 47 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 01:52:49,706 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 196 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 01:52:49,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2025-02-06 01:52:49,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129.
[2025-02-06 01:52:49,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50)
[2025-02-06 01:52:49,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions.
[2025-02-06 01:52:49,727 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 157
[2025-02-06 01:52:49,727 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:52:49,727 INFO  L471      AbstractCegarLoop]: Abstraction has 129 states and 196 transitions.
[2025-02-06 01:52:49,727 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:52:49,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions.
[2025-02-06 01:52:49,730 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2025-02-06 01:52:49,730 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:52:49,730 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,730 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-06 01:52:49,731 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:52:49,732 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:52:49,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -2145748258, now seen corresponding path program 1 times
[2025-02-06 01:52:49,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:52:49,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734391378]
[2025-02-06 01:52:49,733 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:49,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:52:49,756 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-02-06 01:52:49,780 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-02-06 01:52:49,780 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:49,780 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:52:50,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2025-02-06 01:52:50,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:52:50,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734391378]
[2025-02-06 01:52:50,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734391378] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:52:50,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:52:50,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 01:52:50,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359549367]
[2025-02-06 01:52:50,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:52:50,089 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 01:52:50,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:52:50,090 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 01:52:50,090 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 01:52:50,090 INFO  L87              Difference]: Start difference. First operand 129 states and 196 transitions. Second operand  has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:52:50,281 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:52:50,282 INFO  L93              Difference]: Finished difference Result 271 states and 410 transitions.
[2025-02-06 01:52:50,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 01:52:50,284 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 158
[2025-02-06 01:52:50,284 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:52:50,288 INFO  L225             Difference]: With dead ends: 271
[2025-02-06 01:52:50,288 INFO  L226             Difference]: Without dead ends: 145
[2025-02-06 01:52:50,290 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-06 01:52:50,291 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 84 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 01:52:50,291 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 338 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 01:52:50,292 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-02-06 01:52:50,301 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129.
[2025-02-06 01:52:50,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50)
[2025-02-06 01:52:50,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions.
[2025-02-06 01:52:50,303 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 158
[2025-02-06 01:52:50,304 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:52:50,304 INFO  L471      AbstractCegarLoop]: Abstraction has 129 states and 195 transitions.
[2025-02-06 01:52:50,304 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:52:50,304 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions.
[2025-02-06 01:52:50,305 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-02-06 01:52:50,305 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:52:50,306 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:50,306 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-06 01:52:50,306 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:52:50,306 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:52:50,306 INFO  L85        PathProgramCache]: Analyzing trace with hash 1911855080, now seen corresponding path program 1 times
[2025-02-06 01:52:50,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:52:50,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621522810]
[2025-02-06 01:52:50,307 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:50,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:52:50,319 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-02-06 01:52:50,333 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-02-06 01:52:50,333 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:50,333 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:52:50,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2025-02-06 01:52:50,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:52:50,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621522810]
[2025-02-06 01:52:50,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621522810] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:52:50,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:52:50,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 01:52:50,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537693006]
[2025-02-06 01:52:50,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:52:50,456 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 01:52:50,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:52:50,456 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 01:52:50,457 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 01:52:50,457 INFO  L87              Difference]: Start difference. First operand 129 states and 195 transitions. Second operand  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:52:50,482 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:52:50,482 INFO  L93              Difference]: Finished difference Result 265 states and 405 transitions.
[2025-02-06 01:52:50,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 01:52:50,483 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159
[2025-02-06 01:52:50,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:52:50,484 INFO  L225             Difference]: With dead ends: 265
[2025-02-06 01:52:50,484 INFO  L226             Difference]: Without dead ends: 139
[2025-02-06 01:52:50,485 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 01:52:50,485 INFO  L435           NwaCegarLoop]: 117 mSDtfsCounter, 18 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 01:52:50,486 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 210 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 01:52:50,486 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2025-02-06 01:52:50,512 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129.
[2025-02-06 01:52:50,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50)
[2025-02-06 01:52:50,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions.
[2025-02-06 01:52:50,514 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 159
[2025-02-06 01:52:50,514 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:52:50,515 INFO  L471      AbstractCegarLoop]: Abstraction has 129 states and 193 transitions.
[2025-02-06 01:52:50,515 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:52:50,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions.
[2025-02-06 01:52:50,516 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-02-06 01:52:50,516 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:52:50,516 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:50,516 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-06 01:52:50,517 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:52:50,517 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:52:50,517 INFO  L85        PathProgramCache]: Analyzing trace with hash 2040937799, now seen corresponding path program 1 times
[2025-02-06 01:52:50,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:52:50,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840640812]
[2025-02-06 01:52:50,517 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:50,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:52:50,531 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-02-06 01:52:50,557 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-02-06 01:52:50,557 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:50,557 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:52:50,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2025-02-06 01:52:50,719 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:52:50,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840640812]
[2025-02-06 01:52:50,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840640812] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:52:50,720 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:52:50,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 01:52:50,720 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120145035]
[2025-02-06 01:52:50,720 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:52:50,720 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 01:52:50,720 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:52:50,721 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 01:52:50,721 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 01:52:50,721 INFO  L87              Difference]: Start difference. First operand 129 states and 193 transitions. Second operand  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:52:50,757 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:52:50,758 INFO  L93              Difference]: Finished difference Result 271 states and 401 transitions.
[2025-02-06 01:52:50,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 01:52:50,758 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159
[2025-02-06 01:52:50,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:52:50,760 INFO  L225             Difference]: With dead ends: 271
[2025-02-06 01:52:50,760 INFO  L226             Difference]: Without dead ends: 145
[2025-02-06 01:52:50,760 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 01:52:50,761 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 01:52:50,761 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 01:52:50,764 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-02-06 01:52:50,789 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144.
[2025-02-06 01:52:50,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 86 states have internal predecessors, (100), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54)
[2025-02-06 01:52:50,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions.
[2025-02-06 01:52:50,791 INFO  L78                 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 159
[2025-02-06 01:52:50,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:52:50,794 INFO  L471      AbstractCegarLoop]: Abstraction has 144 states and 208 transitions.
[2025-02-06 01:52:50,795 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:52:50,795 INFO  L276                IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions.
[2025-02-06 01:52:50,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-02-06 01:52:50,796 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:52:50,796 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:50,796 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-06 01:52:50,796 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:52:50,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:52:50,797 INFO  L85        PathProgramCache]: Analyzing trace with hash -1817085604, now seen corresponding path program 1 times
[2025-02-06 01:52:50,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:52:50,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979826856]
[2025-02-06 01:52:50,797 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:50,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:52:50,814 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-06 01:52:50,879 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-06 01:52:50,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:50,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:52:51,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked.
[2025-02-06 01:52:51,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 01:52:51,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979826856]
[2025-02-06 01:52:51,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979826856] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 01:52:51,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649781933]
[2025-02-06 01:52:51,196 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:51,196 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:52:51,196 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:52:51,198 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:52:51,200 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:52:51,257 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-06 01:52:51,297 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-06 01:52:51,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:51,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:52:51,299 INFO  L256         TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-02-06 01:52:51,303 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:52:51,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2025-02-06 01:52:51,702 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 01:52:52,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked.
[2025-02-06 01:52:52,019 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [649781933] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 01:52:52,019 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 01:52:52,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17
[2025-02-06 01:52:52,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599483321]
[2025-02-06 01:52:52,020 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 01:52:52,020 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-02-06 01:52:52,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 01:52:52,021 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-02-06 01:52:52,021 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272
[2025-02-06 01:52:52,021 INFO  L87              Difference]: Start difference. First operand 144 states and 208 transitions. Second operand  has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61)
[2025-02-06 01:52:52,393 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:52:52,393 INFO  L93              Difference]: Finished difference Result 232 states and 325 transitions.
[2025-02-06 01:52:52,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-06 01:52:52,394 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) Word has length 160
[2025-02-06 01:52:52,394 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:52:52,396 INFO  L225             Difference]: With dead ends: 232
[2025-02-06 01:52:52,396 INFO  L226             Difference]: Without dead ends: 164
[2025-02-06 01:52:52,397 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650
[2025-02-06 01:52:52,398 INFO  L435           NwaCegarLoop]: 62 mSDtfsCounter, 228 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 01:52:52,398 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 206 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 01:52:52,398 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-02-06 01:52:52,428 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152.
[2025-02-06 01:52:52,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 152 states, 91 states have (on average 1.1318681318681318) internal successors, (103), 92 states have internal predecessors, (103), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54)
[2025-02-06 01:52:52,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 211 transitions.
[2025-02-06 01:52:52,429 INFO  L78                 Accepts]: Start accepts. Automaton has 152 states and 211 transitions. Word has length 160
[2025-02-06 01:52:52,430 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:52:52,430 INFO  L471      AbstractCegarLoop]: Abstraction has 152 states and 211 transitions.
[2025-02-06 01:52:52,430 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61)
[2025-02-06 01:52:52,430 INFO  L276                IsEmpty]: Start isEmpty. Operand 152 states and 211 transitions.
[2025-02-06 01:52:52,431 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-02-06 01:52:52,431 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:52:52,431 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:52,438 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-06 01:52:52,636 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:52:52,636 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:52:52,636 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:52:52,636 INFO  L85        PathProgramCache]: Analyzing trace with hash 459833406, now seen corresponding path program 1 times
[2025-02-06 01:52:52,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 01:52:52,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166978400]
[2025-02-06 01:52:52,637 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:52,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 01:52:52,647 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-06 01:52:52,723 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-06 01:52:52,723 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:52,723 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 01:52:52,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698127717]
[2025-02-06 01:52:52,727 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:52:52,727 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:52:52,728 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:52:52,732 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:52:52,736 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:52:52,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-06 01:52:52,965 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-06 01:52:52,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:52,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 01:52:52,965 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 01:52:52,984 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-06 01:52:53,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-06 01:52:53,009 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:52:53,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 01:52:53,074 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 01:52:53,075 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-02-06 01:52:53,075 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-06 01:52:53,084 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-06 01:52:53,277 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 01:52:53,280 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2025-02-06 01:52:53,353 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-06 01:52:53,356 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:52:53 BoogieIcfgContainer
[2025-02-06 01:52:53,356 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-06 01:52:53,356 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-06 01:52:53,356 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-06 01:52:53,356 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-06 01:52:53,357 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:52:48" (3/4) ...
[2025-02-06 01:52:53,362 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-02-06 01:52:53,363 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-06 01:52:53,363 INFO  L158              Benchmark]: Toolchain (without parser) took 5587.09ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 110.4MB in the beginning and 175.0MB in the end (delta: -64.6MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB.
[2025-02-06 01:52:53,363 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 01:52:53,363 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 247.23ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 95.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-06 01:52:53,364 INFO  L158              Benchmark]: Boogie Procedure Inliner took 33.14ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 92.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 01:52:53,364 INFO  L158              Benchmark]: Boogie Preprocessor took 45.31ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 84.1MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 01:52:53,364 INFO  L158              Benchmark]: IcfgBuilder took 402.04ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 61.3MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-06 01:52:53,364 INFO  L158              Benchmark]: TraceAbstraction took 4846.18ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 61.3MB in the beginning and 175.1MB in the end (delta: -113.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB.
[2025-02-06 01:52:53,364 INFO  L158              Benchmark]: Witness Printer took 6.36ms. Allocated memory is still 302.0MB. Free memory was 175.1MB in the beginning and 175.0MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 01:52:53,365 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 247.23ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 95.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 33.14ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 92.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 45.31ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 84.1MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 402.04ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 61.3MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 4846.18ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 61.3MB in the beginning and 175.1MB in the end (delta: -113.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB.
 * Witness Printer took 6.36ms. Allocated memory is still 302.0MB. Free memory was 175.1MB in the beginning and 175.0MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. 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 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 110. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    signed short int var_1_1 = 2;
[L23]                    unsigned char var_1_2 = 1;
[L24]                    unsigned char var_1_3 = 0;
[L25]                    unsigned char var_1_7 = 50;
[L26]                    unsigned char var_1_8 = 0;
[L27]                    double var_1_9 = 127.625;
[L28]                    double var_1_10 = 256.8;
[L29]                    double var_1_11 = 0.30000000000000004;
[L30]                    signed long int var_1_12 = -2;
[L31]                    double var_1_13 = 2.475;
[L32]                    double var_1_14 = 25.2;
[L33]                    double var_1_15 = 500.125;
[L34]                    double var_1_16 = 10.75;
[L35]                    double var_1_17 = 255.4;
[L36]                    unsigned char var_1_18 = 1;
[L37]                    unsigned char var_1_19 = 0;
[L38]                    unsigned char var_1_20 = 100;
[L39]                    unsigned char var_1_21 = 128;
[L40]                    unsigned char var_1_22 = 0;
[L41]                    unsigned char var_1_23 = 1;
[L42]                    unsigned char var_1_24 = 8;
[L43]                    unsigned char var_1_25 = 10;
[L44]                    float var_1_26 = 16.8;
[L45]                    unsigned long int var_1_27 = 64;
[L46]                    unsigned char last_1_var_1_18 = 1;
[L47]                    unsigned char last_1_var_1_20 = 100;
             VAL         [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L149]                   isInitial = 1
[L150]       FCALL       initially()
[L151]       COND TRUE   1
[L152]       CALL        updateLastVariables()
[L141]                   last_1_var_1_18 = var_1_18
[L142]                   last_1_var_1_20 = var_1_20
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L152]       RET         updateLastVariables()
[L153]       CALL        updateVariables()
[L98]                    var_1_2 = __VERIFIER_nondet_uchar()
[L99]        CALL        assume_abort_if_not(var_1_2 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L99]        RET         assume_abort_if_not(var_1_2 >= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L100]       CALL        assume_abort_if_not(var_1_2 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L100]       RET         assume_abort_if_not(var_1_2 <= 1)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L101]                   var_1_3 = __VERIFIER_nondet_uchar()
[L102]       CALL        assume_abort_if_not(var_1_3 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L102]       RET         assume_abort_if_not(var_1_3 >= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L103]       CALL        assume_abort_if_not(var_1_3 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L103]       RET         assume_abort_if_not(var_1_3 <= 1)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L104]                   var_1_8 = __VERIFIER_nondet_uchar()
[L105]       CALL        assume_abort_if_not(var_1_8 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8]
[L105]       RET         assume_abort_if_not(var_1_8 >= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8]
[L106]       CALL        assume_abort_if_not(var_1_8 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L106]       RET         assume_abort_if_not(var_1_8 <= 254)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L107]                   var_1_10 = __VERIFIER_nondet_double()
[L108]       CALL        assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L108]       RET         assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L109]                   var_1_11 = __VERIFIER_nondet_double()
[L110]       CALL        assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L110]       RET         assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L111]                   var_1_13 = __VERIFIER_nondet_double()
[L112]       CALL        assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L112]       RET         assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L113]                   var_1_14 = __VERIFIER_nondet_double()
[L114]       CALL        assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L114]       RET         assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L115]                   var_1_15 = __VERIFIER_nondet_double()
[L116]       CALL        assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L116]       RET         assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L117]                   var_1_16 = __VERIFIER_nondet_double()
[L118]       CALL        assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L118]       RET         assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L119]                   var_1_17 = __VERIFIER_nondet_double()
[L120]       CALL        assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L120]       RET         assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L121]                   var_1_19 = __VERIFIER_nondet_uchar()
[L122]       CALL        assume_abort_if_not(var_1_19 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L122]       RET         assume_abort_if_not(var_1_19 >= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L123]       CALL        assume_abort_if_not(var_1_19 <= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L123]       RET         assume_abort_if_not(var_1_19 <= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L124]                   var_1_21 = __VERIFIER_nondet_uchar()
[L125]       CALL        assume_abort_if_not(var_1_21 >= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L125]       RET         assume_abort_if_not(var_1_21 >= 127)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L126]       CALL        assume_abort_if_not(var_1_21 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L126]       RET         assume_abort_if_not(var_1_21 <= 254)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L127]                   var_1_22 = __VERIFIER_nondet_uchar()
[L128]       CALL        assume_abort_if_not(var_1_22 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L128]       RET         assume_abort_if_not(var_1_22 >= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L129]       CALL        assume_abort_if_not(var_1_22 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L129]       RET         assume_abort_if_not(var_1_22 <= 127)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L130]                   var_1_23 = __VERIFIER_nondet_uchar()
[L131]       CALL        assume_abort_if_not(var_1_23 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L131]       RET         assume_abort_if_not(var_1_23 >= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L132]       CALL        assume_abort_if_not(var_1_23 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L132]       RET         assume_abort_if_not(var_1_23 <= 127)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L133]                   var_1_24 = __VERIFIER_nondet_uchar()
[L134]       CALL        assume_abort_if_not(var_1_24 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L134]       RET         assume_abort_if_not(var_1_24 >= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L135]       CALL        assume_abort_if_not(var_1_24 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L135]       RET         assume_abort_if_not(var_1_24 <= 127)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L136]                   var_1_25 = __VERIFIER_nondet_uchar()
[L137]       CALL        assume_abort_if_not(var_1_25 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L137]       RET         assume_abort_if_not(var_1_25 >= 0)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L138]       CALL        assume_abort_if_not(var_1_25 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L138]       RET         assume_abort_if_not(var_1_25 <= 127)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L153]       RET         updateVariables()
[L154]       CALL        step()
[L51]                    signed long int stepLocal_1 = last_1_var_1_20;
[L52]                    unsigned char stepLocal_0 = last_1_var_1_18;
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L53]        COND TRUE   stepLocal_0 && last_1_var_1_18
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L54]        COND FALSE  !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1)
[L57]                    var_1_7 = var_1_8
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8]
[L62]        COND FALSE  !(\read(var_1_3))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8]
[L67]                    var_1_26 = var_1_16
[L68]                    var_1_27 = 10u
[L69]                    unsigned long int stepLocal_2 = var_1_27;
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8]
[L70]        COND TRUE   stepLocal_2 != (var_1_8 + var_1_7)
[L71]                    var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L75]        COND TRUE   var_1_8 >= var_1_7
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L76]        COND TRUE   var_1_15 >= var_1_26
[L77]                    var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25)))))))
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=128, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L84]        COND TRUE   \read(var_1_18)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=128, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L85]        COND FALSE  !(! var_1_18)
[L88]                    var_1_1 = (var_1_20 - var_1_20)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L93]        COND TRUE   (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))
[L94]                    var_1_12 = (var_1_20 + var_1_20)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=256, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L154]       RET         step()
[L155]       CALL, EXPR  property()
[L145-L146]              return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u))
;
             VAL         [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=256, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L155]       RET, EXPR   property()
[L155]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=256, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=256, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=-639, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=-255, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 1232 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 635 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 597 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 481 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1587 NumberOfCodeBlocks, 1587 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1418 ConstructedInterpolants, 0 QuantifiedInterpolants, 2719 SizeOfPredicates, 4 NumberOfNonLiveVariables, 733 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10662/10800 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:52:53,384 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-while_file-79.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 6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 01:52:55,418 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 01:52:55,498 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:52:55,503 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 01:52:55,503 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 01:52:55,518 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 01:52:55,518 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 01:52:55,519 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 01:52:55,519 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 01:52:55,519 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 01:52:55,519 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 01:52:55,519 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 01:52:55,520 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 01:52:55,520 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 01:52:55,520 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 01:52:55,521 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 01:52:55,521 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 01:52:55,521 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-02-06 01:52:55,521 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-02-06 01:52:55,521 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 01:52:55,521 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 01:52:55,521 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 01:52:55,521 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 01:52:55,521 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 -> 6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7
[2025-02-06 01:52:55,747 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 01:52:55,756 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 01:52:55,758 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 01:52:55,758 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 01:52:55,759 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 01:52:55,759 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-while_file-79.i
[2025-02-06 01:52:57,000 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd3f4fbea/ba1ae07207d14926a6b3998102e978c0/FLAGc4860f1b2
[2025-02-06 01:52:57,181 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 01:52:57,181 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-79.i
[2025-02-06 01:52:57,187 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd3f4fbea/ba1ae07207d14926a6b3998102e978c0/FLAGc4860f1b2
[2025-02-06 01:52:57,564 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd3f4fbea/ba1ae07207d14926a6b3998102e978c0
[2025-02-06 01:52:57,565 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 01:52:57,574 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 01:52:57,575 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 01:52:57,575 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 01:52:57,578 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 01:52:57,580 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,581 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abfd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57, skipping insertion in model container
[2025-02-06 01:52:57,582 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,597 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 01:52:57,706 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-while_file-79.i[915,928]
[2025-02-06 01:52:57,749 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 01:52:57,760 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 01:52:57,767 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-while_file-79.i[915,928]
[2025-02-06 01:52:57,790 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 01:52:57,806 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 01:52:57,806 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57 WrapperNode
[2025-02-06 01:52:57,806 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 01:52:57,807 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 01:52:57,807 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 01:52:57,807 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 01:52:57,811 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:52:57" (1/1) ...
[2025-02-06 01:52:57,819 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:52:57" (1/1) ...
[2025-02-06 01:52:57,839 INFO  L138                Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160
[2025-02-06 01:52:57,839 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 01:52:57,840 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 01:52:57,840 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 01:52:57,840 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 01:52:57,846 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,846 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,849 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,868 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:52:57,868 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,868 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,875 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,877 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,878 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,879 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,881 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 01:52:57,881 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 01:52:57,881 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 01:52:57,882 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 01:52:57,882 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (1/1) ...
[2025-02-06 01:52:57,887 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 01:52:57,898 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 01:52:57,908 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:52:57,909 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:52:57,924 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 01:52:57,924 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-02-06 01:52:57,924 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-06 01:52:57,924 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-06 01:52:57,924 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 01:52:57,924 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 01:52:57,976 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 01:52:57,978 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 01:53:05,839 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-02-06 01:53:05,840 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 01:53:05,846 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 01:53:05,846 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 01:53:05,847 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:53:05 BoogieIcfgContainer
[2025-02-06 01:53:05,847 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 01:53:05,849 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 01:53:05,849 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 01:53:05,852 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 01:53:05,852 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:52:57" (1/3) ...
[2025-02-06 01:53:05,853 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b705239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:53:05, skipping insertion in model container
[2025-02-06 01:53:05,853 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:57" (2/3) ...
[2025-02-06 01:53:05,853 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b705239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:53:05, skipping insertion in model container
[2025-02-06 01:53:05,853 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:53:05" (3/3) ...
[2025-02-06 01:53:05,854 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-79.i
[2025-02-06 01:53:05,863 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 01:53:05,864 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-79.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-06 01:53:05,904 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 01:53:05,912 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;@11c6e793, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 01:53:05,912 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-06 01:53:05,915 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-02-06 01:53:05,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-02-06 01:53:05,923 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:53:05,924 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:05,924 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:53:05,928 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:53:05,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 786649215, now seen corresponding path program 1 times
[2025-02-06 01:53:05,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-06 01:53:05,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794085211]
[2025-02-06 01:53:05,936 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:53:05,936 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:53:05,937 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-06 01:53:05,939 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:53:05,941 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:53:06,006 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-02-06 01:53:06,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-02-06 01:53:06,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:53:06,314 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:53:06,328 INFO  L256         TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-06 01:53:06,334 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:53:06,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked.
[2025-02-06 01:53:06,360 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 01:53:06,361 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-06 01:53:06,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794085211]
[2025-02-06 01:53:06,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794085211] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:53:06,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:53:06,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 01:53:06,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580279472]
[2025-02-06 01:53:06,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:53:06,365 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-06 01:53:06,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-06 01:53:06,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 01:53:06,380 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 01:53:06,382 INFO  L87              Difference]: Start difference. First operand  has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand  has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25)
[2025-02-06 01:53:06,405 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:53:06,406 INFO  L93              Difference]: Finished difference Result 134 states and 232 transitions.
[2025-02-06 01:53:06,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 01:53:06,408 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157
[2025-02-06 01:53:06,409 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:53:06,414 INFO  L225             Difference]: With dead ends: 134
[2025-02-06 01:53:06,414 INFO  L226             Difference]: Without dead ends: 67
[2025-02-06 01:53:06,417 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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:53:06,418 INFO  L435           NwaCegarLoop]: 101 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, 101 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:53:06,419 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 01:53:06,427 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2025-02-06 01:53:06,438 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2025-02-06 01:53:06,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 67 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-02-06 01:53:06,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions.
[2025-02-06 01:53:06,443 INFO  L78                 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 157
[2025-02-06 01:53:06,444 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:53:06,444 INFO  L471      AbstractCegarLoop]: Abstraction has 67 states and 101 transitions.
[2025-02-06 01:53:06,444 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25)
[2025-02-06 01:53:06,444 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions.
[2025-02-06 01:53:06,446 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-02-06 01:53:06,446 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:53:06,446 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:06,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:53:06,650 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:53:06,650 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:53:06,651 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:53:06,652 INFO  L85        PathProgramCache]: Analyzing trace with hash -1758937242, now seen corresponding path program 1 times
[2025-02-06 01:53:06,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-06 01:53:06,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656054989]
[2025-02-06 01:53:06,656 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:53:06,657 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:53:06,657 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-06 01:53:06,659 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:53:06,662 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:53:06,716 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-02-06 01:53:07,013 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-02-06 01:53:07,013 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:53:07,013 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:53:07,028 INFO  L256         TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-06 01:53:07,033 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:53:07,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2025-02-06 01:53:07,944 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 01:53:07,944 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-06 01:53:07,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656054989]
[2025-02-06 01:53:07,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656054989] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:53:07,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:53:07,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 01:53:07,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611654566]
[2025-02-06 01:53:07,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:53:07,945 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 01:53:07,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-06 01:53:07,946 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 01:53:07,946 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 01:53:07,946 INFO  L87              Difference]: Start difference. First operand 67 states and 101 transitions. Second operand  has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:53:11,172 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-02-06 01:53:11,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:53:11,375 INFO  L93              Difference]: Finished difference Result 209 states and 317 transitions.
[2025-02-06 01:53:11,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 01:53:11,376 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157
[2025-02-06 01:53:11,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:53:11,379 INFO  L225             Difference]: With dead ends: 209
[2025-02-06 01:53:11,380 INFO  L226             Difference]: Without dead ends: 145
[2025-02-06 01:53:11,382 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-06 01:53:11,382 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 81 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-02-06 01:53:11,382 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 338 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-02-06 01:53:11,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-02-06 01:53:11,402 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129.
[2025-02-06 01:53:11,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50)
[2025-02-06 01:53:11,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions.
[2025-02-06 01:53:11,406 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 157
[2025-02-06 01:53:11,407 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:53:11,407 INFO  L471      AbstractCegarLoop]: Abstraction has 129 states and 195 transitions.
[2025-02-06 01:53:11,407 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:53:11,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions.
[2025-02-06 01:53:11,409 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-02-06 01:53:11,409 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:53:11,409 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:11,421 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 (3)] Ended with exit code 0
[2025-02-06 01:53:11,610 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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:53:11,610 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:53:11,610 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:53:11,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 1911855080, now seen corresponding path program 1 times
[2025-02-06 01:53:11,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-06 01:53:11,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685355448]
[2025-02-06 01:53:11,611 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:53:11,611 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:53:11,611 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-06 01:53:11,614 INFO  L229       MonitoredProcess]: Starting monitored process 4 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:53:11,615 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 (4)] Waiting until timeout for monitored process
[2025-02-06 01:53:11,663 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-02-06 01:53:11,931 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-02-06 01:53:11,931 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:53:11,931 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:53:11,944 INFO  L256         TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-06 01:53:11,947 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:53:12,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2025-02-06 01:53:12,657 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 01:53:12,657 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-06 01:53:12,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685355448]
[2025-02-06 01:53:12,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685355448] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:53:12,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:53:12,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 01:53:12,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021643461]
[2025-02-06 01:53:12,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:53:12,658 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 01:53:12,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-06 01:53:12,659 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 01:53:12,659 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 01:53:12,659 INFO  L87              Difference]: Start difference. First operand 129 states and 195 transitions. Second operand  has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:53:16,509 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-02-06 01:53:20,595 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-02-06 01:53:24,600 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-02-06 01:53:28,726 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-02-06 01:53:28,727 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:53:28,727 INFO  L93              Difference]: Finished difference Result 332 states and 502 transitions.
[2025-02-06 01:53:28,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 01:53:28,753 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159
[2025-02-06 01:53:28,754 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:53:28,756 INFO  L225             Difference]: With dead ends: 332
[2025-02-06 01:53:28,756 INFO  L226             Difference]: Without dead ends: 206
[2025-02-06 01:53:28,758 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-06 01:53:28,761 INFO  L435           NwaCegarLoop]: 98 mSDtfsCounter, 57 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time
[2025-02-06 01:53:28,761 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 325 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 16.0s Time]
[2025-02-06 01:53:28,763 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2025-02-06 01:53:28,789 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 178.
[2025-02-06 01:53:28,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 178 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 99 states have internal predecessors, (118), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2025-02-06 01:53:28,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 268 transitions.
[2025-02-06 01:53:28,791 INFO  L78                 Accepts]: Start accepts. Automaton has 178 states and 268 transitions. Word has length 159
[2025-02-06 01:53:28,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:53:28,791 INFO  L471      AbstractCegarLoop]: Abstraction has 178 states and 268 transitions.
[2025-02-06 01:53:28,792 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:53:28,792 INFO  L276                IsEmpty]: Start isEmpty. Operand 178 states and 268 transitions.
[2025-02-06 01:53:28,793 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-02-06 01:53:28,793 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:53:28,793 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:28,809 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 (4)] Ended with exit code 0
[2025-02-06 01:53:28,997 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:53:28,997 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:53:28,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:53:28,999 INFO  L85        PathProgramCache]: Analyzing trace with hash 2040937799, now seen corresponding path program 1 times
[2025-02-06 01:53:28,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-06 01:53:28,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213377632]
[2025-02-06 01:53:28,999 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:53:28,999 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:53:28,999 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-06 01:53:29,001 INFO  L229       MonitoredProcess]: Starting monitored process 5 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:53:29,003 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 (5)] Waiting until timeout for monitored process
[2025-02-06 01:53:29,068 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-02-06 01:53:29,327 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-02-06 01:53:29,328 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:53:29,328 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:53:29,339 INFO  L256         TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-06 01:53:29,341 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:53:29,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2025-02-06 01:53:29,395 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 01:53:29,395 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-06 01:53:29,395 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213377632]
[2025-02-06 01:53:29,395 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [213377632] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 01:53:29,395 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 01:53:29,395 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 01:53:29,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388596651]
[2025-02-06 01:53:29,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 01:53:29,396 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 01:53:29,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-06 01:53:29,397 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 01:53:29,397 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 01:53:29,397 INFO  L87              Difference]: Start difference. First operand 178 states and 268 transitions. Second operand  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:53:33,495 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-02-06 01:53:33,545 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:53:33,546 INFO  L93              Difference]: Finished difference Result 312 states and 466 transitions.
[2025-02-06 01:53:33,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 01:53:33,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159
[2025-02-06 01:53:33,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:53:33,548 INFO  L225             Difference]: With dead ends: 312
[2025-02-06 01:53:33,548 INFO  L226             Difference]: Without dead ends: 186
[2025-02-06 01:53:33,549 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 01:53:33,551 INFO  L435           NwaCegarLoop]: 110 mSDtfsCounter, 32 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time
[2025-02-06 01:53:33,551 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 181 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time]
[2025-02-06 01:53:33,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2025-02-06 01:53:33,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186.
[2025-02-06 01:53:33,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 186 states, 105 states have (on average 1.161904761904762) internal successors, (122), 105 states have internal predecessors, (122), 75 states have call successors, (75), 5 states have call predecessors, (75), 5 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2025-02-06 01:53:33,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 272 transitions.
[2025-02-06 01:53:33,580 INFO  L78                 Accepts]: Start accepts. Automaton has 186 states and 272 transitions. Word has length 159
[2025-02-06 01:53:33,580 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:53:33,581 INFO  L471      AbstractCegarLoop]: Abstraction has 186 states and 272 transitions.
[2025-02-06 01:53:33,581 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2025-02-06 01:53:33,581 INFO  L276                IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions.
[2025-02-06 01:53:33,582 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-02-06 01:53:33,584 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:53:33,584 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:33,598 INFO  L540       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 (5)] Forceful destruction successful, exit code 0
[2025-02-06 01:53:33,784 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:53:33,785 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:53:33,785 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:53:33,785 INFO  L85        PathProgramCache]: Analyzing trace with hash -1817085604, now seen corresponding path program 1 times
[2025-02-06 01:53:33,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-06 01:53:33,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305679156]
[2025-02-06 01:53:33,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:53:33,786 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:53:33,786 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-06 01:53:33,788 INFO  L229       MonitoredProcess]: Starting monitored process 6 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:53:33,790 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 (6)] Waiting until timeout for monitored process
[2025-02-06 01:53:33,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-06 01:53:34,091 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-06 01:53:34,092 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:53:34,092 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:53:34,104 INFO  L256         TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-06 01:53:34,107 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 01:53:34,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2025-02-06 01:53:34,458 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 01:53:35,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked.
[2025-02-06 01:53:35,041 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-06 01:53:35,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305679156]
[2025-02-06 01:53:35,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305679156] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 01:53:35,041 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-02-06 01:53:35,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2025-02-06 01:53:35,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359048955]
[2025-02-06 01:53:35,041 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-02-06 01:53:35,042 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-06 01:53:35,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-06 01:53:35,042 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-06 01:53:35,042 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-06 01:53:35,042 INFO  L87              Difference]: Start difference. First operand 186 states and 272 transitions. Second operand  has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36)
[2025-02-06 01:53:40,064 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-02-06 01:53:42,502 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-02-06 01:53:42,561 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 01:53:42,562 INFO  L93              Difference]: Finished difference Result 282 states and 397 transitions.
[2025-02-06 01:53:42,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-06 01:53:42,593 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 160
[2025-02-06 01:53:42,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 01:53:42,595 INFO  L225             Difference]: With dead ends: 282
[2025-02-06 01:53:42,595 INFO  L226             Difference]: Without dead ends: 214
[2025-02-06 01:53:42,596 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240
[2025-02-06 01:53:42,596 INFO  L435           NwaCegarLoop]: 66 mSDtfsCounter, 156 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 139 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time
[2025-02-06 01:53:42,596 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 146 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 138 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time]
[2025-02-06 01:53:42,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2025-02-06 01:53:42,620 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198.
[2025-02-06 01:53:42,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198 states, 114 states have (on average 1.131578947368421) internal successors, (129), 114 states have internal predecessors, (129), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2025-02-06 01:53:42,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 279 transitions.
[2025-02-06 01:53:42,622 INFO  L78                 Accepts]: Start accepts. Automaton has 198 states and 279 transitions. Word has length 160
[2025-02-06 01:53:42,625 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 01:53:42,625 INFO  L471      AbstractCegarLoop]: Abstraction has 198 states and 279 transitions.
[2025-02-06 01:53:42,625 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36)
[2025-02-06 01:53:42,625 INFO  L276                IsEmpty]: Start isEmpty. Operand 198 states and 279 transitions.
[2025-02-06 01:53:42,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-02-06 01:53:42,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 01:53:42,626 INFO  L218           NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:42,644 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 (6)] Ended with exit code 0
[2025-02-06 01:53:42,827 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:53:42,827 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 01:53:42,828 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 01:53:42,828 INFO  L85        PathProgramCache]: Analyzing trace with hash 459833406, now seen corresponding path program 1 times
[2025-02-06 01:53:42,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-06 01:53:42,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764330480]
[2025-02-06 01:53:42,828 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 01:53:42,829 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:53:42,829 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-06 01:53:42,832 INFO  L229       MonitoredProcess]: Starting monitored process 7 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:53:42,833 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 (7)] Waiting until timeout for monitored process
[2025-02-06 01:53:42,861 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-06 01:53:43,175 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-06 01:53:43,175 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 01:53:43,175 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 01:53:43,190 INFO  L256         TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 26 conjuncts are in the unsatisfiable core
[2025-02-06 01:53:43,194 INFO  L279         TraceCheckSpWp]: Computing forward predicates...