./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4e8a5c4063538a4dcf229465482ca721f86e7f33293608e4514c59ac5276800d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 23:51:25,100 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 23:51:25,149 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 23:51:25,152 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 23:51:25,152 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 23:51:25,176 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 23:51:25,177 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 23:51:25,177 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 23:51:25,177 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 23:51:25,177 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 23:51:25,177 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 23:51:25,177 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 23:51:25,177 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 23:51:25,178 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 23:51:25,178 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 23:51:25,178 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 23:51:25,179 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 23:51:25,179 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 23:51:25,179 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/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 -> 4e8a5c4063538a4dcf229465482ca721f86e7f33293608e4514c59ac5276800d
[2025-03-03 23:51:25,397 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 23:51:25,406 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 23:51:25,408 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 23:51:25,409 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 23:51:25,409 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 23:51:25,410 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i
[2025-03-03 23:51:26,573 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ed35c70/a0147c693ec943d8ae51a2447aa15097/FLAG87272b3d1
[2025-03-03 23:51:26,853 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 23:51:26,854 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i
[2025-03-03 23:51:26,866 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ed35c70/a0147c693ec943d8ae51a2447aa15097/FLAG87272b3d1
[2025-03-03 23:51:27,151 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ed35c70/a0147c693ec943d8ae51a2447aa15097
[2025-03-03 23:51:27,153 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 23:51:27,154 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 23:51:27,155 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 23:51:27,155 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 23:51:27,158 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 23:51:27,159 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,159 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d8ccf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27, skipping insertion in model container
[2025-03-03 23:51:27,159 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,173 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 23:51:27,282 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i[916,929]
[2025-03-03 23:51:27,361 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 23:51:27,374 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 23:51:27,384 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i[916,929]
[2025-03-03 23:51:27,428 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 23:51:27,443 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 23:51:27,444 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27 WrapperNode
[2025-03-03 23:51:27,444 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 23:51:27,446 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 23:51:27,446 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 23:51:27,446 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 23:51:27,451 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,462 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,486 INFO  L138                Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235
[2025-03-03 23:51:27,487 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 23:51:27,487 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 23:51:27,488 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 23:51:27,488 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 23:51:27,498 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,498 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,501 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,518 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-03-03 23:51:27,519 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,519 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,532 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,533 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,538 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,540 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,545 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 23:51:27,546 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 23:51:27,547 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 23:51:27,547 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 23:51:27,548 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (1/1) ...
[2025-03-03 23:51:27,551 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 23:51:27,560 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:51:27,571 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 23:51:27,573 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 23:51:27,589 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 23:51:27,590 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 23:51:27,590 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 23:51:27,590 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 23:51:27,590 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 23:51:27,590 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 23:51:27,653 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 23:51:27,654 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 23:51:28,041 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc property_#t~ite22#1;havoc property_#t~ite21#1;havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short23#1;
[2025-03-03 23:51:28,065 INFO  L?                        ?]: Removed 24 outVars from TransFormulas that were not future-live.
[2025-03-03 23:51:28,065 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 23:51:28,078 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 23:51:28,078 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 23:51:28,078 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:51:28 BoogieIcfgContainer
[2025-03-03 23:51:28,078 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 23:51:28,080 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 23:51:28,081 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 23:51:28,084 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 23:51:28,084 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:51:27" (1/3) ...
[2025-03-03 23:51:28,085 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214c4435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:51:28, skipping insertion in model container
[2025-03-03 23:51:28,085 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:27" (2/3) ...
[2025-03-03 23:51:28,086 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214c4435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:51:28, skipping insertion in model container
[2025-03-03 23:51:28,086 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:51:28" (3/3) ...
[2025-03-03 23:51:28,087 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-16.i
[2025-03-03 23:51:28,097 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 23:51:28,098 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-16.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 23:51:28,141 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 23:51:28,152 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;@12a936c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 23:51:28,153 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 23:51:28,157 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 97 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 74 states have internal predecessors, (107), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-03-03 23:51:28,167 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-03 23:51:28,167 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:28,167 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:28,168 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:28,171 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:28,171 INFO  L85        PathProgramCache]: Analyzing trace with hash -906933943, now seen corresponding path program 1 times
[2025-03-03 23:51:28,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:51:28,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767974364]
[2025-03-03 23:51:28,177 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:28,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:51:28,258 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 23:51:28,282 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 23:51:28,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:28,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:28,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked.
[2025-03-03 23:51:28,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:51:28,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767974364]
[2025-03-03 23:51:28,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767974364] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 23:51:28,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779070915]
[2025-03-03 23:51:28,450 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:28,450 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:51:28,450 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:51:28,452 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 23:51:28,454 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 23:51:28,518 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 23:51:28,579 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 23:51:28,579 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:28,579 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:28,582 INFO  L256         TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 23:51:28,587 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:51:28,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked.
[2025-03-03 23:51:28,609 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:51:28,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [779070915] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:51:28,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 23:51:28,610 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 23:51:28,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963639286]
[2025-03-03 23:51:28,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:51:28,614 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 23:51:28,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:51:28,629 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 23:51:28,630 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 23:51:28,633 INFO  L87              Difference]: Start difference. First operand  has 97 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 74 states have internal predecessors, (107), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21)
[2025-03-03 23:51:28,660 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:51:28,661 INFO  L93              Difference]: Finished difference Result 188 states and 314 transitions.
[2025-03-03 23:51:28,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 23:51:28,663 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 145
[2025-03-03 23:51:28,664 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:51:28,669 INFO  L225             Difference]: With dead ends: 188
[2025-03-03 23:51:28,669 INFO  L226             Difference]: Without dead ends: 94
[2025-03-03 23:51:28,671 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-03-03 23:51:28,673 INFO  L435           NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 23:51:28,673 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 23:51:28,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-03-03 23:51:28,698 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-03-03 23:51:28,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-03-03 23:51:28,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions.
[2025-03-03 23:51:28,706 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 145
[2025-03-03 23:51:28,707 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:51:28,707 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 144 transitions.
[2025-03-03 23:51:28,707 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21)
[2025-03-03 23:51:28,707 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions.
[2025-03-03 23:51:28,709 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-03 23:51:28,709 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:28,709 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:28,715 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 23:51:28,909 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-03 23:51:28,910 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:28,910 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:28,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 1342476324, now seen corresponding path program 1 times
[2025-03-03 23:51:28,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:51:28,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758444739]
[2025-03-03 23:51:28,911 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:28,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:51:28,925 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 23:51:28,976 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 23:51:28,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:28,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:29,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2025-03-03 23:51:29,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:51:29,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758444739]
[2025-03-03 23:51:29,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758444739] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:51:29,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:51:29,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 23:51:29,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371110620]
[2025-03-03 23:51:29,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:51:29,253 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 23:51:29,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:51:29,253 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 23:51:29,254 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 23:51:29,255 INFO  L87              Difference]: Start difference. First operand 94 states and 144 transitions. Second operand  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:51:29,554 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:51:29,554 INFO  L93              Difference]: Finished difference Result 368 states and 569 transitions.
[2025-03-03 23:51:29,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 23:51:29,555 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145
[2025-03-03 23:51:29,555 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:51:29,557 INFO  L225             Difference]: With dead ends: 368
[2025-03-03 23:51:29,557 INFO  L226             Difference]: Without dead ends: 277
[2025-03-03 23:51:29,558 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-03 23:51:29,558 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 397 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:51:29,561 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 604 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 23:51:29,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 277 states.
[2025-03-03 23:51:29,587 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 185.
[2025-03-03 23:51:29,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 140 states have internal predecessors, (202), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42)
[2025-03-03 23:51:29,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 286 transitions.
[2025-03-03 23:51:29,590 INFO  L78                 Accepts]: Start accepts. Automaton has 185 states and 286 transitions. Word has length 145
[2025-03-03 23:51:29,590 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:51:29,590 INFO  L471      AbstractCegarLoop]: Abstraction has 185 states and 286 transitions.
[2025-03-03 23:51:29,590 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:51:29,590 INFO  L276                IsEmpty]: Start isEmpty. Operand 185 states and 286 transitions.
[2025-03-03 23:51:29,592 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-03 23:51:29,592 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:29,592 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:29,592 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 23:51:29,592 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:29,593 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:29,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -1599181275, now seen corresponding path program 1 times
[2025-03-03 23:51:29,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:51:29,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612937601]
[2025-03-03 23:51:29,593 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:29,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:51:29,609 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 23:51:29,709 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 23:51:29,709 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:29,709 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:30,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2025-03-03 23:51:30,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:51:30,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612937601]
[2025-03-03 23:51:30,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612937601] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:51:30,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:51:30,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 23:51:30,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812059117]
[2025-03-03 23:51:30,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:51:30,236 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 23:51:30,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:51:30,237 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 23:51:30,237 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 23:51:30,237 INFO  L87              Difference]: Start difference. First operand 185 states and 286 transitions. Second operand  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:51:30,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:51:30,513 INFO  L93              Difference]: Finished difference Result 728 states and 1124 transitions.
[2025-03-03 23:51:30,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 23:51:30,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145
[2025-03-03 23:51:30,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:51:30,518 INFO  L225             Difference]: With dead ends: 728
[2025-03-03 23:51:30,520 INFO  L226             Difference]: Without dead ends: 546
[2025-03-03 23:51:30,522 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-03 23:51:30,524 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 404 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:51:30,525 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 836 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 23:51:30,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 546 states.
[2025-03-03 23:51:30,585 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 361.
[2025-03-03 23:51:30,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 361 states, 261 states have (on average 1.3908045977011494) internal successors, (363), 262 states have internal predecessors, (363), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93)
[2025-03-03 23:51:30,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 549 transitions.
[2025-03-03 23:51:30,591 INFO  L78                 Accepts]: Start accepts. Automaton has 361 states and 549 transitions. Word has length 145
[2025-03-03 23:51:30,592 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:51:30,592 INFO  L471      AbstractCegarLoop]: Abstraction has 361 states and 549 transitions.
[2025-03-03 23:51:30,592 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:51:30,592 INFO  L276                IsEmpty]: Start isEmpty. Operand 361 states and 549 transitions.
[2025-03-03 23:51:30,597 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-03 23:51:30,597 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:30,597 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:30,598 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 23:51:30,598 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:30,598 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:30,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 498004453, now seen corresponding path program 1 times
[2025-03-03 23:51:30,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:51:30,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778999557]
[2025-03-03 23:51:30,598 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:30,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:51:30,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 23:51:30,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 23:51:30,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:30,639 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:30,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2025-03-03 23:51:30,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:51:30,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778999557]
[2025-03-03 23:51:30,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778999557] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:51:30,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:51:30,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 23:51:30,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966229706]
[2025-03-03 23:51:30,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:51:30,803 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 23:51:30,803 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:51:30,803 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 23:51:30,804 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 23:51:30,804 INFO  L87              Difference]: Start difference. First operand 361 states and 549 transitions. Second operand  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:51:31,096 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:51:31,097 INFO  L93              Difference]: Finished difference Result 705 states and 1071 transitions.
[2025-03-03 23:51:31,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 23:51:31,097 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145
[2025-03-03 23:51:31,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:51:31,104 INFO  L225             Difference]: With dead ends: 705
[2025-03-03 23:51:31,104 INFO  L226             Difference]: Without dead ends: 533
[2025-03-03 23:51:31,105 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-03 23:51:31,105 INFO  L435           NwaCegarLoop]: 141 mSDtfsCounter, 275 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:51:31,106 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 617 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 23:51:31,107 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 533 states.
[2025-03-03 23:51:31,151 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 531.
[2025-03-03 23:51:31,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 531 states, 386 states have (on average 1.3911917098445596) internal successors, (537), 387 states have internal predecessors, (537), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135)
[2025-03-03 23:51:31,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 807 transitions.
[2025-03-03 23:51:31,156 INFO  L78                 Accepts]: Start accepts. Automaton has 531 states and 807 transitions. Word has length 145
[2025-03-03 23:51:31,156 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:51:31,156 INFO  L471      AbstractCegarLoop]: Abstraction has 531 states and 807 transitions.
[2025-03-03 23:51:31,156 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:51:31,156 INFO  L276                IsEmpty]: Start isEmpty. Operand 531 states and 807 transitions.
[2025-03-03 23:51:31,159 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-03 23:51:31,159 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:31,159 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:31,160 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 23:51:31,160 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:31,161 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:31,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 1851314150, now seen corresponding path program 1 times
[2025-03-03 23:51:31,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:51:31,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487486165]
[2025-03-03 23:51:31,162 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:31,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:51:31,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 23:51:31,248 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 23:51:31,249 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:31,249 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:32,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2025-03-03 23:51:32,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:51:32,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487486165]
[2025-03-03 23:51:32,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487486165] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:51:32,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:51:32,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 23:51:32,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266913229]
[2025-03-03 23:51:32,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:51:32,109 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 23:51:32,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:51:32,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 23:51:32,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 23:51:32,110 INFO  L87              Difference]: Start difference. First operand 531 states and 807 transitions. Second operand  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21)
[2025-03-03 23:51:32,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:51:32,844 INFO  L93              Difference]: Finished difference Result 1257 states and 1859 transitions.
[2025-03-03 23:51:32,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 23:51:32,844 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 145
[2025-03-03 23:51:32,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:51:32,850 INFO  L225             Difference]: With dead ends: 1257
[2025-03-03 23:51:32,851 INFO  L226             Difference]: Without dead ends: 743
[2025-03-03 23:51:32,852 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2025-03-03 23:51:32,853 INFO  L435           NwaCegarLoop]: 99 mSDtfsCounter, 396 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 23:51:32,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 226 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 23:51:32,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 743 states.
[2025-03-03 23:51:32,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 579.
[2025-03-03 23:51:32,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 579 states, 428 states have (on average 1.338785046728972) internal successors, (573), 429 states have internal predecessors, (573), 135 states have call successors, (135), 15 states have call predecessors, (135), 15 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135)
[2025-03-03 23:51:32,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 843 transitions.
[2025-03-03 23:51:32,923 INFO  L78                 Accepts]: Start accepts. Automaton has 579 states and 843 transitions. Word has length 145
[2025-03-03 23:51:32,924 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:51:32,924 INFO  L471      AbstractCegarLoop]: Abstraction has 579 states and 843 transitions.
[2025-03-03 23:51:32,924 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21)
[2025-03-03 23:51:32,925 INFO  L276                IsEmpty]: Start isEmpty. Operand 579 states and 843 transitions.
[2025-03-03 23:51:32,926 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-03 23:51:32,926 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:32,926 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:32,927 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 23:51:32,927 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:32,927 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:32,927 INFO  L85        PathProgramCache]: Analyzing trace with hash -700842811, now seen corresponding path program 1 times
[2025-03-03 23:51:32,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:51:32,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473886671]
[2025-03-03 23:51:32,930 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:32,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:51:32,941 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 23:51:32,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 23:51:32,997 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:32,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:33,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked.
[2025-03-03 23:51:33,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:51:33,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473886671]
[2025-03-03 23:51:33,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473886671] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 23:51:33,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728359739]
[2025-03-03 23:51:33,217 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:33,217 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:51:33,217 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:51:33,219 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 23:51:33,220 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 23:51:33,272 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 23:51:33,312 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 23:51:33,312 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:33,312 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:33,317 INFO  L256         TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-03-03 23:51:33,321 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:51:33,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked.
[2025-03-03 23:51:33,643 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 23:51:33,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked.
[2025-03-03 23:51:33,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728359739] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 23:51:33,988 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 23:51:33,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17
[2025-03-03 23:51:33,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818598236]
[2025-03-03 23:51:33,988 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 23:51:33,989 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-03-03 23:51:33,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:51:33,989 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-03-03 23:51:33,989 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272
[2025-03-03 23:51:33,990 INFO  L87              Difference]: Start difference. First operand 579 states and 843 transitions. Second operand  has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63)
[2025-03-03 23:51:35,176 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:51:35,177 INFO  L93              Difference]: Finished difference Result 1561 states and 2257 transitions.
[2025-03-03 23:51:35,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2025-03-03 23:51:35,178 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 145
[2025-03-03 23:51:35,178 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:51:35,182 INFO  L225             Difference]: With dead ends: 1561
[2025-03-03 23:51:35,183 INFO  L226             Difference]: Without dead ends: 999
[2025-03-03 23:51:35,185 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=1431, Unknown=0, NotChecked=0, Total=1806
[2025-03-03 23:51:35,185 INFO  L435           NwaCegarLoop]: 176 mSDtfsCounter, 1372 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 23:51:35,185 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 1467 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 23:51:35,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 999 states.
[2025-03-03 23:51:35,257 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 787.
[2025-03-03 23:51:35,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 787 states, 575 states have (on average 1.3043478260869565) internal successors, (750), 580 states have internal predecessors, (750), 186 states have call successors, (186), 25 states have call predecessors, (186), 25 states have return successors, (186), 181 states have call predecessors, (186), 186 states have call successors, (186)
[2025-03-03 23:51:35,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1122 transitions.
[2025-03-03 23:51:35,267 INFO  L78                 Accepts]: Start accepts. Automaton has 787 states and 1122 transitions. Word has length 145
[2025-03-03 23:51:35,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:51:35,268 INFO  L471      AbstractCegarLoop]: Abstraction has 787 states and 1122 transitions.
[2025-03-03 23:51:35,268 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63)
[2025-03-03 23:51:35,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 787 states and 1122 transitions.
[2025-03-03 23:51:35,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2025-03-03 23:51:35,270 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:35,270 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:35,276 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-03 23:51:35,474 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-03-03 23:51:35,474 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:35,474 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:35,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 936706218, now seen corresponding path program 1 times
[2025-03-03 23:51:35,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:51:35,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307120349]
[2025-03-03 23:51:35,475 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:35,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:51:35,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes.
[2025-03-03 23:51:35,567 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements.
[2025-03-03 23:51:35,569 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:35,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-03 23:51:35,574 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130695919]
[2025-03-03 23:51:35,575 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:35,575 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:51:35,575 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:51:35,577 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 23:51:35,579 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 23:51:35,646 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes.
[2025-03-03 23:51:35,741 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements.
[2025-03-03 23:51:35,741 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:35,741 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 23:51:35,741 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-03 23:51:35,759 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes.
[2025-03-03 23:51:35,800 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements.
[2025-03-03 23:51:35,801 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:35,801 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 23:51:35,885 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-03 23:51:35,885 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-03 23:51:35,886 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 23:51:35,895 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 23:51:36,087 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:51:36,090 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:51:36,178 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 23:51:36,180 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:51:36 BoogieIcfgContainer
[2025-03-03 23:51:36,180 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 23:51:36,181 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 23:51:36,181 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 23:51:36,181 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 23:51:36,181 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:51:28" (3/4) ...
[2025-03-03 23:51:36,184 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-03 23:51:36,185 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 23:51:36,186 INFO  L158              Benchmark]: Toolchain (without parser) took 9030.98ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 111.7MB in the beginning and 341.6MB in the end (delta: -229.8MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB.
[2025-03-03 23:51:36,187 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 23:51:36,187 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 289.19ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 23:51:36,187 INFO  L158              Benchmark]: Boogie Procedure Inliner took 41.39ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 91.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 23:51:36,187 INFO  L158              Benchmark]: Boogie Preprocessor took 57.92ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 85.0MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 23:51:36,188 INFO  L158              Benchmark]: IcfgBuilder took 532.54ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 52.4MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-03 23:51:36,188 INFO  L158              Benchmark]: TraceAbstraction took 8100.13ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 51.4MB in the beginning and 345.7MB in the end (delta: -294.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 23:51:36,188 INFO  L158              Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 419.4MB. Free memory was 345.7MB in the beginning and 341.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 23:51:36,190 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 289.19ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 41.39ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 91.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 57.92ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 85.0MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 532.54ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 52.4MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8100.13ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 51.4MB in the beginning and 345.7MB in the end (delta: -294.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 4.22ms. Allocated memory is still 419.4MB. Free memory was 345.7MB in the beginning and 341.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someUnaryFLOAToperation at line 89. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    signed short int var_1_1 = 2;
[L23]                    signed char var_1_7 = -25;
[L24]                    signed char var_1_9 = 50;
[L25]                    signed char var_1_10 = -128;
[L26]                    signed char var_1_11 = 0;
[L27]                    signed char var_1_12 = -32;
[L28]                    signed long int var_1_13 = 16;
[L29]                    unsigned char var_1_14 = 1;
[L30]                    unsigned long int var_1_15 = 16;
[L31]                    unsigned char var_1_18 = 0;
[L32]                    unsigned char var_1_19 = 0;
[L33]                    unsigned char var_1_20 = 0;
[L34]                    float var_1_21 = 127.25;
[L35]                    float var_1_23 = 1.5;
[L36]                    float var_1_24 = 100.5;
[L37]                    signed char var_1_25 = 0;
[L38]                    signed char var_1_26 = -2;
[L39]                    signed char var_1_27 = 0;
[L40]                    signed long int var_1_28 = -128;
[L41]                    float var_1_30 = 9.375;
[L42]                    double var_1_31 = 99999999.875;
[L43]                    double var_1_32 = 4.8;
[L44]                    unsigned short int var_1_33 = 0;
[L45]                    unsigned short int var_1_35 = 54252;
[L46]                    unsigned short int var_1_37 = 5;
[L47]                    unsigned char var_1_38 = 4;
[L48]                    signed char var_1_39 = -64;
[L49]                    signed char last_1_var_1_10 = -128;
[L50]                    unsigned char last_1_var_1_18 = 0;
[L51]                    signed char last_1_var_1_25 = 0;
[L52]                    unsigned short int last_1_var_1_33 = 0;
[L53]                    signed char last_1_var_1_39 = -64;
             VAL         [isInitial=0, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=50]
[L183]                   isInitial = 1
[L184]       FCALL       initially()
[L185]       COND TRUE   1
[L186]       CALL        updateLastVariables()
[L172]                   last_1_var_1_10 = var_1_10
[L173]                   last_1_var_1_18 = var_1_18
[L174]                   last_1_var_1_25 = var_1_25
[L175]                   last_1_var_1_33 = var_1_33
[L176]                   last_1_var_1_39 = var_1_39
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=50]
[L186]       RET         updateLastVariables()
[L187]       CALL        updateVariables()
[L137]                   var_1_9 = __VERIFIER_nondet_char()
[L138]       CALL        assume_abort_if_not(var_1_9 >= -127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L138]       RET         assume_abort_if_not(var_1_9 >= -127)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L139]       CALL        assume_abort_if_not(var_1_9 <= 126)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L139]       RET         assume_abort_if_not(var_1_9 <= 126)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L140]                   var_1_11 = __VERIFIER_nondet_char()
[L141]       CALL        assume_abort_if_not(var_1_11 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L141]       RET         assume_abort_if_not(var_1_11 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L142]       CALL        assume_abort_if_not(var_1_11 <= 126)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L142]       RET         assume_abort_if_not(var_1_11 <= 126)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L143]                   var_1_13 = __VERIFIER_nondet_long()
[L144]       CALL        assume_abort_if_not(var_1_13 >= -2147483648)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L144]       RET         assume_abort_if_not(var_1_13 >= -2147483648)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L145]       CALL        assume_abort_if_not(var_1_13 <= 2147483647)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L145]       RET         assume_abort_if_not(var_1_13 <= 2147483647)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L146]       CALL        assume_abort_if_not(var_1_13 != 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L146]       RET         assume_abort_if_not(var_1_13 != 0)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L147]                   var_1_19 = __VERIFIER_nondet_uchar()
[L148]       CALL        assume_abort_if_not(var_1_19 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L148]       RET         assume_abort_if_not(var_1_19 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L149]       CALL        assume_abort_if_not(var_1_19 <= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L149]       RET         assume_abort_if_not(var_1_19 <= 0)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L150]                   var_1_20 = __VERIFIER_nondet_uchar()
[L151]       CALL        assume_abort_if_not(var_1_20 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L151]       RET         assume_abort_if_not(var_1_20 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L152]       CALL        assume_abort_if_not(var_1_20 <= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L152]       RET         assume_abort_if_not(var_1_20 <= 0)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L153]                   var_1_23 = __VERIFIER_nondet_float()
[L154]       CALL        assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L154]       RET         assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L155]                   var_1_24 = __VERIFIER_nondet_float()
[L156]       CALL        assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L156]       RET         assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L157]                   var_1_26 = __VERIFIER_nondet_char()
[L158]       CALL        assume_abort_if_not(var_1_26 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L158]       RET         assume_abort_if_not(var_1_26 >= -63)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L159]       CALL        assume_abort_if_not(var_1_26 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L159]       RET         assume_abort_if_not(var_1_26 <= 63)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L160]                   var_1_27 = __VERIFIER_nondet_char()
[L161]       CALL        assume_abort_if_not(var_1_27 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L161]       RET         assume_abort_if_not(var_1_27 >= -63)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L162]       CALL        assume_abort_if_not(var_1_27 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L162]       RET         assume_abort_if_not(var_1_27 <= 63)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L163]                   var_1_31 = __VERIFIER_nondet_double()
[L164]       CALL        assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L164]       RET         assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L165]                   var_1_32 = __VERIFIER_nondet_double()
[L166]       CALL        assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L166]       RET         assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L167]                   var_1_35 = __VERIFIER_nondet_ushort()
[L168]       CALL        assume_abort_if_not(var_1_35 >= 49150)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L168]       RET         assume_abort_if_not(var_1_35 >= 49150)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L169]       CALL        assume_abort_if_not(var_1_35 <= 65534)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L169]       RET         assume_abort_if_not(var_1_35 <= 65534)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L187]       RET         updateVariables()
[L188]       CALL        step()
[L57]                    unsigned char stepLocal_3 = last_1_var_1_18;
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_3=0, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L58]        COND FALSE  !(stepLocal_3 || var_1_20)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L61]        COND FALSE  !(\read(var_1_20))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L65]                    var_1_18 = (! (var_1_19 || var_1_20))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L66]        COND TRUE   (- var_1_24) < var_1_23
[L67]                    var_1_25 = (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-1]
[L69]                    var_1_37 = var_1_11
[L70]                    var_1_38 = var_1_11
[L71]                    var_1_39 = var_1_11
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-25, var_1_9=-1]
[L72]        COND TRUE   \read(var_1_18)
[L73]                    var_1_7 = var_1_9
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L75]                    signed char stepLocal_1 = var_1_9;
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_1=-1, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L76]        COND FALSE  !((last_1_var_1_10 + var_1_7) > stepLocal_1)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L79]        COND TRUE   (var_1_7 / var_1_13) == var_1_25
[L80]                    var_1_12 = var_1_9
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L88]        COND TRUE   (var_1_11 - var_1_37) != -256
[L89]                    var_1_21 = ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24)))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L93]                    signed long int stepLocal_4 = var_1_28;
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L94]        COND TRUE   ((var_1_31 - var_1_32) + var_1_24) != var_1_23
[L95]                    var_1_30 = ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24)))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L101]       COND TRUE   var_1_28 < var_1_37
[L102]                   var_1_33 = (((26262 - var_1_11) + 18571) - var_1_38)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L122]                   signed long int stepLocal_0 = var_1_28;
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_0=-128, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L123]       COND TRUE   stepLocal_0 >= (var_1_37 * (10u * var_1_33))
[L124]                   var_1_1 = (var_1_10 + var_1_10)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L128]                   unsigned long int stepLocal_2 = 1u;
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_2=1, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L129]       COND FALSE  !((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == stepLocal_2)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L132]       COND TRUE   var_1_1 <= var_1_33
[L133]                   var_1_15 = ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37)))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L188]       RET         step()
[L189]       CALL, EXPR  property()
[L179]       EXPR        ((((((((((((var_1_28 >= (var_1_37 * (10u * var_1_33))) ? (var_1_1 == ((signed short int) (var_1_10 + var_1_10))) : (var_1_1 == ((signed short int) var_1_10))) && (var_1_18 ? (var_1_7 == ((signed char) var_1_9)) : 1)) && (((last_1_var_1_10 + var_1_7) > var_1_9) ? (var_1_10 == ((signed char) (1 - var_1_11))) : 1)) && (((var_1_7 / var_1_13) == var_1_25) ? (var_1_12 == ((signed char) var_1_9)) : ((var_1_13 >= var_1_11) ? (var_1_12 == ((signed char) var_1_11)) : (var_1_12 == ((signed char) var_1_9))))) && (((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == 1u) ? (var_1_14 == ((unsigned char) (! 0))) : 1)) && ((var_1_1 <= var_1_33) ? (var_1_15 == ((unsigned long int) ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))))) : 1)) && (var_1_18 == ((unsigned char) (! (var_1_19 || var_1_20))))) && (((var_1_11 - var_1_37) != -256) ? (var_1_21 == ((float) ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))))) : (var_1_21 == ((float) var_1_23)))) && (((- var_1_24) < var_1_23) ? (var_1_25 == ((signed char) (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27))) : 1)) && ((last_1_var_1_18 || var_1_20) ? (var_1_28 == ((signed long int) (((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) > (last_1_var_1_25)) ? ((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) : (last_1_var_1_25))))) : (var_1_20 ? (var_1_28 == ((signed long int) ((((last_1_var_1_33) > ((last_1_var_1_39 + last_1_var_1_25))) ? (last_1_var_1_33) : ((last_1_var_1_39 + last_1_var_1_25)))))) : 1))) && ((((var_1_31 - var_1_32) + var_1_24) != var_1_23) ? (var_1_30 == ((float) ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))))) : ((var_1_28 <= var_1_10) ? (var_1_30 == ((float) var_1_23)) : 1))) && ((var_1_28 < var_1_37) ? (var_1_33 == ((unsigned short int) (((26262 - var_1_11) + 18571) - var_1_38))) : ((! var_1_18) ? ((var_1_10 != (var_1_38 & (var_1_11 - 32))) ? (var_1_33 == ((unsigned short int) ((((((var_1_35 - var_1_11) - var_1_38)) < (var_1_38)) ? (((var_1_35 - var_1_11) - var_1_38)) : (var_1_38))))) : (var_1_33 == ((unsigned short int) (var_1_35 - var_1_38)))) : ((128u > var_1_38) ? (((var_1_38 * var_1_38) == (var_1_38 & var_1_28)) ? (var_1_33 == ((unsigned short int) var_1_11)) : (var_1_33 == ((unsigned short int) ((((((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) < (var_1_38)) ? (((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) : (var_1_38)))))) : (var_1_33 == ((unsigned short int) var_1_38)))))
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L179-L180]              return (((((((((((((((var_1_28 >= (var_1_37 * (10u * var_1_33))) ? (var_1_1 == ((signed short int) (var_1_10 + var_1_10))) : (var_1_1 == ((signed short int) var_1_10))) && (var_1_18 ? (var_1_7 == ((signed char) var_1_9)) : 1)) && (((last_1_var_1_10 + var_1_7) > var_1_9) ? (var_1_10 == ((signed char) (1 - var_1_11))) : 1)) && (((var_1_7 / var_1_13) == var_1_25) ? (var_1_12 == ((signed char) var_1_9)) : ((var_1_13 >= var_1_11) ? (var_1_12 == ((signed char) var_1_11)) : (var_1_12 == ((signed char) var_1_9))))) && (((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == 1u) ? (var_1_14 == ((unsigned char) (! 0))) : 1)) && ((var_1_1 <= var_1_33) ? (var_1_15 == ((unsigned long int) ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))))) : 1)) && (var_1_18 == ((unsigned char) (! (var_1_19 || var_1_20))))) && (((var_1_11 - var_1_37) != -256) ? (var_1_21 == ((float) ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))))) : (var_1_21 == ((float) var_1_23)))) && (((- var_1_24) < var_1_23) ? (var_1_25 == ((signed char) (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27))) : 1)) && ((last_1_var_1_18 || var_1_20) ? (var_1_28 == ((signed long int) (((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) > (last_1_var_1_25)) ? ((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) : (last_1_var_1_25))))) : (var_1_20 ? (var_1_28 == ((signed long int) ((((last_1_var_1_33) > ((last_1_var_1_39 + last_1_var_1_25))) ? (last_1_var_1_33) : ((last_1_var_1_39 + last_1_var_1_25)))))) : 1))) && ((((var_1_31 - var_1_32) + var_1_24) != var_1_23) ? (var_1_30 == ((float) ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))))) : ((var_1_28 <= var_1_10) ? (var_1_30 == ((float) var_1_23)) : 1))) && ((var_1_28 < var_1_37) ? (var_1_33 == ((unsigned short int) (((26262 - var_1_11) + 18571) - var_1_38))) : ((! var_1_18) ? ((var_1_10 != (var_1_38 & (var_1_11 - 32))) ? (var_1_33 == ((unsigned short int) ((((((var_1_35 - var_1_11) - var_1_38)) < (var_1_38)) ? (((var_1_35 - var_1_11) - var_1_38)) : (var_1_38))))) : (var_1_33 == ((unsigned short int) (var_1_35 - var_1_38)))) : ((128u > var_1_38) ? (((var_1_38 * var_1_38) == (var_1_38 & var_1_28)) ? (var_1_33 == ((unsigned short int) var_1_11)) : (var_1_33 == ((unsigned short int) ((((((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) < (var_1_38)) ? (((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) : (var_1_38)))))) : (var_1_33 == ((unsigned short int) var_1_38)))))) && (var_1_37 == ((unsigned short int) var_1_11))) && (var_1_38 == ((unsigned char) var_1_11))) && (var_1_39 == ((signed char) var_1_11))
;
[L189]       RET, EXPR   property()
[L189]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-1, var_1_13=25, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-1, var_1_9=-1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2846 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2844 mSDsluCounter, 3890 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3052 mSDsCounter, 690 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 690 mSolverCounterUnsat, 838 mSDtfsCounter, 1836 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=787occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 655 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1452 NumberOfCodeBlocks, 1452 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1296 ConstructedInterpolants, 0 QuantifiedInterpolants, 4221 SizeOfPredicates, 4 NumberOfNonLiveVariables, 742 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 7430/7560 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-03-03 23:51:36,209 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4e8a5c4063538a4dcf229465482ca721f86e7f33293608e4514c59ac5276800d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 23:51:38,086 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 23:51:38,164 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-03 23:51:38,174 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 23:51:38,174 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 23:51:38,194 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 23:51:38,195 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 23:51:38,195 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 23:51:38,196 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 23:51:38,196 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 23:51:38,196 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 23:51:38,197 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 23:51:38,197 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 23:51:38,197 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 23:51:38,197 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 23:51:38,197 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-03 23:51:38,198 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-03 23:51:38,199 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-03 23:51:38,199 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 23:51:38,199 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 23:51:38,199 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 23:51:38,199 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 23:51:38,199 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 23:51:38,199 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 23:51:38,200 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 23:51:38,200 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 23:51:38,200 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/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 -> 4e8a5c4063538a4dcf229465482ca721f86e7f33293608e4514c59ac5276800d
[2025-03-03 23:51:38,453 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 23:51:38,459 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 23:51:38,461 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 23:51:38,461 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 23:51:38,462 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 23:51:38,464 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i
[2025-03-03 23:51:39,600 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089d1241a/cc74cc0a5ec74ae795eb7971983f9c32/FLAG231836689
[2025-03-03 23:51:39,831 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 23:51:39,833 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i
[2025-03-03 23:51:39,841 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089d1241a/cc74cc0a5ec74ae795eb7971983f9c32/FLAG231836689
[2025-03-03 23:51:39,857 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089d1241a/cc74cc0a5ec74ae795eb7971983f9c32
[2025-03-03 23:51:39,859 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 23:51:39,861 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 23:51:39,862 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 23:51:39,862 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 23:51:39,865 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 23:51:39,866 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:51:39" (1/1) ...
[2025-03-03 23:51:39,866 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e2ddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:39, skipping insertion in model container
[2025-03-03 23:51:39,868 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:51:39" (1/1) ...
[2025-03-03 23:51:39,880 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 23:51:39,983 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i[916,929]
[2025-03-03 23:51:40,044 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 23:51:40,056 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 23:51:40,063 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-16.i[916,929]
[2025-03-03 23:51:40,095 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 23:51:40,115 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 23:51:40,116 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40 WrapperNode
[2025-03-03 23:51:40,116 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 23:51:40,117 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 23:51:40,117 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 23:51:40,117 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 23:51:40,122 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,130 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,146 INFO  L138                Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174
[2025-03-03 23:51:40,146 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 23:51:40,147 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 23:51:40,147 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 23:51:40,147 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 23:51:40,157 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,157 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,160 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,169 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-03-03 23:51:40,169 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,169 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,179 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,181 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,183 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,183 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,189 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 23:51:40,190 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 23:51:40,190 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 23:51:40,191 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 23:51:40,192 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (1/1) ...
[2025-03-03 23:51:40,196 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 23:51:40,206 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:51:40,219 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 23:51:40,222 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 23:51:40,240 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 23:51:40,240 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-03 23:51:40,241 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 23:51:40,241 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 23:51:40,241 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 23:51:40,241 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 23:51:40,309 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 23:51:40,311 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 23:51:50,497 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2025-03-03 23:51:50,500 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 23:51:50,507 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 23:51:50,507 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 23:51:50,508 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:51:50 BoogieIcfgContainer
[2025-03-03 23:51:50,508 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 23:51:50,521 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 23:51:50,521 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 23:51:50,524 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 23:51:50,524 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:51:39" (1/3) ...
[2025-03-03 23:51:50,525 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16991c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:51:50, skipping insertion in model container
[2025-03-03 23:51:50,525 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:51:40" (2/3) ...
[2025-03-03 23:51:50,525 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16991c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:51:50, skipping insertion in model container
[2025-03-03 23:51:50,525 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:51:50" (3/3) ...
[2025-03-03 23:51:50,526 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-16.i
[2025-03-03 23:51:50,535 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 23:51:50,536 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-16.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 23:51:50,570 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 23:51:50,577 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;@25e33e91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 23:51:50,578 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 23:51:50,580 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 75 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-03-03 23:51:50,589 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 23:51:50,589 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:50,589 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:50,590 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:50,594 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:50,595 INFO  L85        PathProgramCache]: Analyzing trace with hash 143065381, now seen corresponding path program 1 times
[2025-03-03 23:51:50,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:51:50,605 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419741021]
[2025-03-03 23:51:50,606 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:50,606 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-03-03 23:51:50,606 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:51:50,610 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-03 23:51:50,612 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:51:50,686 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 23:51:50,893 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 23:51:50,893 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:50,893 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:50,904 INFO  L256         TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 23:51:50,909 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:51:50,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked.
[2025-03-03 23:51:50,946 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:51:50,947 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:51:50,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419741021]
[2025-03-03 23:51:50,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419741021] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:51:50,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:51:50,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 23:51:50,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859645046]
[2025-03-03 23:51:50,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:51:50,951 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 23:51:50,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:51:50,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 23:51:50,963 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 23:51:50,964 INFO  L87              Difference]: Start difference. First operand  has 75 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)
[2025-03-03 23:51:50,980 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:51:50,980 INFO  L93              Difference]: Finished difference Result 144 states and 246 transitions.
[2025-03-03 23:51:50,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 23:51:50,981 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143
[2025-03-03 23:51:50,982 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:51:50,985 INFO  L225             Difference]: With dead ends: 144
[2025-03-03 23:51:50,985 INFO  L226             Difference]: Without dead ends: 72
[2025-03-03 23:51:50,989 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-03-03 23:51:50,990 INFO  L435           NwaCegarLoop]: 110 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, 110 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-03-03 23:51:50,990 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 23:51:51,000 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2025-03-03 23:51:51,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2025-03-03 23:51:51,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-03-03 23:51:51,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions.
[2025-03-03 23:51:51,024 INFO  L78                 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 143
[2025-03-03 23:51:51,025 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:51:51,025 INFO  L471      AbstractCegarLoop]: Abstraction has 72 states and 110 transitions.
[2025-03-03 23:51:51,025 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)
[2025-03-03 23:51:51,025 INFO  L276                IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions.
[2025-03-03 23:51:51,029 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 23:51:51,029 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:51:51,029 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:51:51,040 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0
[2025-03-03 23:51:51,230 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-03 23:51:51,230 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:51:51,231 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:51:51,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 820265664, now seen corresponding path program 1 times
[2025-03-03 23:51:51,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:51:51,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671591318]
[2025-03-03 23:51:51,232 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:51:51,232 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-03-03 23:51:51,232 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:51:51,235 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-03 23:51:51,236 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:51:51,297 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 23:51:51,489 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 23:51:51,489 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:51:51,489 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:51:51,500 INFO  L256         TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-03 23:51:51,507 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:51:52,809 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked.
[2025-03-03 23:51:52,809 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 23:51:53,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked.
[2025-03-03 23:51:53,556 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:51:53,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671591318]
[2025-03-03 23:51:53,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [671591318] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 23:51:53,557 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 23:51:53,558 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10
[2025-03-03 23:51:53,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694596991]
[2025-03-03 23:51:53,558 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 23:51:53,559 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 23:51:53,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:51:53,559 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 23:51:53,559 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-03-03 23:51:53,560 INFO  L87              Difference]: Start difference. First operand 72 states and 110 transitions. Second operand  has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42)
[2025-03-03 23:51:56,247 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-03 23:51:59,517 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-03 23:52:00,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:00,285 INFO  L93              Difference]: Finished difference Result 292 states and 445 transitions.
[2025-03-03 23:52:00,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 23:52:00,285 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 143
[2025-03-03 23:52:00,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:00,288 INFO  L225             Difference]: With dead ends: 292
[2025-03-03 23:52:00,288 INFO  L226             Difference]: Without dead ends: 223
[2025-03-03 23:52:00,288 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380
[2025-03-03 23:52:00,290 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 312 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:00,290 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 523 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time]
[2025-03-03 23:52:00,290 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 223 states.
[2025-03-03 23:52:00,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184.
[2025-03-03 23:52:00,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 184 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 130 states have internal predecessors, (181), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51)
[2025-03-03 23:52:00,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 283 transitions.
[2025-03-03 23:52:00,314 INFO  L78                 Accepts]: Start accepts. Automaton has 184 states and 283 transitions. Word has length 143
[2025-03-03 23:52:00,315 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:00,315 INFO  L471      AbstractCegarLoop]: Abstraction has 184 states and 283 transitions.
[2025-03-03 23:52:00,315 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42)
[2025-03-03 23:52:00,315 INFO  L276                IsEmpty]: Start isEmpty. Operand 184 states and 283 transitions.
[2025-03-03 23:52:00,316 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-03 23:52:00,316 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:00,316 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:52:00,327 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:52:00,517 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-03 23:52:00,517 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:00,517 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:00,518 INFO  L85        PathProgramCache]: Analyzing trace with hash -1069376275, now seen corresponding path program 1 times
[2025-03-03 23:52:00,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:52:00,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404089043]
[2025-03-03 23:52:00,518 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:00,518 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-03-03 23:52:00,518 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:52:00,520 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-03 23:52:00,521 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:52:00,550 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-03 23:52:00,750 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-03 23:52:00,750 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:00,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:00,760 INFO  L256         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 23:52:00,763 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:52:00,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2025-03-03 23:52:00,918 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:52:00,918 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:52:00,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404089043]
[2025-03-03 23:52:00,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404089043] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:00,918 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:00,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 23:52:00,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699794067]
[2025-03-03 23:52:00,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:00,919 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 23:52:00,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:52:00,919 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 23:52:00,919 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:52:00,920 INFO  L87              Difference]: Start difference. First operand 184 states and 283 transitions. Second operand  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:52:03,745 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2025-03-03 23:52:06,747 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2025-03-03 23:52:07,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:07,253 INFO  L93              Difference]: Finished difference Result 575 states and 868 transitions.
[2025-03-03 23:52:07,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 23:52:07,254 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144
[2025-03-03 23:52:07,256 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:07,260 INFO  L225             Difference]: With dead ends: 575
[2025-03-03 23:52:07,260 INFO  L226             Difference]: Without dead ends: 394
[2025-03-03 23:52:07,261 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 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-03-03 23:52:07,262 INFO  L435           NwaCegarLoop]: 171 mSDtfsCounter, 154 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:07,262 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 431 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time]
[2025-03-03 23:52:07,263 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 394 states.
[2025-03-03 23:52:07,303 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 287.
[2025-03-03 23:52:07,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 287 states, 193 states have (on average 1.2953367875647668) internal successors, (250), 197 states have internal predecessors, (250), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 79 states have call predecessors, (83), 83 states have call successors, (83)
[2025-03-03 23:52:07,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 416 transitions.
[2025-03-03 23:52:07,309 INFO  L78                 Accepts]: Start accepts. Automaton has 287 states and 416 transitions. Word has length 144
[2025-03-03 23:52:07,310 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:07,310 INFO  L471      AbstractCegarLoop]: Abstraction has 287 states and 416 transitions.
[2025-03-03 23:52:07,310 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:52:07,310 INFO  L276                IsEmpty]: Start isEmpty. Operand 287 states and 416 transitions.
[2025-03-03 23:52:07,311 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-03 23:52:07,311 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:07,311 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:52:07,323 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:52:07,512 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-03 23:52:07,512 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:07,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:07,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -1040747124, now seen corresponding path program 1 times
[2025-03-03 23:52:07,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:52:07,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671670753]
[2025-03-03 23:52:07,513 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:07,513 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-03-03 23:52:07,513 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:52:07,515 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-03 23:52:07,516 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:52:07,549 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-03 23:52:07,740 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-03 23:52:07,740 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:07,740 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:07,750 INFO  L256         TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 23:52:07,754 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:52:08,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2025-03-03 23:52:08,356 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:52:08,356 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:52:08,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671670753]
[2025-03-03 23:52:08,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671670753] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:08,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:08,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 23:52:08,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582072208]
[2025-03-03 23:52:08,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:08,357 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 23:52:08,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:52:08,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 23:52:08,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 23:52:08,357 INFO  L87              Difference]: Start difference. First operand 287 states and 416 transitions. Second operand  has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:52:13,116 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-03 23:52:16,344 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-03 23:52:16,360 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:16,360 INFO  L93              Difference]: Finished difference Result 933 states and 1350 transitions.
[2025-03-03 23:52:16,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 23:52:16,389 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144
[2025-03-03 23:52:16,389 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:16,392 INFO  L225             Difference]: With dead ends: 933
[2025-03-03 23:52:16,392 INFO  L226             Difference]: Without dead ends: 653
[2025-03-03 23:52:16,393 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2025-03-03 23:52:16,394 INFO  L435           NwaCegarLoop]: 98 mSDtfsCounter, 204 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:16,394 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 424 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time]
[2025-03-03 23:52:16,395 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 653 states.
[2025-03-03 23:52:16,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 493.
[2025-03-03 23:52:16,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 493 states, 342 states have (on average 1.3157894736842106) internal successors, (450), 347 states have internal predecessors, (450), 134 states have call successors, (134), 16 states have call predecessors, (134), 16 states have return successors, (134), 129 states have call predecessors, (134), 134 states have call successors, (134)
[2025-03-03 23:52:16,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 718 transitions.
[2025-03-03 23:52:16,440 INFO  L78                 Accepts]: Start accepts. Automaton has 493 states and 718 transitions. Word has length 144
[2025-03-03 23:52:16,441 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:16,441 INFO  L471      AbstractCegarLoop]: Abstraction has 493 states and 718 transitions.
[2025-03-03 23:52:16,441 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2025-03-03 23:52:16,441 INFO  L276                IsEmpty]: Start isEmpty. Operand 493 states and 718 transitions.
[2025-03-03 23:52:16,442 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-03 23:52:16,442 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:16,442 INFO  L218           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:52:16,454 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:52:16,643 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-03 23:52:16,643 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:16,644 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:16,644 INFO  L85        PathProgramCache]: Analyzing trace with hash 466804685, now seen corresponding path program 1 times
[2025-03-03 23:52:16,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:52:16,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108785066]
[2025-03-03 23:52:16,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:16,644 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:52:16,644 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:52:16,646 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-03 23:52:16,647 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:52:16,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-03 23:52:16,871 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-03 23:52:16,872 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:16,872 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:16,883 INFO  L256         TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjuncts are in the unsatisfiable core
[2025-03-03 23:52:16,887 INFO  L279         TraceCheckSpWp]: Computing forward predicates...